Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

abhinavroy23/Coding-Interview-Pattern-with-Questions

Repository files navigation

Coding-Interview-Pattern-with-Questions

1. Sliding Window

  • Maximum Sum Subarray of Size K (easy)
  • Smallest Subarray with a given sum (easy)
  • Longest Substring with K Distinct Characters (medium)
  • Fruits into Baskets (medium)
  • No-repeat Substring (hard)
  • Longest Substring with Same Letters after Replacement (hard)
  • Longest Subarray with Ones after Replacement (hard)

2. Two Pointers

  • Pair with Target Sum (easy)
  • Remove Duplicates (easy)
  • Squaring a Sorted Array (easy)
  • Triplet Sum to Zero (medium)
  • Triplet Sum Close to Target (medium)
  • Triplets with Smaller Sum (medium)
  • Subarrays with Product Less than a Target (medium)
  • Dutch National Flag Problem (medium)

3. Fast & Slow Pointers

  • LinkedList Cycle (easy)
  • Start of LinkedList Cycle (medium)
  • Happy Number (medium)
  • Middle of the LinkedList (easy)

4. Merge Intervals

  • Merge Intervals (medium)
  • Insert Interval (medium)
  • Intervals Intersection (medium)
  • Conflicting Appointments (medium)

5. Cyclic sort

  • Cyclic Sort (easy)
  • Find the Missing Number (easy)
  • Find all Missing Numbers (easy)
  • Find the Duplicate Number (easy)
  • Find all Duplicate Numbers (easy)

6. In-Place Reversal of Linked List

  • Reverse a LinkedList (easy)
  • Reverse a Sub-list (medium)
  • Reverse every K-element Sub-list (medium)

7. Tree BFS

  • Binary Tree Level Order Traversal (easy)
  • Reverse Level Order Traversal (easy)
  • Zigzag Traversal (medium)
  • Level Averages in a Binary Tree (easy)
  • Minimum Depth of a Binary Tree (easy)
  • Level Order Successor (easy)
  • Connect Level Order Siblings (medium)

8. Tree DFS

  • Binary Tree Path Sum (easy)
  • All Paths for a Sum (medium)
  • Sum of Path Numbers (medium)
  • Path With Given Sequence (medium)
  • Count Paths for a Sum (medium)

9. Two Heaps

  • Find the Median of a Number Stream (medium)
  • Sliding Window Median (hard)
  • Maximize Capital (hard)

10. Subsets

  • Subsets (easy)
  • Subsets With Duplicates (easy)
  • Permutations (medium)
  • String Permutations by changing case (medium)
  • Balanced Parentheses (hard)
  • Unique Generalized Abbreviations (hard)

11. Modified Binary Search

  • Order-agnostic Binary Search (easy)
  • Ceiling of a Number (medium)
  • Next Letter (medium)
  • Number Range (medium)
  • Search in a Sorted Infinite Array (medium)
  • Minimum Difference Element (medium)
  • Bitonic Array Maximum (easy)

12. Bitwise XOR

  • Single Number (easy)
  • Two Single Numbers (medium)
  • Complement of Base 10 Number (medium)

13. Top K Elements

  • Top 'K' Numbers (easy)
  • Kth Smallest Number (easy)
  • 'K' Closest Points to the Origin (easy)
  • Connect Ropes (easy)
  • Top 'K' Frequent Numbers (medium)
  • Frequency Sort (medium)
  • Kth Largest Number in a Stream (medium)
  • 'K' Closest Numbers (medium)
  • Maximum Distinct Elements (medium)
  • Sum of Elements (medium)
  • Rearrange String (hard)

14. K-Way Merge

  • Merge K Sorted Lists (medium)
  • Kth Smallest Number in M Sorted Lists (Medium)
  • Kth Smallest Number in a Sorted Matrix (Hard)
  • Smallest Number Range (Hard)

15. 0-1 Knapsack - DP

  • 0/1 Knapsack (medium)
  • Equal Subset Sum Partition (medium)
  • Subset Sum (medium)
  • Minimum Subset Sum Difference (hard)

16. Topological Sort - Graph

  • Topological Sort (medium)
  • Tasks Scheduling (medium)
  • Tasks Scheduling Order (medium)
  • All Tasks Scheduling Orders (hard)
  • Alien Dictionary (hard)

About

Grokking the Coding Interview - Most popular patterns

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

AltStyle によって変換されたページ (->オリジナル) /