DSA prep for a full-stack role

Learn these first

Core topics for a full-stack loop — everything else waits until these hold.

• 1ArraysWalk through it →
• 2StringsWalk through it →
• 3Two PointersWalk through it →
• 4Sliding WindowWalk through it →
• 5StackWalk through it →
• 6QueueWalk through it →
• 7SortingWalk through it →

Then these

• Hash Map
• Linked List
• Binary Trees
• Binary Search
• Recursion
• Graph
• Dynamic Programming

Problems to start with

Named problems from this role's core topics, easiest first. Each page shows which roles treat it as core, which sheets carry it, and the companies that have asked it.

• Two Sum · Easy
• Maximum and Minimum Element in an Array · Easy
• Reverse the Array · Easy
• Contains Duplicate · Easy
• Chocolate Distribution Problem · Easy
• Best Time to Buy and Sell Stock · Easy
• Merge Sorted Arrays · Easy
• Pascal's Triangle · Easy
• Majority Element · Easy
• Sort an Array of 0s 1s and 2s · Easy
• Leaders in an Array · Easy
• Check if Array is Sorted and Rotated · Easy

What this ordering pushes down

Graphs, dynamic programming, backtracking, heaps, bit manipulation, tries, greedy and math sit below the core tier for full-stack loops. The trade-off in this role is breadth over depth: the ordering spreads thirteen topics across the core and medium tiers rather than going deep on a few, so the lower tier really is reached last rather than skipped, once you can move confidently across the other thirteen.

Why an order beats a list

Every popular sheet hands all 370 problems to everyone in the same fixed sequence. A full-stack interview does not weight them the same way a backend interview does — so a fixed list spends your first weeks on topics your loop barely tests. Pick this role in the app and the same problems re-sequence: core topics first, the rest after.

Questions