Scribd
Upload
12 views

Leetcode Sheet

The document provides a curated list of essential coding problems categorized by various techniques such as Two Pointers, Sliding Window, and Dynamic Programming, aimed at helping individuals prepare for coding interviews. Each category includes a brief description and a link to relevant LeetCode problems. The author expresses a commitment to assist others in their preparation journey.

Uploaded by

Suraj kumar Yadav
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

Leetcode Sheet

The document provides a curated list of essential coding problems categorized by various techniques such as Two Pointers, Sliding Window, and Dynamic Programming, aimed at helping individuals prepare for coding interviews. Each category includes a brief description and a link to relevant LeetCode problems. The author expresses a commitment to assist others in their preparation journey.

Uploaded by

Suraj kumar Yadav
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 25

@tauseeffayyaz

@tauseeffayyaz

Preparing for coding interviews used to feel like an


endless grind. I spent countless hours searching for
the right LeetCode problems, wondering if I was even
solving the right ones.

If I had a structured cheat sheet back then, it would


have saved me so much time and effort.

That’s why I’m sharing this well curated list of must-


solve problems for online assessments and coding
interviews.
@tauseeffayyaz

Two Pointers
Essential for optimizing array and string problems,
reducing time complexity from O(n²) to O(n).

https://leetcode.com/problem-list/9ns2k47r/
@tauseeffayyaz

Sliding Window
Great for subarray problems, helps in handling
streaming data efficiently.

https://leetcode.com/problem-list/x1lbzfk3/
@tauseeffayyaz

Binary Search
A must-know for efficient searching in sorted datasets,
reducing complexity to O(log n).

https://leetcode.com/problem-list/504wrexe/
@tauseeffayyaz

Hash Table & Map


Fundamental for handling large datasets, fast lookup
operations, and avoiding nested loops.

https://leetcode.com/problem-list/9ixr4vaj/
@tauseeffayyaz

Linked List
Commonly tested in FAANG interviews, important for
understanding memory management.

https://leetcode.com/problem-list/9rizphpj/
@tauseeffayyaz

Heaps
Crucial for priority-based problems like scheduling and
finding the k-largest elements.

https://leetcode.com/problem-list/93chilpi/
@tauseeffayyaz

Graphs
Key for solving network and connectivity problems in
real-world applications.

https://leetcode.com/problem-list/9x1uea1h/
@tauseeffayyaz

Trees
Important for hierarchical data structures, recursion,
and divide & conquer techniques.

https://leetcode.com/problem-list/9ak7i9wv/
@tauseeffayyaz

Trees
More in-depth coverage of tree traversal, balancing,
and BST optimizations.

https://leetcode.com/problem-list/9ak7i9wv/
@tauseeffayyaz

Dynamic Programming
The toughest yet most valuable technique, used in
optimal substructure and overlapping subproblems.

https://leetcode.com/problem-list/9x5spweh/
@tauseeffayyaz

Greedy Algorithms
Great for optimization problems, making locally
optimal choices at each step.

https://leetcode.com/problem-list/925p7hr1/
@tauseeffayyaz

Backtracking
Powerful for solving permutations, combinations, and
constraint-satisfaction problems.

https://leetcode.com/problem-list/9x9qz3md/
@tauseeffayyaz

Trie
Best for efficient word searching, autocomplete, and
prefix-based problems.

https://leetcode.com/problem-list/5uyupjcr/
@tauseeffayyaz

Monotonic & Priority Queue


Useful for maintaining ordered sequences and
optimizing real-time decision-making.

https://leetcode.com/problem-list/9rt1jt27/
@tauseeffayyaz

Dijkstra’s Algorithm
Key for shortest path problems in weighted graphs,
widely used in maps and routing.

https://leetcode.com/problem-list/9id5lube/
@tauseeffayyaz

Bellman-Ford Algorithm
Similar to Dijkstra but works with negative weights,
useful in finance and network routing.

https://leetcode.com/problem-list/9id9smj2/
@tauseeffayyaz

Floyd-Warshall Algorithm
Used for finding shortest paths between all pairs of
nodes in a graph.

https://leetcode.com/problem-list/9idenloe/
@tauseeffayyaz

Bridges & Articulation Points


Advanced graph concepts used for network reliability
and vulnerability analysis.

https://leetcode.com/problem-list/9id9ahz7/
@tauseeffayyaz

Disjoint Set Union


Vital for connectivity problems, cycle detection, and
Kruskal’s algorithm.

https://leetcode.com/problem-list/5lhmb4mj/
@tauseeffayyaz

Bit Manipulation
Optimizes mathematical operations, reduces memory
usage, and speeds up calculations.

https://leetcode.com/problem-list/92qvw6c6/
@tauseeffayyaz

What’s Next?
Let me know what you’re struggling with,
and I’ll bring the most helpful tips and
resources to you.

It takes time and effort to prepare these


valuable resources, but I’m committed to
helping you.
@tauseeffayyaz

Your support keeps me motivated

https://www.linkedin.com/in/tauseeffayyaz/

https://x.com/tauseeffayyaz0

https://www.instagram.com/tauseeffayyaz/
@tauseeffayyaz

LIKE & REPOST

You might also like