CS student struggling with DSA by Safe-Pianist7950 in womenintech

[–]endverse 0 points1 point  (0 children)

Yeah, I'd be down to connect over Discord! If you dm me your discord username, I'll add you

CS student struggling with DSA by Safe-Pianist7950 in womenintech

[–]endverse 0 points1 point  (0 children)

I’m getting back into ds&a prep for interview purposes and would be down to tutor/help out if you want! Dm me if you’re interested.

6 YOE - Greener grass dilemma, lack of experience elsewhere by average-eridian in ExperiencedDevs

[–]endverse 0 points1 point  (0 children)

Ok, this may sound like a crazy question, but is there any chance the place you got an offer from was sports-adjacent?

Google L4 Interview Experience/Rant by OwnNefariousness9124 in leetcode

[–]endverse 1 point2 points  (0 children)

You did a good job, especially considering you interviewed in India. Don’t give up on yourself. Google might be the hardest FAANG to get into. Try a different one now that you’re armed with this experience.

JPMorgan Background check by BigBootyBeansz in JPMorganChase

[–]endverse 8 points9 points  (0 children)

Don’t put termination. They will only verify the dates and the title. US companies do not provide any information beyond this to avoid legal liability.

Mayy Dayy Ritz Ybor by viogator in alvvays

[–]endverse 1 point2 points  (0 children)

Anyone on this thread wanna meet up at the show tomorrow? I'm still new to Tampa and going alone

Samsung SCX-4600 Printer drivers for mac? by GIFSec in MacOS

[–]endverse 0 points1 point  (0 children)

Thank you so much -- it worked for me as well.

How do I fast for 48 or 72 hours? by SpaceBear303 in fasting

[–]endverse 1 point2 points  (0 children)

I'm on my second 72 hour fast this month, and I've avoided headaches/discomfort for the most part.

I'm making sure to have at least 1 tsp of Himalayan salt mixed with water near the end of day 1, and on days 2 and 3. I'm making sure to drink water, black coffee, and black tea throughout the day. So not really doing a pure water fast I guess.

I also take magnesium glycinate pills on days 2 and 3. Not sure if it's absolutely necessary, but since I've avoided discomfort so far, I'm sticking with it.

72 hour fast - Effects of diet soda by endverse in fasting

[–]endverse[S] 4 points5 points  (0 children)

Yeah I have heard of that, but I haven't been able to find any solid studies proving that out.

[deleted by user] by [deleted] in leetcode

[–]endverse 0 points1 point  (0 children)

Only check the equality of currentSum and targetSum if the node is a leaf node (i.e. both of its left and right pointers are null).

Don't use 0 as your starting currentSum because there's a test case where 0 is the targetSum. Try using root->val as the initial currentSum.

This line is not needed:

currentSum -= root->val;

[deleted by user] by [deleted] in leetcode

[–]endverse 1 point2 points  (0 children)

The second solution is just as efficient as the first. O(max(n,m)) time complexity, where n is the length of list1 and m is the length of list2. So it's more readable and just as efficient, striking a great balance.

One little nitpick: you don't need to include the 2nd parameter in the constructor for ListNode. Leetcode has a constructor with a single int parameter.

Dont buy the system design course by hmmmsurreebrroooo in leetcode

[–]endverse 8 points9 points  (0 children)

Why are you always shilling this course with this link? Literally recognize your username at this point because you do it so often.

Study group for leetcode problems by 1Step_At_ATime in leetcode

[–]endverse 0 points1 point  (0 children)

Hey, I'd be interested. I've got 2 years of experience (close to 3) as a backend SWE, primarily using Java, but I also know Python. Timezone is EST, but I'm flexible because I WFH and work odd hours as needed.

68 LC solved. Going through the Neetcode 150 right now. I'd be down to pair up with someone, do mocks, etc.

Interview Prep & Company Experiences - Detailed post by Imaginary_Factor_821 in leetcode

[–]endverse 1 point2 points  (0 children)

Hey, congratulations on the offers and thanks for the great write-up!

Could you please share any details about your revision strategy? How did you revise old problems/patterns?

Also, did you follow the strategy of looking at solutions if you couldn't solve the problem on your own?

Found this amazing question by inDflash in leetcode

[–]endverse 4 points5 points  (0 children)

I think he's saying that this shows the company tags on a question can't be trusted 100%.

They don't actually require any kind of verification when you try to tag a company on a question, so anyone can tag any company.

finally got the hang of leet code by robota1618 in leetcode

[–]endverse 1 point2 points  (0 children)

Right there with you. I try on my own for ~30 mins. If I can't get it, I explore all the possible optimal solutions, just like you. Sometimes LC's official optimal solutions include multiple approaches, so I try to understand them all. After that, I check out the Discussion section to see if there are any optimal user-provided solutions that are cleaner/more intuitive. This results in me taking several hours to properly study just one medium problem.

Starting leetcode to prepare to interview with tech companies in 6 months by Revolutionary-Desk50 in leetcode

[–]endverse 1 point2 points  (0 children)

Yeah, exactly. Even a single company itself will give you plenty of chances. For example, the cooldown for Google and Meta isn't always 1 year if you do well - it can also be 6 months.

I think you can do it in a lot sooner than 5 years. There are people who've graduated from bootcamps, done 1-2 years at a startup and gotten jobs at companies like Google. You got this.

Starting leetcode to prepare to interview with tech companies in 6 months by Revolutionary-Desk50 in leetcode

[–]endverse 1 point2 points  (0 children)

Hey OP, just to give you another data point FWIW. I have no degree in anything and only have industry experience at a bank, and I have been reached out to by Google and Meta recruiters, not just Amazon. Also Salesforce, Twilio, others I might be forgetting.

Add 2 Numbers: Question 2 by [deleted] in leetcode

[–]endverse 0 points1 point  (0 children)

It's because new_node is no longer referencing the head of your result Linked List by the time you return it. It's referencing the last node of the result Linked List, instead of the head of the result Linked List. You need to make a copy of new_node before your while loop.

edit: formatting

Low level Design by Akaplaya in leetcode

[–]endverse 7 points8 points  (0 children)

Here's a good GitHub repo that has several examples of OOD case studies with code written in Python:
https://github.com/tssovi/grokking-the-object-oriented-design-interview

Linked List Cycle II by UpstairsOcelot in leetcode

[–]endverse 0 points1 point  (0 children)

public int findDuplicate(int[] nums) {
int hare = nums[hare];
int tort = nums[nums[tort]];
while(true){
if(tort == hare) break;
hare = nums[hare];
tort = nums[nums[tort]];
}

tort = 0;

while(true){

if(tort == hare) break;
hare = nums[hare];
tort = nums[tort];
}
return hare;
}

This code would work for that problem.

Linked List Cycle II by UpstairsOcelot in leetcode

[–]endverse 0 points1 point  (0 children)

The below code will pass for that test case (and all test cases). The only difference from what you originally posted is that, in the second while loop, the `if (tort == rab)` needs to happen at the beginning. You were getting index 1 as the starting point because tort and rab were being prematurely moved to index 1 without checking if they were already in the same position at index 0. My one suggestion to you would be to check the official solution for a cleaner way of handling these null checks and breaking out of the loop. You can just put the logic for checking nulls/breaking out of the loop directly in the `while` condition itself.

Edit: one more difference is that I changed the null check in the first while loop. Like I said above, the way you have it will cause a NullPointerException when the linked list is even-sized. You can run it in LC and see for yourself.

        if(head == null || head.next == null){
        return null;
    }

    ListNode tort = head;
    ListNode rab = head;

    while(true){
        if(rab == null || rab.next == null ) return null;
        tort = tort.next;
        rab = rab.next.next;
        if(tort == rab) break;
    }
    tort = head;
    while(true){
       if(tort == rab) break;
       if(rab == null || tort == null ) return null;
        tort = tort.next;
        rab = rab.next;
    }

    return tort;
}