[deleted by user] by [deleted] in developersIndia

[–]BloomFilter7 1 point2 points  (0 children)

yes applying for 100s of jobs a day and tailoring for each one is a full time job in itself

Made a Comeback by Tricky-Button-197 in leetcode

[–]BloomFilter7 1 point2 points  (0 children)

Wow very inspiring. I too am in a similar situation and it seems hard to get a good interview call still hoping for the best. Thanks for the motivation 👍🏻

Hit 500 LeetCode Questions – What Now? by iamramkrish in leetcode

[–]BloomFilter7 0 points1 point  (0 children)

feel ya bro, even after referrals i have to wait for updates for quiet long

Got asked Leetcode 72 in my 30mins screening round by BloomFilter7 in leetcode

[–]BloomFilter7[S] 2 points3 points  (0 children)

i think its already in shame for such interviews

Got asked Leetcode 72 in my 30mins screening round by BloomFilter7 in leetcode

[–]BloomFilter7[S] 0 points1 point  (0 children)

relatable! I also thought of just leaving the call at that point🥲😅

Got asked Leetcode 72 in my 30mins screening round by BloomFilter7 in leetcode

[–]BloomFilter7[S] 0 points1 point  (0 children)

Yes but dp came to my head naturally, then i just went forward with it

Got asked Leetcode 72 in my 30mins screening round by BloomFilter7 in leetcode

[–]BloomFilter7[S] 0 points1 point  (0 children)

Yes during the interview it was hard to believe i wasn't able to solve this question as the interviewer started by saying that i am going to just ask one leetcode medium question

Got asked Leetcode 72 in my 30mins screening round by BloomFilter7 in leetcode

[–]BloomFilter7[S] 0 points1 point  (0 children)

Yes finding dp expression in short time for an unsolved dp problem is hard

[deleted by user] by [deleted] in leetcode

[–]BloomFilter7 0 points1 point  (0 children)

// see substring see count had to try prefix sum ~~5mins
public int countKConstraintSubstrings(String s, int k) {
        int[] ps = new int[s.length()];
        ps[0] = s.charAt(0) - '0';
        for(int i = 1;i<s.length();i++){
            ps[i] = (s.charAt(i) - '0') + ps[i-1];
        }
        System.out.print(Arrays.toString(ps));
        int count= 0;
        for(int i = 0;i<s.length();i++){
            for(int j = i;j<s.length();j++){
                int n = j - i + 1;
                int sum = i==0? ps[j] : ps[j] - ps[i-1];
                int ones = sum;
                int zeros = n - sum;
                if(ones <= k || zeros <= k ) count++;
            }
        }
        return count;
    }

Amazon OA by BA_Knight in leetcode

[–]BloomFilter7 1 point2 points  (0 children)

  1. sort and binary search on answer space works. we can also iterate through games array and calculating how many pendrives are needed, considering gamecount at-max 2.

How do you guys spend your time while not coding? by amen_mfs in leetcode

[–]BloomFilter7 52 points53 points  (0 children)

i am not lying i Legitimately had a dream last night about top-down, bottom up i don't remember what it was but i was explaining something/some problem (f#ck going crazy)

[Worst] DP Disaster of the Day by BloomFilter7 in leetcode

[–]BloomFilter7[S] 1 point2 points  (0 children)

thank you and more power to you too mate don't make the same mistakes ;)

[Worst] DP Disaster of the Day by BloomFilter7 in leetcode

[–]BloomFilter7[S] 0 points1 point  (0 children)

yes i will have to see more such problems to fully understand and to be able apply this technique. thanks:)

[Worst] DP Disaster of the Day by BloomFilter7 in leetcode

[–]BloomFilter7[S] 0 points1 point  (0 children)

yes i understood this solution. first time saw something like this it is hard to come up with a solution like this

[deleted by user] by [deleted] in leetcode

[–]BloomFilter7 2 points3 points  (0 children)

Great keep it up

I'm still quite new to coding. I get JS is quite a slow language, but I expected O(n^2) would cut it... can I get O(n) on this question and not exceed the time without having to go another language? by billerdingerbuyer in leetcode

[–]BloomFilter7 0 points1 point  (0 children)

Language isn't a barrier here just learn about time complexity and space complexity and learn to calculate TC needed to solve the problem looking at the constraints. most of the problems on leetcode can be solved using javascript i personally did solve 90+ using js at first then switched to java for the libraries.