Data structure and algorithms for interviews

Ace your Tech Interviews

What you will learn

Description

Covers around 200+ most popular coding interview problems ranging from a variety of topics

Get Instant Notification of New Courses on our Telegram channel.

Two Pointers
- Easy
  - Pair with Target Sum
  - Remove Duplicates
  - Squaring a Sorted Array
- Medium
  - Triplet Sum to Zero
  - Triplet Sum Close to Target
  - Triplets with Smaller Sum
  - Subarrays with Product Less than a Target
  - Dutch National Flag Problem
Fast & Slow Pointers
- Easy
  - Middle of the LinkedList
  - LinkedList Cycle
- Medium
  - Start of LinkedList Cycle
  - Happy Numbers
Bitwise Manipulation
- Single Numbers
- Single Number II
- Single Number III
- Flipping the image

Sliding Window
- Easy
  - Maximum Sum Subarray of Size K
  - Smallest Subarray With a Greater Sum
- Medium
  - Longest Substring with maximum K Distinct Characters
  - Fruits into Baskets
- Hard
  - Longest Substring with Distinct Characters
  - Longest Substring with Same Letters after Replacement
  - Longest Subarray with Ones after Replacement
Arrays
- Medium
  - Group Anagrams
- Hard
  - Trapping Rain Water
Merge Intervals
- Medium
  - Intervals Intersection
  - Conflicting Appointments
Linked List
- Easy
  - Reverse a Linked List
- Medium
  - Reverse a sub list
  - Reverse a k-element sub list
Two Heaps
- Medium
  - Find the median of a number stream
- Hard
  - Maximum Capital
  - Sliding Window Median
Top k elements
- Easy
  - Top ‘K’ Numbers
  - Kth Smallest Number
  - ‘K’ Closest Points to the Origin
  - Connect Ropes
- Medium
  - Top ‘K’ Frequent Numbers
  - Frequency Sort
  - Kth Largest Number in a Stream
  - ‘K’ Closest Numbers
  - Maximum Distinct Elements
  - Sum of Elements
- Hard
  - Rearrange String
K-way merge
Binary Search
Greedy Technique
Backtracking
1D Dynamic programing
2D Dynamic programing
Cyclic Sort
Topological Sort
Stacks
Queues
Depth First Search
Breadth First Search
Trie
Hash Maps
Math Tricks
Miscellaneous