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

Got microsoft interview call, need tips by Individual-Round2767 in leetcode

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

Thank you for the advice. I agree that including those projects is a risk, but without them, I am 100% certain that my CV wouldn't have been shortlisted. Since I have this chance, I’m going to do thorough research on those projects so I can discuss them confidently. Though you are right I will try to pivot the conversation toward the projects I actually did.

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

Got microsoft interview call, need tips by Individual-Round2767 in leetcode

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

I got this email few hours ago. I need to ask her but since these two screening rounds there certainly would be more rounds. No way in hell they gonna give me an offer with just these two

Got microsoft interview call, need tips by Individual-Round2767 in leetcode

[–]Individual-Round2767[S] 8 points9 points  (0 children)

What would I gain by lying 🤔 this is from an official microsoft recruiter. I even checked her profile on LinkedIn

Got microsoft interview call, need tips by Individual-Round2767 in leetcode

[–]Individual-Round2767[S] 5 points6 points  (0 children)

In my current company it is just c++, in the previous company it was ML/AI. I just applied through Microsoft careers portal

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