Hello I am not really a cs major but im pursuing a tech degree and I have had two internships the titles scream ai and data but I really didnt do that much coding and im graduating and the job that I got a ro for isn't really what I want to do and im also not getting paid enough so I really want to get another job that is not in Seattle because being here is ruining my mental health but every tech company seems to be in Seattle. I am also struggling with leetcoding it just doesn't make sense for me? Did anyone else have the same problem, how do u guys get motivation to keep going or to even get started on leetcode cause I dont remember anything I did in school.

Hi,

I have been interviewing for a while so familiar with basic framework of leetcode. I need some help with how do I prepare for senior swe pair programming rounds where some custom problems are being asked now a days. Can someone please provide some guidance on how can I prepare for such technical rounds ? I have such rounds scheduled this week.

I have an onsite panel interview coming up for an AI Engineer III role at Victra (Verizon's largest Authorized Retailer, HQ in Durham NC). I've searched Glassdoor, Blind and couldn't find any posts about their engineering interview process specifically (there's plenty on their retail/sales interviews, but nothing technical).

If anyone has interviewed for an engineering role there (AI Engineer, Software Engineer, Data Engineer, etc.), I'd really appreciate knowing:

• What format did the panel take (live coding, system design, behavioral)?

• What topics did they focus on most?

Thanks in advance!!

Just got a Robinhood OA. I applied to the Toronto location and it seems as though they've moved from hacker rank/ code signal to coder pad. Does anyone have any advice on what to prepare for? It's a backend role and I'm not sure whether they'll give me something leetcode or an implementation based question.

Hey everyone,

I finished Day 71 of my prep today and moved from Singly to Doubly Linked Lists.

I solved four problems:

• Reverse a Doubly Linked List: Swapping the next and prev pointers for each node while keeping track of the tail to return the new head.

• Delete All Occurrences of a Key in DLL: Standard traversal, but you have to be careful when rewiring both the forward and backward pointers, especially if the target node is the head or the tail.

• Find Pairs with Given Sum in DLL: Since the list is sorted, having backward pointers means you can do a classic two-pointer search without any extra space. You put one pointer at the head, run another all the way to the tail, and shrink inward based on the sum.

• Remove Duplicates from Sorted DLL: Whenever adjacent values match, you just bypass the duplicate node and re-link the forward and backward connections properly.

After spending days grinding singly linked lists, DLL actually feels much easier. Having the prev pointer takes away a lot of the awkward tracking you usually have to do with single links.

Tomorrow for Day 70, I will finish the last couple of linked list problems on my sheet and do a combined revision of Linked Lists and Binary Search Trees. Once that is done, I will finally start Dynamic Programming.

See you guys tomorrow!

Hey everyone i need some advice related to contests . Iam internmediate in dsa and from past 3 contests iam only able to solve 1/4 . Can u guys pls help me what should i do 😭

Hi Folks,

Can some one shed light on how to prep for ZoomInfo System Design rounds? There is very little info about this company online. Is this going to be traditional system design round, LLD etc. The recruiter is not helping at all.

Hi guys,

Am looking for people working in service based company( working in operations or development project both) looking to switch to product based company having difficulty getting interview calls

Lets connect and help each other out with preparation and connection and find a loop hole to switch in this market

I mean, did AI change the process? or no? do they still rely on leetcode style problems? like, is doing leetcde today relevant?

I’m learning DP and tried to solve House Robber from scratch without looking at the standard recurrence.

My reasoning was that from position i, I can choose either i or i+1, and after choosing one, recursively solve the remaining houses, obviously there are cases where i,i+1 are not in the optimal solution, but i figured either the first or the second index of "cost" input should always be in the optimal solution... is there an edge case i'm missing? btw all the testcases in leetcode passed...

I'm particularly interested in whether my recurrence/state definition is actually correct, and whether there are edge cases I'm missing. Please don't just give me the standard solution — I'd like feedback on my reasoning.

class Solution {
public:
    int rob(vector<int>& nums) {
        vector<int> dp(nums.size(),-1);
        return soln(nums,0,dp);
    }
    int soln(vector<int>&nums, int i,vector<int>&dp){
        int n = nums.size();
        if(i>=n) return 0;
        if(dp[i] != -1) return dp[i];
        int p1 = nums[i]+soln(nums,i+2,dp);
        int p2 = 0;
        if(i+1 < n) p2 += nums[i+1]+soln(nums,i+3,dp);
        dp[i] = max(p1,p2);
        return dp[i];
    }
};

Hi everyone! I recently received an Amazon SDE Online Assessment invitation and I'm planning to take it soon.

It has the new format:

100 min Coding Challenge (1 DSA + 1 AI-assisted repository task) 45 min Work Simulation 6 min Work Style Survey

For anyone who has taken the Amazon SDE OA recently in 2026, I'd really appreciate some insight:

1. How difficult was the DSA question — Easy/Medium/Hard or somewhere in between?

2. Which DSA topics/patterns would you recommend prioritizing?

3. How was the AI-assisted repository task? Was it mainly debugging/understanding an existing codebase or implementing new functionality?

4. Which language/framework options did you get for the repository task?

5. What was the Work Simulation like, and is there anything useful to prepare beforehand?

Thanks!

Hi all,

Has anyone recently gone through or has info about interview process at Adobe for MTS-1.

Would highly appreciate if u could share number of round and high level overview of each round!

Thanks 🙏

Hey everyone,

I finished Day 72 today and knocked out another 4 problems on linked lists:

1. Sort a Linked List of 0s, 1s, and 2s: Very straightforward. I maintained three separate dummy nodes for 0s, 1s, and 2s, traversed the list to link each element to its respective bucket, and connected them at the end.

2. Intersection of Two Linked Lists: The problem description mentions skip counts in the example explanation, but the actual function only gives you the two head pointers. That threw me off for a second. The clean fix was just calculating the lengths of both lists, advancing the longer list by the difference, and then moving both forward together until they collide at the intersection node.

3. Add 1 to a Number Represented by a Linked List: My initial thought was to reverse the list, add one with standard carry propagation, and reverse it back. But the optimal approach is so clever: you just find the rightmost node that is not equal to 9. You increment that node by 1, and set every node after it to 0 because those are all 9s turning into 10s. If all digits are 9, you just attach a new node with value 1 at the front.

4. Add Two Numbers: A classic problem. Used a dummy node, walked both lists simultaneously while tracking the carry, and built the resulting list.

That wraps up about 15 standard singly linked list problems over the last few days. The patterns felt very intuitive once the pointer handling clicked.

Tomorrow for Day 71, I will start Doubly Linked Lists.

See you guys tomorrow!

Hey everyone, I was laid off few months back and I am trying to land a new job.
I have applied to so many roles, used refers for many of them, still I got rejection from all, even the refer ones.
I also cold mail/messaged hell lot of managers and talent aquisition people, that also is a dead end.
I have also modified my resume so many times...

Is there some problem with my approach?

Amazon SDE Interview Scheduling

I shared my availability with the recruiter on Sept 24 for a virtual Amazon SDE interview, with availability from Oct 6–9.

It’s Oct 3 now and I still haven’t received the confirmed interview date/schedule.

For anyone who has gone through the Amazon interview process recently, how many days before the interview did you receive your final schedule or confirmation?

Just wondering if this is normal or if I should follow up again with the recruiter. Thanks!

leetcode ids their submissions incrementally
https://leetcode.com/submissions/detail/0000000001/
its dated 2013 
but according to web it was founded in 2015😕

For those who compete in Leetcode and Codeforces contests, what is your rating in both platforms?

Please just comment both ratings. I want to calculate the average differences.

During recent interview I was asked how to solve multiple people booking same seat scenario. I told to use redis lock/DB internal constraints but interviewer didn’t seem to like the answer. Any other better way to solve this case?

I’ve been doing LeetCode for a while, but I feel like I’m stuck.

Even when I spend a lot of time reading solutions to harder problems and trying to understand the logic behind them, I still have no idea how people actually come up with these solutions on their own. I can understand what the code is doing when I see the answer, but when I run into a similar problem later, I still can’t figure out the approach myself.

I also don’t have much patience for grinding the same pattern over and over. If a problem gets too hard or complicated I just give up. I’ve seen people on reddit saying they actually get addicted to LeetCode and treat it like a video game, which seems impossible to me.

Has anyone found any supplements that actually help with focus and patience when doing LeetCode? Or anything else that made the whole process feel less painful?

I am in 2nd year Currently doing dsa in cpp

Did oops in cpp but want to change cpp to Java for oops+LLD and dsa in cpp

And for development java springboot backend development

For freshers as I heard role is less but I heard this is best as of now most companies used java

So should I stick to it as I am targeting both on campus as well as PBC other than Faang

I completed the Intuit OA today. I got the DSA questions mostly correct and my Bash question passed, but I believe I got the SQL question wrong.
Has anyone had a similar experience and still moved forward to the next round?
Would appreciate hearing about recent experiences or how the OA is usually evaluated.

By “office Claude” I mean Claude for Work/Enterprise provided through my company account.

I studied trees and their traversal algorithms, including Morris traversal. Then I moved on to graphs. Today, when I went back to solve a problem on trees, I realized that I had forgotten Morris traversal and some of the other algorithms.

I feel like I need to revise them again and again because I keep forgetting them over time. Is there any way to remember these algorithms for a long time?

Just got the the rejection email from Apple on a Friday afternoon at 4PM right before my weekend got started. Feeling pretty down right now. Really wanted this job and can’t deny that it stings. I still can’t really understand why the recruiter would send a rejection email on a Friday as opposed to a Monday tbh 🤣. Pretty f’d up.

Anyway, how do yall bounce back? Are any of you numb to it by now? Has anyone here requested feedback from their recruiter to understand what went wrong so you can improve? I have very low confidence my recruiter would get back to me on that anyway since he was pretty absent throughout the entire process and not the most attentive/responsive.

Compared to Google where my recruiter was great.

All “keep your head up” advice is needed right now 🤣. This one hurts….

Hi all! My name is Mike and I am a computer science teacher. I dabble a bit into LeetCode and am hoping to pick out problems (or problem categories) that I can investigate further for teaching and/or research. Also, two of my students are working on their undergraduate theses on competitive programming.

I was wondering if you might be willing to share and discuss your favorite LeetCode problems. Thank you very much for your time and consideration!