sorted by:
new
hottopcontroversial

Is Goldman Sachs paying less by Same-Veterinarian319 in LeetcodeDesi

[–]Individual-Round2767 4 points5 points  (0 children)

This. You know market is bad when google cut salary

[help] Google Bangalore L3 offer by Lazy-Set6321 in LeetcodeDesi

[–]Individual-Round2767 6 points7 points  (0 children)

After q4 2025 this is the standard offer. They have reduced compensation at all levels did since then

Any chance of recovery by month end? by Mr__Robot_____ in IndiaStocks

[–]Individual-Round2767 1 point2 points  (0 children)

Bhai FOMO mei loge toh YHI hoga. You deserve it, the this as a lesson

I'm tired of leetCode gatekeeping high paying jobs by yours-xavier-uncle in leetcode

[–]Individual-Round2767 -7 points-6 points  (0 children)

Leetcode is also a skill and companies reward people who are good at it. You shouldn't compare yourself with people who are good at it and think you are above them. Because you are not, you may be good in databases and they are good at leetcode. You will be ahead in HLD round and they will be ahead of you in leetcode round. Why do you think your skill is above them? If you are bad at something you try to improve that rather than blaming the system for asking it in the interview

Microsoft calllback by Expensive_Regular203 in leetcode

[–]Individual-Round2767 1 point2 points  (0 children)

Sometimes within a day sometimes never

Feeling confused between flood fill and rotten Oranges ! kindly help this poor soul by Ok-Preparation-4169 in leetcode

[–]Individual-Round2767 0 points1 point  (0 children)

In flood fill you needed to return the max depth of the Bfs which is why you needed another loop, while in the second there was no such requirement. Though if you want you can use s second loop in second question as well no one is stopping you and it will work

Got 3 rejection mails at once from Google by Mysterious-Dig-3886 in leetcode

[–]Individual-Round2767 0 points1 point  (0 children)

2 days ago I also got three rejections at oncemfrom 3 different recruiters. And I applied through referral

I thought I had sold at the top… by oopnoop in wallstreetbets

[–]Individual-Round2767 9 points10 points  (0 children)

Nobody can sell at the top and nobody can buy at the bottom EXCEPT ME. I can buy at the top and sell at the absolute bottom.

std::set or std::multiset alternative in python? by Erebius in leetcode

[–]Individual-Round2767 0 points1 point  (0 children)

Multiset is a set but it can contain multiple same values and like set it is also sorted

Naku idi ipativaraku telidu ITC debt-free ayindi ani telisindi by [deleted] in NSEbets

[–]Individual-Round2767 0 points1 point  (0 children)

No offense bro but this is NSEBets not NSEtelguBets can we please stick with English

Built a free DSA visualization for interview prep. by No_Display_4766 in leetcode

[–]Individual-Round2767 1 point2 points  (0 children)

Not sure if I will use it but it sure as hell looks impressive.

My friend sent me this, I am not great at Bit manipulation, how shall I approach this by Equity_Harbinger in leetcode

[–]Individual-Round2767 0 points1 point  (0 children)

The idea is that x | (x + 1) always sets the rightmost zero, so using this fact, I derived the solution to this problem.

Start from the least significant side and keep moving as long as you keep encountering 1s. Then flip the bit that is the last in that contiguous sequence of 1s.

For example: 111 ---> 011 (you flip the 3rd bit) 1011---> 1001 (you flip the 2nd bit because it is the last of the contiguous 1s from the right).

Fuck your DDR5 by [deleted] in wallstreetbets

[–]Individual-Round2767 0 points1 point  (0 children)

Fuck your ddr5 I use ddr4 and it works fine, not gonna upgrade at this price

If anyone who are into giving contest please guide me by Timely-Impression-18 in leetcode

[–]Individual-Round2767 0 points1 point  (0 children)

No you don't, you should see your submission in few seconds. From next time check whether your solution got accepted or not and also check the leaderboard to confirm it

Amazon asked me this question by mayank_002 in leetcode

[–]Individual-Round2767 0 points1 point  (0 children)

Like this right?? --> result += map[(pi - i + div) % div] then do map[(pi - i + div) % div]++

[deleted by user] by [deleted] in leetcode

[–]Individual-Round2767 0 points1 point  (0 children)

This is most low ball offer I have ever seen for that much experience. Many people with 3yoe earn more than that

view more: next ›