Post

Best Interview Preperation Resources in 2025

Best Interview Preperation Resources in 2025

Best Coding Interview Resources

This Blog contains the best resources for Coding Interview prep.

💡 How to Think of Logic

  1. Break Down the Problem: Read the question twice. Identify inputs, outputs, and constraints.
  2. Start with Examples: Create test cases manually and simulate the solution step-by-step.
  3. Write Pseudocode: Draft a high-level plan before coding.
  4. Ask “Why?” at Every Step: Understand each operation; don’t memorize solutions.
  5. Visualize: Use diagrams or dry-run tables to debug.
  6. Optimize Gradually: Start with brute force; iterate to optimize for efficiency.

Some Strategies to follow

  1. ⁠ ⁠Spend 1 hour revising concepts: Have a look at previously solved questions, what concepts did you apply and how much time you spent.
  2. ⁠Spend 1 hour learning new concepts: Pick a new topic, spend 1 hour watching video tutorials on it
  3. ⁠Spend 2-3 hours solving questions: Practice, practice, practice. Aim to solve at least 5-6 questions within this duration

You can adjust the timeline above according to your schedule.

Here are a few tips on how to Leetcode efficiently:

  1. Solve with a timer : 25 mins for medium level problems and 35 mins for hard level problems. If you’re not able to solve in this duration, you won’t be able to solve it, so its ok to have a look at solutions and understand the solution
  2. ⁠Revise questions and concepts: Install Leetcode reminder chrome extension to solve previously solved questions
  3. ⁠Don’t focus on the X number of problems : It doesn’t matter if you solve 100 or 1000 questions. What matters is the level of understanding and knowledge you gain by solving these questions. So focus on that, always.

LeetCode Company Wise Coding Question

A-TO-Z Resources

Data Structures & Algorithms

Leetcode Spaced-Repetition Template

Patterns

Famous Problem Sets

Books

Download the PDF of Cracking the Coding Interview

Courses

Mock Interviewing

LeetCode Extensions

Resume Template

📚 100 DSA Questions for Logic Building

CategoryQuestion NamePlatformLink
Basics & Warm-UpPrint a pattern of stars (triangle, pyramid)GeeksforGeeksLink
 Reverse a numberGeeksforGeeksLink
 Check if a number is palindromeGeeksforGeeksLink
 Count digits in a numberGeeksforGeeksLink
 Find factorial of a numberHackerRankLink
ArraysReverse an arrayLeetCodeLink
 Find the maximum and minimum of an arrayGeeksforGeeksLink
 Rotate an array by K stepsLeetCodeLink
 Move all zeroes to the endLeetCodeLink
 Kadane’s Algorithm (Maximum Subarray Sum)LeetCodeLink
StringsReverse a stringLeetCodeLink
 Check if two strings are anagramsLeetCodeLink
 Longest Common PrefixLeetCodeLink
 Check if a string is a palindromeLeetCodeLink
 Count and sayLeetCodeLink
RecursionFibonacci series using recursionGeeksforGeeksLink
 Tower of HanoiGeeksforGeeksLink
 Factorial using recursionLeetCodeLink
 Reverse a linked list using recursionLeetCodeLink
 Permutations of a stringGeeksforGeeksLink
SortingBubble sortGeeksforGeeksLink
 Selection sortGeeksforGeeksLink
 Merge sortGeeksforGeeksLink
 Quick sortGeeksforGeeksLink
 Insertion sortGeeksforGeeksLink
SearchingBinary searchLeetCodeLink
 Linear searchGeeksforGeeksLink
 Search in a rotated sorted arrayLeetCodeLink
 First and last position in a sorted arrayLeetCodeLink
 Square root of a number (using binary search)LeetCodeLink
Linked ListReverse a linked listLeetCodeLink
 Detect a cycle in a linked listLeetCodeLink
 Merge two sorted linked listsLeetCodeLink
 Remove Nth node from the endLeetCodeLink
 Find the middle of a linked listLeetCodeLink
Stacks & QueuesImplement a stack using arraysLeetCodeLink
 Evaluate postfix expressionGeeksforGeeksLink
 Balanced parenthesesLeetCodeLink
 Next greater elementLeetCodeLink
 Implement a queue using stacksLeetCodeLink
Dynamic Programming0/1 Knapsack problemGeeksforGeeksLink
 Fibonacci using dynamic programmingLeetCodeLink
 Longest common subsequenceLeetCodeLink
 Longest increasing subsequenceLeetCodeLink
 Minimum steps to reach the endLeetCodeLink
GraphsBFS traversalGeeksforGeeksLink
 DFS traversalGeeksforGeeksLink
 Detect cycle in an undirected graphGeeksforGeeksLink
 Shortest path in a graph (Dijkstra’s)GeeksforGeeksLink
 Topological sortGeeksforGeeksLink

Must-do Problems

Graphs

Binary Trees

Linked Lists

This post is licensed under CC BY 4.0 by the author.