r/LeetcodeChallenge • • Aug 21 '26

STREAKšŸ”„šŸ”„šŸ”„ 200 Days of LeetCode — 728 Problems Solved

Post image
297 Upvotes

200 Days of LeetCode — 728 Problems Solved

Finally hit my 200-day LeetCode badge!

Started this journey mainly to get better at DSA and prepare for software engineering interviews. Still a long way to go, but seeing the progress from where I started feels really motivating.

The goal now: keep the consistency going and reach 1,000 problems.

For those who are also grinding LeetCode what's your current problem count and longest streak?


r/LeetcodeChallenge • • 24d ago

PLACEMENTS Wtf

Post image
288 Upvotes

r/LeetcodeChallenge • • Jun 12 '26

STREAKšŸ”„šŸ”„šŸ”„ Want to know a cheat code?

Post image
283 Upvotes

The cheat code is: Never miss a day


r/LeetcodeChallenge • • Oct 12 '26

STREAKšŸ”„šŸ”„šŸ”„ I AM DONE THAT'S IT FOR ME

Post image
274 Upvotes

hey everyone this has been my leetcode journey so far this year. honestly its been a rough year for me. lost people lost hope went through things i never really talk about and somewhere along the way i started losing myself too. i kept showing up anyway. started solving problems in kotlin even though it was a new language for me and spent so much time on problems and contests thinking maybe this would finally help me get a job. but im still jobless and its frustrating when you put so much of yourself into something and still dont know where its going.

some mornings leetcode is literally the only reason i get out of bed and try to do something productive. its become part of my routine even when everything else feels like its falling apart. but lately even this feels exhausting and for the first time im genuinely thinking about giving up.

just wanted to share my journey with people who might understand has anyone else been through something like this?


r/LeetcodeChallenge • • Oct 07 '26

PLACEMENTS Guess the package ?

Post image
242 Upvotes

r/LeetcodeChallenge • • 20d ago

DISCUSS Cz why not?

Post image
236 Upvotes

r/LeetcodeChallenge • • 28d ago

STREAKšŸ”„šŸ”„šŸ”„ Finally reached 500!!

Post image
205 Upvotes

This really is a big thing for me because this is the first time in my life i have been consistent with something for this long. At first when started leetcode i thought i will not even complete 400 questions till i graduate and now i reached 500 and still in my third year ... 😭😭
can u guys tell me what i should ahead to improve my rating and increase my speed , i have completed striver sheet and currently doing neetcode all, any approach i should follow???
and i will be honest i am still not that good in solving hard and medium-hard problems...


r/LeetcodeChallenge • • Mar 05 '26

DISCUSS My Uber SDE-2 Interview Experience (Not Selected, but Worth Sharing)

194 Upvotes

I recently interviewed with Uber for aĀ Backend SDE-2 role. I didn’t make it through the entire process, but the experience itself was incredibly insightful — and honestly, a great reality check.

Since Uber is a dream company for many engineers, I wanted to write this post to help anyone preparing for similar roles. Hopefully, my experience saves you some surprises and helps you prepare better than I did.

Round 1: Screening (DSA)

The screening round focused purely onĀ data structures and algorithms.

I was asked aĀ graph problem, which turned out to be a variation ofĀ Number of Islands II. The trick was to dynamically add nodes and track connected components efficiently.

I optimized the solution usingĀ DSU (Disjoint Set Union / Union-Find).

If you’re curious, this is theĀ exact problem:

Key takeaway:
Uber expects not just a working solution, but anĀ optimized one. Knowing DSU, path compression, and union by rank really helped here.

Round 2:Ā Backend Problem Solving

This was hands down theĀ hardest roundĀ for me.

Problem Summary

You’re given:

  • A list ofĀ distinct words

  • A corresponding list ofĀ positive costs

You must construct aĀ Binary Search Tree (BST)Ā such that:

  • Inorder traversal gives words inĀ lexicographical order

  • TheĀ total costĀ of the tree is minimized

Cost Formula

If a word is placed at levelĀ L:

Contribution = (L + 1) Ɨ cost(word)

The goal is to minimize theĀ total weighted cost.

Example (Simplified)

Input

One Optimal Tree:

Words: ["apple", "banana", "cherry"]
Costs: [3, 2, 4]

banana (0)
       /       \
  apple (1)   cherry (1)

TotalCost:

  • banana → (1 Ɨ 2) = 2

  • apple → (2 Ɨ 3) = 6

  • cherry → (2 Ɨ 4) = 8Ā Total = 16

What This Problem Really Was

This wasn’t a simple BST question.

It was a classicĀ Optimal Binary Search Tree (OBST)Ā /Ā Dynamic ProgrammingĀ problem in disguise.

You needed to:

  • Realize thatĀ not all BSTs are equal

  • Use DP to decide which word should be the root to minimize weighted depth

  • Think in terms ofĀ subproblems over sorted ranges

Key takeaway:
Uber tests your ability to:

  • Identify known problem patterns

  • Translate problem statements into DP formulations

  • Reason about cost trade-offs, not just code

Round 3: API + Data Structure Design (Where I Slipped)

This round hurt the most — because IĀ knewĀ I could do better.

Problem

Given employees and managers, design APIs:

  1. get(employee) → return manager

  2. changeManager(employee, oldManager, newManager)

  3. addEmployee(manager, employee)

Constraint:
šŸ‘‰Ā At least 2 operations must run in O(1) time

What Went Wrong

Instead of focusing onĀ data structure choice, I:

  • Spent too much time writingĀ LLD-style code

  • Over-engineered classes and interfaces

  • Lost sight of theĀ time complexity requirement

The problem was really about:

  • HashMaps

  • Reverse mappings

  • Constant-time lookups

But under pressure, I optimized forĀ clean codeĀ instead ofĀ correct constraints.

Key takeaway:
In interviews,Ā clarity > beauty.
Solve the problem first. Refactor later (if time permits).

Round 4: High-Level Design (In-Memory Cache)

The final round was anĀ HLD problem:

Topics discussed:

  • Key-value storage

  • Eviction strategies (LRU, TTL)

  • Concurrency

  • Read/write optimization

  • Write Ahead Log

However, this round is also where I made aĀ conceptual mistakeĀ that I want to call out explicitly.

Despite the interviewer clearly mentioning that the cache was aĀ single-node, non-distributed system, I kept bringing the discussion back to theĀ CAP theorem — talking about consistency, availability, and partition tolerance.

In hindsight, this was unnecessary and slightly off-track.

CAP theorem becomes relevant when:

  • The system isĀ distributed

  • Network partitions are possible

  • Trade-offs between consistency and availability must be made

In aĀ single-machine, in-memory cache, partition tolerance is simply not a concern. The focus should have stayed on:

  • Data structures

  • Locking strategies

  • Read-write contention

  • Eviction mechanics

  • Memory efficiency

Resource:Ā PracHub

Final Thoughts

I didn’t get selected — but I don’t consider this a failure.

This interview:

  • Exposed gaps in myĀ DP depth

  • Taught me to prioritizeĀ constraints over code aesthetics

  • Reinforced how strong Uber’s backend bar really is

If you’re preparing for Uber:

  • PracticeĀ DSU, DP, and classic CS problems

  • Be ruthless aboutĀ time complexity

  • Don’t over-engineer in coding rounds

  • Think out loud and justify every decision

If this post helps even one person feel more prepared, it’s worth sharing.

Good luck


r/LeetcodeChallenge • • 16d ago

DISCUSS Hit 1000 problems and 1931 rating. Happy to answer any questions or clear doubts!

Post image
188 Upvotes

Just crossed the 1k mark and 1931 rating after a year of staying consistent and 50 contests attended so far. I'm currently in my 3rd year of college, mostly balancing daily practice alongside regular coursework and dev projects.

A lot of the rating climb came down to spending most of my time on Mediums and Hards(though not perfect yet at solving Hards) rather than padding Easy problems just to keep the streak alive. Regularly showing up for contests, upsolving Q3/Q4 afterward, and debugging my own logic before checking the editorial made the biggest difference. Hoping to push to Guardian soon.

If you're stuck in a rating plateau, struggling to solve, unsure how to approach specific topics or just trying to manage daily practice alongside college, drop your questions below and I'll help however I can. Trying to give back to the community who helped me reach upto this point.


r/LeetcodeChallenge • • Sep 28 '26

DISCUSS After 100+ interviews, finally landed an offer

183 Upvotes

I started interviewing a bit over a year ago by grinding leetcode and system design until midnight in the office.

Prep Resource

Got super close to offers at Meta and LinkedIn (was told my onsite loop were borderline and could have gone either way) but could not secure an offer.

Fast forward a couple months, and I got laid off in March. I was a bit relieved considering I was trying to job hop. I went all in on studying and interviewing.

Landed onsite loops with Nvidia, Pinterest, Broadcom, Microsoft, Google, Netflix, Anduril, Apple and a bunch of non big tech and startups.

I hit 500+ leetcode questions and gone through all of hello interview system design videos (premium) at this point.

I felt like I was acing most of the interviews, but always get passed up for someone internal or someone with more years of experience. Especially Nvidia… I aced every single interview they threw at me and was told feedback was very positive, but they ended up going with someone internal. Maybe it was because I was borderline between junior and senior with 5yoe.

It seemed like no matter how I performed in interviews, I could never secure an offer.

Finally, I was able to land an offer with a startup. They low balled me with ~150k + mystery equity. I planned to sign as it was the only offer I had.

Then Google came in. I got successfully team matched, and received a verbal offer from them. Because of the verbal offer, I decided to decline signing with the startup as the deadline was up. Google then backtracked requiring 2 more rounds. I get an insanely stupid question that required very niche topology formula to solve efficiently, and lost my offer.

At this point, I was defeated. Google GMFU and I lost my startup offer because of them. I was burnt out. I’ve gone through 50+ different companies (big tech and startups alike) with 100+ interviews at this point. Considered taking a career break and traveling for a couple of months.

I decided to do one last sprint, and mass applied. Landed onsites at DoorDash, Amazon, and LinkedIn. Before I even had time to wrap up my loops with Amazon and LinkedIn, DoorDash came back and told me they were proceeding with an offer.

It was a grind, but I finally did it. My TC went from ~190k -> 320k. Being laid off ended up being a net positive, despite the uncertainty at the time.

To any job searchers: the market is very rough, and the bar is way higher than it was 3+ years ago. I landed multiple offers back then, but struggled a lot during this job search despite being much more competent technically (both experience and interview wise). But staying consistent ended up paying off for me. Best of luck out there!

SDE interview questions

Disclosure: Sharing this story from community interview experience.


r/LeetcodeChallenge • • Aug 08 '26

STREAKšŸ”„šŸ”„šŸ”„ SOLVED MY FIRST MEDIUM LEVEL LEETCODE PROBLEM

Post image
176 Upvotes

Today I solved my medium level leetcode problem totally on my own without any help moreover it got accepted passing all the test cases on the first try.


r/LeetcodeChallenge • • Sep 24 '26

DISCUSS Thanks Leetcode šŸ™šŸ»

Post image
172 Upvotes

Thank you Leetcode for the HINT šŸ™šŸ»


r/LeetcodeChallenge • • Sep 13 '26

DISCUSS Never do these kinda things prndsss

165 Upvotes

The day i tried solving three sums in a day and i gave up on leetcode i learned graphs and tried solving the prblms andd i decided not to solve anything

Regards

Pain


r/LeetcodeChallenge • • 6d ago

DISCUSS 200 problems solved in 3 months as a first-year

Post image
155 Upvotes

Made my LeetCode account in July as a first-year IT undergrad. Just hit 200 solved.

Most of it is in Java and almost all my active days came in the last couple of months once I started doing at least one problem daily.

Here’s my topic breakdown after 200 solved:

  • Fundamental: Array (74), Linked List (34), String (28), Two Pointers (28)

  • Intermediate: Math (91), Bit Manipulation (32), Hash Table (23), Recursion (22)

  • Advanced: DP (14), Divide and Conquer (7), Backtracking (6)

I’m clearly heavy on math, arrays and Bit Manipulation and weak on trees, DFS and graphs in general. Planning to focus on those next, then go deeper on DP.

Does this order make sense, or should I tackle something else first?


r/LeetcodeChallenge • • May 28 '26

DISCUSS I mapped every Graph pattern that shows up in FAANG interviews (~90 problems, grouped by sub-pattern)

155 Upvotes

After getting wrecked by a graph question I absolutely should've recognized, I spent a few months organizing every graph problem I could find byĀ underlying patternĀ instead of by difficulty. Sharing the structure — worked through pattern by pattern, it's roughly a 2.5-month roadmap.

How to use it:Ā for each new pattern, read the solution for the first 1–2 problems to get the intuition, then solve the rest yourself. That's where the learning happens — in recognizing the pattern cold, not in reading.

If you have an upcoming interview grind on theseĀ LeetcodeĀ Problems andĀ PracHubĀ for recent interview questions asked by FAANG.

Side note: BFS vs DP identification trick

UF + Vanilla

  1. https://leetcode.com/problems/lexicographically-smallest-equivalent-string/description/Ā (soln)

  2. https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/description/Ā (soln)

  3. https://leetcode.com/problems/redundant-connection/description/Ā (soln)

  4. https://leetcode.com/problems/number-of-operations-to-make-network-connected/Ā (soln)

  5. https://leetcode.com/problems/making-a-large-island/Ā (soln)

  6. https://leetcode.com/problems/satisfiability-of-equality-equations/Ā (soln)

  7. https://leetcode.com/problems/minimize-malware-spread/Ā (soln)

  8. https://leetcode.com/problems/minimize-malware-spread-ii/description/Ā (soln)

  9. https://leetcode.com/problems/maximum-points-activated-with-one-addition/description/Ā (soln)

  10. https://leetcode.com/problems/properties-graph/description/Ā (soln)

UF + swaps

  1. https://leetcode.com/problems/smallest-string-with-swaps/description/Ā (soln)

  2. https://leetcode.com/problems/make-lexicographically-smallest-array-by-swapping-elements/Ā (soln)

  3. https://leetcode.com/problems/minimize-hamming-distance-after-swap-operations/description/Ā (soln)

UF + Select edges within a limit

  1. https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths/description/Ā (soln)

  2. https://leetcode.com/problems/maximum-number-of-points-from-grid-queries/description/Ā (soln)

  3. https://leetcode.com/problems/number-of-good-paths/description/Ā (soln)

UF + Factors of numbers

  1. https://leetcode.com/problems/gcd-sort-of-an-array/description/Ā (soln)

  2. https://leetcode.com/problems/graph-connectivity-with-threshold/Ā (soln)

  3. https://leetcode.com/problems/largest-component-size-by-common-factor/description/Ā (soln)

  4. https://leetcode.com/problems/greatest-common-divisor-traversal/description/Ā (soln)

UF + Binary search

  1. https://leetcode.com/problems/minimum-time-for-k-connected-components/description/Ā (soln)

  2. https://leetcode.com/problems/minimize-maximum-component-cost/description/Ā (soln)

  3. https://leetcode.com/problems/last-day-where-you-can-still-cross/description/Ā (soln)

UF + Modified MST

  1. https://leetcode.com/problems/min-cost-to-connect-all-points/description/Ā (soln)

  2. https://leetcode.com/problems/maximize-spanning-tree-stability-with-upgrades/description/Ā (soln)

weighted UF

  1. https://leetcode.com/problems/incremental-even-weighted-cycle-queries/description/Ā (soln)

BFS + Vanilla

  1. https://leetcode.com/problems/jump-game-iii/description/Ā (soln)

  2. https://leetcode.com/problems/get-watched-videos-by-your-friends/description/Ā (soln)

  3. https://leetcode.com/problems/shortest-path-in-binary-matrix/description/Ā (soln)

  4. https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location/description/Ā (soln)

  5. https://leetcode.com/problems/jump-game-iv/description/Ā (soln)

  6. https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/description/Ā (soln)

  7. https://leetcode.com/problems/snakes-and-ladders/description/Ā (soln)

BFS + Finite states

  1. https://leetcode.com/problems/open-the-lock/description/Ā (soln)

  2. https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/description/Ā (soln)

  3. https://leetcode.com/problems/minimum-genetic-mutation/description/Ā (soln)

  4. https://leetcode.com/problems/word-ladder/description/Ā (soln)

  5. https://leetcode.com/problems/sliding-puzzle/description/Ā (soln)

BFS + Multisource

  1. https://leetcode.com/problems/01-matrix/description/Ā (soln)

  2. https://leetcode.com/problems/map-of-highest-peak/description/Ā (soln)

  3. https://leetcode.com/problems/rotting-oranges/description/Ā (soln)

  4. https://leetcode.com/problems/as-far-from-land-as-possible/description/Ā (soln)

BFS + Dikstra

  1. https://leetcode.com/problems/path-with-minimum-effort/description/Ā (soln)

  2. https://leetcode.com/problems/swim-in-rising-water/description/Ā (soln)

  3. https://leetcode.com/problems/find-all-people-with-secret/description/Ā (soln)

  4. https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/description/Ā (soln)

  5. https://leetcode.com/problems/second-minimum-time-to-reach-destination/description/Ā (soln)

  6. https://leetcode.com/problems/shortest-distance-after-road-addition-queries-i/description/Ā (soln)

  7. https://leetcode.com/problems/network-delay-time/description/Ā (soln)

  8. https://leetcode.com/problems/minimum-time-to-visit-a-cell-in-a-grid/description/Ā (soln)

  9. https://leetcode.com/problems/find-edges-in-shortest-paths/description/Ā (soln)

BFS + Topological

  1. https://leetcode.com/problems/find-eventual-safe-states/description/Ā (soln)

  2. https://leetcode.com/problems/course-schedule-ii/description/Ā (soln)

  3. https://leetcode.com/problems/course-schedule/description/Ā (soln)

BFS + previous state

  1. https://leetcode.com/problems/shortest-path-with-alternating-colors/description/Ā (soln)

  2. https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/description/Ā (soln)

BFS + Bitmask

  1. https://leetcode.com/problems/shortest-path-visiting-all-nodes/description/

  2. https://leetcode.com/problems/shortest-path-to-get-all-keys/description/Ā (soln)

DFS + Vanilla

  1. https://leetcode.com/problems/count-the-number-of-complete-components/description/Ā (soln)

  2. https://leetcode.com/problems/keys-and-rooms/description/Ā (soln)

  3. https://leetcode.com/problems/max-area-of-island/description/Ā (soln)

  4. https://leetcode.com/problems/count-servers-that-communicate/description/Ā (soln)

  5. https://leetcode.com/problems/count-sub-islands/description/Ā (soln)

  6. https://leetcode.com/problems/maximum-number-of-fish-in-a-grid/description/Ā (soln)

  7. https://leetcode.com/problems/number-of-closed-islands/description/Ā (soln)

  8. https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/description/Ā (soln)

  9. https://leetcode.com/problems/reachable-nodes-with-restrictions/description/Ā (soln)

  10. https://leetcode.com/problems/number-of-islands/description/Ā (soln)

  11. https://leetcode.com/problems/count-islands-with-total-value-divisible-by-k/description/Ā (soln)

DFS + Boundry

  1. https://leetcode.com/problems/number-of-enclaves/description/Ā (soln)

  2. https://leetcode.com/problems/surrounded-regions/description/Ā (soln)

  3. https://leetcode.com/problems/pacific-atlantic-water-flow/description/Ā (soln)

DFS + island Perimeter

  1. https://leetcode.com/problems/island-perimeter/description/Ā (soln)

DFS / BFS + Cycle

  1. https://leetcode.com/problems/detect-cycles-in-2d-grid/description/Ā (soln)

  2. https://leetcode.com/problems/longest-cycle-in-a-graph/description/Ā (soln)

  3. https://leetcode.com/problems/shortest-cycle-in-a-graph/description/Ā (soln)

DFS + edge reversals

  1. https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/description/Ā (soln)

  2. https://leetcode.com/problems/minimum-edge-reversals-so-every-node-is-reachable/description/Ā (soln)

DFS / BFS + Binary Search

  1. https://leetcode.com/problems/find-the-safest-path-in-a-grid/description/Ā (soln)

  2. https://leetcode.com/problems/minimize-the-maximum-edge-weight-of-graph/description/Ā (soln)

  3. https://leetcode.com/problems/minimum-threshold-path-with-limited-heavy-edges/description/Ā (soln)

DFS + DP

  1. https://leetcode.com/problems/number-of-increasing-paths-in-a-grid/description/Ā (soln)

  2. https://leetcode.com/problems/longest-increasing-path-in-a-matrix/description/Ā (soln)

Bipartite

  1. https://leetcode.com/problems/is-graph-bipartite/description/Ā (soln)

  2. https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/description/Ā (soln)

  3. https://leetcode.com/problems/possible-bipartition/description/Ā (soln)

  4. https://leetcode.com/problems/incremental-even-weighted-cycle-queries/description/Ā (soln)

Full listĀ (all ~90 problems with clickable links + worked solutions for the first 1–2 of each pattern)


r/LeetcodeChallenge • • Sep 29 '26

PLACEMENTS How much dsa is enough for most companies?

Post image
150 Upvotes

So i am in 5th semester rn and this is my leetcode stats till now , i was kinda confused like whats the bar for dsa in companies that offer like 10-12 lpa salaries or overall good pbcs , also do you guys think i am behind or this is good for now imma stay consitent till i get job but whats the situation in market guys ?? any tips beside dsa for placement prep will also help me :)


r/LeetcodeChallenge • • Jul 11 '26

STREAKšŸ”„šŸ”„šŸ”„ Completed 100 questions on leetcode and i haven't even started my first year!!

Post image
146 Upvotes

r/LeetcodeChallenge • • Sep 13 '26

DISCUSS How I Cleared the Amazon SDE 2 Interview in Six Weeks

138 Upvotes

I recently completed the Amazon SDE II interview process and received an offer. Interview experiences from this community helped me a lot, so I wanted to share the full process, the questions I faced, and a few mistakes others can avoid.

Prep Resource: Amazon Interview Questions

Online Assessment

The OA contained:

  • An AI-assisted repository debugging task

  • One DSA problem

Unfortunately, I don't remember the exact DSA question.

Round 1: DSA + Leadership Principles

Duration: Approximately 55 minutes

The interview started with about 10 minutes of behavioral questions based on:

  • Learn and Be Curious

  • Ownership

The coding question started as a custom BFS problem. The interviewer progressively added constraints until it became a multi-source BFS problem. I was able to explain and implement the solution.

However, I knew there was one edge case my implementation did not cover. Since time was running out and the interviewer appeared satisfied, I chose not to mention it.

That was a mistake.

If you notice an uncovered edge case, say it explicitly, even if there is not enough time to implement the fix. Demonstrating awareness is better than hoping the interviewer does not notice it.

Recruiter feedback: Positive

Round 2: LLD + Leadership Principles

Duration: Approximately 60 minutes

The design problem was similar to Amazon Locker, but in reverse. A customer needed to reserve a slot at a nearby drop-off store and physically return a package there.

I first clarified the requirements and then began designing the entities, interfaces, booking flow, and store availability logic.

During the implementation, the interviewer asked:

I mentioned geosharding but could not take the discussion much deeper. The interviewer hinted that I should think about how ride-sharing platforms locate nearby drivers.

In hindsight, a stronger answer would have been:

  • Use a spatial index such as geohash, S2, or H3 to shortlist nearby stores.

  • Filter stores by availability, capacity, operating hours, and supported return types.

  • Rank the remaining stores using exact distance or estimated travel time.

  • Expand the search radius if no suitable store is found.

I spent roughly 35 minutes on the implementation and completed the main booking flow, but this follow-up was the weakest part of my interview loop.

The behavioral questions focused on:

  • Dive Deep

  • Invent and Simplify

Round 3: Bar Raiser

Duration: Approximately 55 minutes

The first 10 minutes covered:

  • Customer Obsession

  • Deliver Results

The coding problem resembled LeetCode 2812: Find the Safest Path in a Grid.

I had not solved it before. I started with a naive approach and optimized it twice while discussing the time and space complexity of each version.

My final solution used:

  1. Multi-source BFS to calculate the distance of every cell from the nearest unsafe cell.

  2. Binary search over the possible safeness value.

  3. DFS to check whether a valid path existed for a selected value.

The interviewer asked whether it could be optimized further. For the public LeetCode version, a max-heap best-first search is another clean approach, although the exact expected optimization depends on the custom constraints.

My biggest lesson from this round was time management. I spent too long refining the approach and had only around 12–15 minutes left to write and explain a fairly long implementation.

Round 4: System Design + Leadership Principles

Duration: Approximately 60 minutes

This round was conducted by the hiring manager. The behavioral questions focused on:

  • Earn Trust

  • Have Backbone; Disagree and Commit

The design problem involved synchronizing configurations across multiple devices.

I discussed the API design, data model, versioning, propagation flow, retries, idempotency, offline devices, conflict resolution, and consistency trade-offs. The interviewer continued adding failure scenarios, and I was able to work through each one.

This was the smoothest round of my interview loop.

Final Verdict

Selected

How I Prepared

DSA: I completed Striver's sheet and approximately 200 additional problems collected from LeetCode discussions and GitHub repositories.

LLD: I reviewed an LLD playlist and practiced approximately 26 design problems. I also used AI to simulate interviews, challenge my class design, and explore alternative approaches.

HLD: I completed the Hello Interview system design playlist and several Deep Dive videos. My system design interview was rescheduled multiple times, so I ended up revisiting the main playlist three times.

Leadership Principles: Do not treat LP preparation as secondary. Prepare a smaller collection of strong, reusable stories with clear actions, trade-offs, and measurable outcomes.

My preparation lasted around six weeks. I was serving my notice period, and my manager was supportive enough to help rebalance my Jira workload while I prepared.

Overall, the biggest lessons were:

  • Mention edge cases even when time is limited.

  • Clarify requirements before designing.

  • Start implementing once the approach is sufficiently clear.

  • Prepare Leadership Principle stories as seriously as DSA and system design.

  • Expect interviewers to move between LLD and HLD during the same discussion.

Hope this helps anyone preparing for Amazon SDE II. Happy to answer general preparation questions without sharing confidential interview details.


r/LeetcodeChallenge • • Aug 03 '26

STREAKšŸ”„šŸ”„šŸ”„ Finally hit 2 digits after nonstop july grind <3

Post image
138 Upvotes

Hey so I've posted when I hit 50 and like I promised I would update at every 50 intervals it's really exciting to hit such small milestones that accumulate fr now my next obstacle is how tf to solve under time pressure aka start giving contests šŸ˜”āœŒļø pretty sure mind will go blank in the beginning ones but practice makes better. A little about myself, my third semester will start after one week so my greedy ahh will probably do heaps and greedy as well before my new sem starts šŸ¤” I'm just following strivers a2z dsa sheet thoroughly. Will start codechef when I hit my target of 50% of the sheet properly. ;w; wish me luck and have a good day


r/LeetcodeChallenge • • Jul 28 '26

STREAKšŸ”„šŸ”„šŸ”„ From 0 to 250 this summer. What's the move now?

Post image
135 Upvotes

Started taking coding seriously this summer break and somehow ended up solving 250 problems in around 50 days. Got the 50-day badge today too, which felt nice. 😭

I'm still very much a beginner, but I'm finally starting to see patterns instead of treating every problem like a completely new one.

I've covered the basics of most major data structures, and now I'm on DP... which has been destroying me so far lol.

College is about to start, so my plan is to revise everything and finish NeetCode 150 instead of rushing into new topics.

For those who've been through this phase: did you keep solving daily during college, or are breaks because of exams/classes completely normal? Just don't want to lose momentum.


r/LeetcodeChallenge • • Aug 17 '26

STREAKšŸ”„šŸ”„šŸ”„ Just Completed 50 Questions in Leetcode šŸ¤—.

Post image
133 Upvotes

Don't judge me because of all easy questions. I started learning DSA Just the day I started Leetcode and Also I don't know python syntax rules yet, I'm learning while writing easy questions code. Once I learn major syntax rules I'll start medium and Hard.


r/LeetcodeChallenge • • Oct 15 '26

DISCUSS Finally reached Guardian!!

Post image
132 Upvotes

Last week's contest ratings are now updated. I got to 2143, and am officially a Guardian now. It took me ~ 1 year of consistent practice and upsolving contest questions to reach this.


r/LeetcodeChallenge • • Jul 21 '26

DISCUSS Amazon SDE Interview Experience - 3 rounds, rejected after final round

132 Upvotes

Sharing my Amazon interview experience in case it helps someone preparing for SDE roles.

I do not remember the exact OA DSA problem. The second OA question was more ā€œdevā€ based, where HackerRank gave access to a remote IDE. It had an AI sidebar available, somewhat like Cursor.

Round 1

DSA + LPs.

Questions asked:

  1. Find the distance between any two nodes in a binary tree.

    • Parent pointers were not given.

    • Input had onlyĀ root,Ā source, andĀ target.

  2. Design a stack that supports: All inĀ O(1)Ā time.

    • push

    • pop

    • getMiddle

    • getTop

I was able to solve the first question completely. For the second one, I got the core logic and data structure choice right, but did not finish the full implementation. I implementedĀ getMiddleĀ after deciding the basic DS approach.

LPs were also asked.

Round 2

LPs + coding/OOD.

Question:

Basic Calculator

After solving it, the interviewer asked me to extend the solution in an object-oriented manner.

One thing that stood out: the interviewer mentioned that my solution was too close to the original/standard solution.

Round 3

This was mostly behavioral + design discussion.

Started with ā€œtell me about yourselfā€ for around 5-7 minutes.

Then he probed quite hard on why I wanted to switch, since I had already made one switch and was now looking for a second.

After that, he asked about the best thing I had worked on in my previous org. This felt a bit close to NDA territory, but I explained it carefully without going into confidential details. He asked follow-up questions like why we used X instead of Y.

At the end, he asked only one design-extension question:

How would you include a new feature in this existing design?

I proposed two solutions. He then asked me to write down the pros and cons of both. I wrote and explained at least 3 pros and 3 cons for each.

Finally, he asked if I had any questions for him.

Result

Rejected.

Recruiter said feedback from Round 2 and Round 3 was negative, but did not share specifics despite me asking explicitly.

Extra prep notes

Apart from the questions I got, I also saw these Amazon-tagged questions while checking prep resources:

Both seem relevant for Amazon-style prep: one for classic DP/string fundamentals, and one for OOD/concurrency/design thinking.

Hope this helps someone preparing.


r/LeetcodeChallenge • • Sep 22 '26

STREAKšŸ”„šŸ”„šŸ”„ Completed 300 questions.

Post image
123 Upvotes

r/LeetcodeChallenge • • Aug 20 '26

STREAKšŸ”„šŸ”„šŸ”„ 2 Month progress . 70 questions down.

Post image
117 Upvotes

In 2nd year.

I have been solving for the last 2 months, I started on 19th Jun.

I'm solving things by reading about things on google or using AI Explanation.

I usually give 2-3 hours on a new topic brainstorming on my own and take hints from Ai after failing and in some cases I solve after getting hints and in some cases I couldn't, then I ask AI to explain the code and dry run it.

Ik it's a lengthy process , I feel i retain more this way.

Open to advice šŸ™šŸ»