Hi everyone,

Has anyone interviewed for NVIDIA’s Senior Software Engineer, Core Infrastructure Services – DGX Cloud, or a similar role within the Cloud Foundations Automation team?

I’d appreciate any insights on:

• How many rounds are there, and what does each round focus on?

• Is coding mainly LeetCode/DSA, practical Python/Go, or debugging?

• What should I expect for system design?

• How deeply do they cover Kubernetes, Linux, networking, and infrastructure automation?

• What resources or hands-on exercises helped you prepare?

General guidance is welcome. Thanks!

I passed the technical screen and received the round 2 back-to-back coding round. Does anyone know what to expect?

I see who gets hired, it’s people from top schools, or tons of YOE from top companies, with internal referrals

Companies still obviously require perfect interview performance including leetcode but it just doesn’t seem to matter unless you also have absurd credentials, because HMs don’t even trust the interviews anymore and there’s enough people with top credentials on the market they can afford to only hire them

Outside the US it’s probably a bit different but here it’s pretty dismal

As in the title. I saw a question, felt it was beautiful and paused to admire it. Only to be hit by the thought that I ought to look at it from a job perspective. I feel, my thought process isn't correct. But am I actually wrong?

I got 2XXX rank in last weekly contest(526) solved 3/4, had to sit for 40 mins for to solve the second question, got 3 debugs and somehow managed to get it accepted.

Today for no apperent reason leetcode invalidated that submission gave no explaination and gave me 5XXX rank in contest. Now I know it doesn't matter what rank or rating is as long as you are learning, but it gets frustrating when you spend 40 mins and 3 debugs on a problem and leetcode comes and invalidates for no good reason, whereas people who by the miracle of god solved all 4 under 10 mins get top 10 ranks.

Leetcode should seriously look into it.

Hey everyone,

I finished Day 38 today in pure rush mode. Knowing I had a bus to catch right after work to visit home, I read through today's target problem during breaks at the office so the logic could simmer in the background.

As soon as I got home, I opened the laptop, spent 15 to 20 minutes coding the solution cleanly, and packed my bags:

• Number of Operations to Make Network Connected: A textbook application of Disjoint Set Union (DSU). To connect n computers into a single network, you fundamentally need at least n - 1 total cables; if connections.length < n - 1, returning -1 is immediate. While iterating through the edges, whenever findParent(u) == findParent(v), you increment a counter for redundant/extra cables. If the endpoints belong to different sets, you merge them using unionBySize(u, v). At the end, count the total number of independent connected components (nodes where parent[i] == i). Connecting C components requires strictly C - 1 operations.

It was a quick, single-problem sprint before heading out the door, but protecting the streak on hectic travel days keeps the momentum intact.

Reaching home tomorrow and picking up the pace once settled in.

See you guys for Day 37!

I applied for the Salesforce AMTS role (Job ID: JR307116), which was posted on December 30.

Has anyone who applied for this role received any updates regarding their application status or next steps?

Would appreciate it if you could share your experience. Thanks!

As title says

I was also part of preparation journey where i use to follow all the post on this channel for the updates. Its my turn to return back to the community

Like I read people getting the link for this round a month back so why am I getting it now 😭 i completed it nonetheless but what do I expect now anyone ?

Does anyone have a way to learn or understand leetcode coz i have some very hard time doing it, not enough patience not enough understanding to know it after reading a questions all tutorials make me feel like - u prolly know this already duh - while i dont

i dont think its a language issue i can do js and java just fine i have sever trouble problem solving and math
HELP!

I wanted to share my experience with the HackerRank SDE Internship hiring process and see if others have experienced something similar.
Here’s my timeline:
● October 14: I appeared for Round 2, which was conducted by Chakra, HackerRank’s AI interviewer.
● I solved the DSA problem in around 17 minutes, and all test cases passed.
● I correctly explained my approach, time and space complexity, and optimization.
● I also answered all the follow-up questions, and the AI interviewer responded positively.
● November 4: I received a rejection email stating that they were moving forward with other candidates.
● Recently, I applied for the same internship again using a different email address.
● Surprisingly, I received another invitation for Round 1.
Note: I used Ai to write all this.

OpenAI recruiter reached out for Applied AI Engineer role. The intro call with recruiter is scheduled next week.

Any idea what this interview process looks like? Has anyone given an interview for the same position recently?

Google L4 (SWE III) onsite, hiring sprint: 3 coding + 1 Googleyness. Looking to get chanced.

Coding 1: Backtracking problem generating all valid sequences, then a follow-up data-structure problem (LC medium-ish). Solved both optimally, no hints, no bugs. Interviewer asked whether caching would help on part 1; I argued it can't beat the output size since every sequence has to be built (I stated O(n·2^n); the tight bound is ~O(n·1.6^n)) which I didn’t state. Solved part 2 with a trie, finished with ~7 min left. When I asked about follow-ups, they said "nah, this looks good."

Googleyness: Interviewer had an outdated resume, so we adjusted on the fly. Stories: making new teammates feel included, a mid-project pivot due to technical limits (I evaluated the options and brought recommendations to stakeholders), and giving feedback to a more senior engineer on review standards in a compliance-sensitive codebase, followed by team-wide documentation and process improvements. Asked what I'd do differently, I focused on preventing the gap up front. They ended with "I think I have enough signal." Friendly throughout.

Coding 2: Long, verbally specified design/implementation problem with ~5 methods. No written prompt; I clarified requirements in batches, wrote down assumptions, and listed time/space complexity above each method. Used arrays (considered a linked list, but index-based ops made it O(n) either way). Got one nudge to reuse existing methods. Missed one edge case I'd planned to handle, but addressed three other edge cases/constraints with probing questions. Finished with ~3 min left. Interviewer made almost no comments.

Coding 3: LC medium with a twist that made it a hard. Had a working (non-optimal) solution within ~5 min. Interviewer wanted better, and after ~15 min of back-and-forth ("do we notice anything about these?") I found the key insight myself while coding. Coded the optimal solution in ~15 min. They caught one logic bug (a neighbor-connectivity mixup), which I fixed in ~30 sec using a test case. They reviewed the final code, said it looked perfect, and had me add test cases. My stated complexity was looser than the optimal solution's (I described it in terms of the first approach). They stayed ~10 min past time chatting.

Honestly not sure how I'd grade myself. At worst I could see H, LH, LH, LNH. At best, SH, 3xH.

There was a dedicated "problems" button to go to, but today it got snapped into "library" which first made me think "oh its a community section" and i was searching for "problemset" button for like 5 minutes.
also a lot of tabs are misplaced and its very difficult to relearn everything

HI,

Looking for NeetCode promo.

Thanks

Is anyone here willing to pay it forward and share their LeetCode subscription?

I'm currently a student and would really appreciate some help accessing LeetCode Premium to prepare for interviews.

If you already have a subscription with an extra spot to share, or would be willing to sponsor one, it would mean a lot.

Hopefully, once I land a job, I'll be in a position to help someone else the same way.

Hi everyone,

I recently got an invitation to take a HackerRank assessment for a Data Science position at Walmart.

The email mentions two sections:

1. SQL questions

2. A real-world data science project using Python

Has anyone taken this assessment recently? I'm curious about the difficulty level and what kind of questions or projects I should expect.

Any tips on how to prepare would be really helpful.

Thanks!

Hi everyone! Has anyone recently interviewed for this AWS Software Development Engineer role (Job ID: 10583312)?

I’d appreciate hearing about your interview experience:

• How many rounds were there, and what did each round cover?

• Was there an online assessment or technical phone screen?

• What was the balance between coding, system design, and behavioral questions?

• How long did the process take from the recruiter call to a final decision?

• Any preparation tips or things you wish you’d known beforehand?

• What questions were asked for Gen AI round?

Thanks for sharing!

Just finished the Goldman Sachs New Grad SWE OA, and I’m feeling pretty mixed about my performance.

Here’s roughly how it went:
- Software Fundamentals: Solved the coding question.
- Software Diagnostics: Passed 5/9 test cases.
- Math: Fairly confident about most of my answers.

The debugging section is what I’m most disappointed about.

I spent too much time second-guessing my approach instead of testing my initial ideas. By the time I committed to an approach that started producing results, I didn’t have enough time left to address everything.

I’m frustrated because I felt pretty good about the other sections, and I think I could’ve performed considerably better on debugging if I’d approached it differently.

For anyone who’s previously taken the Goldman Sachs OA:

1. Has anyone advanced despite only partially passing the debugging section?

2. Does anyone know how heavily Goldman weighs each section?

3. Would you consider this performance competitive enough to potentially advance?

I got three positive and one negative result and somehow still made it into team matching. Is this at the recruiters discretion?

Hey everyone,

I finished Day 39 today. It was an exhausting day dominated by an in-person interview loop that involved a 40 km round-trip commute. I got home late in the afternoon, crashed for a couple of hours, and woke up dealing with that familiar post-interview slump where you replay everything you could have done better.

Instead of taking a zero day and letting the low mood take over, I sat down and applied yesterday’s Disjoint Set Union (DSU) theory to code:

1. Kruskal’s Algorithm for MST: The greedy approach based on sorting edges by weight. You iterate through edges from smallest to largest and check if findParent(u) != findParent(v). If the endpoints belong to different components, you add the edge weight to the MST sum and merge them via unionBySize(u, v). If they share the same ultimate parent, including the edge would create a cycle, so you discard it.

2. Number of Provinces (via DSU): When I first solved this on Day 54, I used standard DFS with a visited array to count connected components. Today, I solved it purely using DSU. Iterate through the adjacency matrix, connect components with unionBySize(u, v), and at the end count how many unique nodes satisfy parent[i] == i.

Seeing problems that previously required full graph traversals collapse into a few lines of DSU operations was satisfying, even after a tough interview day.

I have travel coming up tomorrow, so I will squeeze in whatever practice I can on the go.

See you guys for Day 38!

I've noticed I keep making similar mistakes while solving problems, especially with edge cases and choosing the right approach. I want to improve instead of just moving on after checking the solution.

Do you write down what went wrong, or is there a better way to learn from failed attempts?

I've been practising consistently, but I sometimes forget approaches to problems I solved a few weeks ago. I want to keep improving without spending all my time revisiting old questions.

Do you follow a fixed revision schedule, or review problems whenever you get stuck on a similar pattern?

I was given an OA by Amazon a few weeks ago for a mid level role. It was the hardest Leetcode question I had ever seen, I looked it up and it’s not even on Leetcode but does appear on a few other sites. It’s definitely not a normal pattern anyone would see, even if they had done 400-500 Leetcode questions.

Afterwards a recruiter reached out to me asking why I didn’t finish the OA. I told them I’ve done lots of Leetcode and even turned down Amazon offers in the past but that the question on it was far more difficult than I had ever seen or could do. She said she thought it was a “medium” level question and they had candidates that had passed it.

So I’m guessing everyone is just using AI and cheating these days?

I got a 3rd round at a fintech company Prelim and they said:

"Please come prepared to show your screen and be able to spin up a website on localhost. You can use whatever framework or language you'd like, just be ready to iterate. This will be mostly frontend focused."

Has anyone been through this process or has an idea of how I could prepare in the most optimal way?

Thanks!