Incedo Coding Questions and Answers

#include<bits/stdc++.h>
using namespace std;

class WindowFinder {
public:
    string findSmallestWindow(string s, string p) {
        if (p.length() > s.length()) {
            return "-1";
        } else {
            int sHash[26] = {0};
            int pHash[26] = {0};

            for (int i = 0; i < p.length(); i++) {
                pHash[p[i] - 'a']++;
            }

            int counter = 0;
            int begin = 0;
            int startIndex = -1;
            int length = 0;
            int minLength = INT_MAX;

            for (int i = 0; i < s.length(); i++) {
                sHash[s[i] - 'a']++;

                if (pHash[s[i] - 'a'] != 0 && sHash[s[i] - 'a'] <= pHash[s[i] - 'a']) { counter++; } if (counter == p.length()) { while (sHash[s[begin] - 'a'] > pHash[s[begin] - 'a'] || pHash[s[begin] - 'a'] == 0) {
                        if (sHash[s[begin] - 'a'] > pHash[s[begin] - 'a']) {
                            sHash[s[begin] - 'a']--;
                        }
                        begin++;
                    }

                    length = i - begin + 1;
                    if (length < minLength) {
                        startIndex = begin;
                        minLength = length;
                    }
                }
            }

            if (startIndex == -1) {
                return "-1";
            } else {
                return s.substr(startIndex, minLength);
            }
        }
    }
};

// Test the code
int main() {
    string s = "timetopractice";
    string p = "toc";

    WindowFinder windowFinder;
    string smallestWindow = windowFinder.findSmallestWindow(s, p);

    // Print the result
    cout << smallestWindow << endl;

    return 0;
}

class WindowFinder:
    def find_smallest_window(self, s, p):
        if len(p) > len(s):
            return -1

        shash = [0] * 26
        phash = [0] * 26

        for char in p:
            phash[ord(char) - ord('a')] += 1

        counter = 0
        begin = 0
        start_index = -1
        length = 0
        min_length = float('inf')

        for i in range(len(s)):
            shash[ord(s[i]) - ord('a')] += 1

            if phash[ord(s[i]) - ord('a')] != 0 and shash[ord(s[i]) - ord('a')] <= phash[ord(s[i]) - ord('a')]: counter += 1 if counter == len(p): while shash[ord(s[begin]) - ord('a')] > phash[ord(s[begin]) - ord('a')] or phash[ord(s[begin]) - ord('a')] == 0:
                    if shash[ord(s[begin]) - ord('a')] > phash[ord(s[begin]) - ord('a')]:
                        shash[ord(s[begin]) - ord('a')] -= 1
                    begin += 1

                length = i - begin + 1

                if length < min_length:
                    start_index = begin
                    min_length = length

        if start_index == -1:
            return "-1"
        else:
            return s[start_index:start_index + min_length]


s = "timetopractice"
p = "toc"

window_finder = WindowFinder()
smallest_window = window_finder.find_smallest_window(s, p)

print(smallest_window)

public class Main{
    public static String findSmallestWindow(String s, String p) {
        int len1 = s.length();
        int len2 = p.length();

        if (len1 < len2) {
            return "-1";
        }

        int[] patHash = new int[256];
        int[] strHash = new int[256];

        for (int i = 0; i < len2; i++) {
            patHash[p.charAt(i)]++;
        }

        int start = 0;
        int startIndex = -1;
        int minLength = Integer.MAX_VALUE;
        int count = 0;

        for (int j = 0; j < len1; j++) {
            strHash[s.charAt(j)]++;

            if (patHash[s.charAt(j)] != 0 && strHash[s.charAt(j)] <= patHash[s.charAt(j)]) { count++; } if (count == len2) { while (strHash[s.charAt(start)] > patHash[s.charAt(start)] || patHash[s.charAt(start)] == 0) {
                    if (strHash[s.charAt(start)] > patHash[s.charAt(start)]) {
                        strHash[s.charAt(start)]--;
                    }
                    start++;
                }

                int windowLen = j - start + 1;
                if (minLength > windowLen) {
                    minLength = windowLen;
                    startIndex = start;
                }
            }
        }

        if (startIndex == -1) {
            return "-1";
        } else {
            return s.substring(startIndex, startIndex + minLength);
        }
    }

    // Test the code
    public static void main(String[] args) {
        String s = "timetopractice";
        String p = "toc";

        String smallestWindow = findSmallestWindow(s, p);

        // Print the result
        System.out.println(smallestWindow);
    }
}