Skip to content
LIVE Agentic AI Workshop · 12 DecView workshop →

Explore Netsetos

My Learning
Join workshopAll courses →
Contact Support · info@netsetos.com
top of page

DSA-200: FAANG Interview Prep

DSA-200 cover: a binary tree with a highlighted search path above an array with two pointers

Group Discussion

This program is connected to a group. You’ll be added once you join the program.

Netsetos Group

Netsetos Group

Private555 Members

198 hand-picked DSA problems for mid-senior Indian engineers targeting FAANG and top product companies. Python reference solutions, interview Q&A, and 18 modules covering the core patterns asked in coding interviews.

Course syllabus

  1. Arrays & Hashing
    1. Two Sum
    2. Contains Duplicate
    3. Valid Anagram
    4. Group Anagrams
    5. Top K Frequent Elements
    6. Product of Array Except Self
    7. Valid Sudoku
    8. Encode and Decode Strings
    9. Longest Consecutive Sequence
    10. Two Sum II
    11. Subarray Sum Equals K
    12. Majority Element
    13. Find All Duplicates in an Array
    14. First Missing Positive
  2. Two Pointers
    1. Valid Palindrome
    2. 3Sum
    3. Container With Most Water
    4. Trapping Rain Water
    5. Remove Duplicates from Sorted Array
    6. Move Zeroes
    7. Sort Colors (Dutch National Flag)
    8. Merge Sorted Array
    9. Boats to Save People
    10. Next Permutation
  3. Sliding Window
    1. Best Time to Buy and Sell Stock
    2. Longest Substring Without Repeating Characters
    3. Longest Repeating Character Replacement
    4. Permutation in String
    5. Minimum Window Substring
    6. Sliding Window Maximum
    7. Subarrays with K Different Integers
    8. Max Consecutive Ones III
    9. Fruit Into Baskets
    10. Minimum Size Subarray Sum
  4. Stack
    1. Valid Parentheses
    2. Min Stack
    3. Evaluate Reverse Polish Notation
    4. Generate Parentheses
    5. Daily Temperatures
    6. Car Fleet
    7. Largest Rectangle in Histogram
    8. Asteroid Collision
    9. Decode String
    10. Next Greater Element I
    11. Longest Valid Parentheses
    12. Maximal Rectangle
  5. Binary Search
    1. Binary Search
    2. Search a 2D Matrix
    3. Koko Eating Bananas
    4. Find Minimum in Rotated Sorted Array
    5. Search in Rotated Sorted Array
    6. Time Based Key-Value Store
    7. Median of Two Sorted Arrays
    8. Find First and Last Position of Element
    9. Capacity To Ship Packages Within D Days
    10. Split Array Largest Sum
    11. Find Peak Element
    12. Search in Rotated Sorted Array II
  6. Linked List
    1. Reverse Linked List
    2. Merge Two Sorted Lists
    3. Linked List Cycle
    4. Linked List Cycle II
    5. Remove Nth Node From End of List
    6. Reorder List
    7. Copy List with Random Pointer
    8. Add Two Numbers
    9. Merge k Sorted Lists
    10. LRU Cache
  7. Trees
    1. Invert Binary Tree
    2. Maximum Depth of Binary Tree
    3. Diameter of Binary Tree
    4. Balanced Binary Tree
    5. Same Tree
    6. Subtree of Another Tree
    7. LCA of Binary Search Tree
    8. Binary Tree Level Order Traversal
    9. Binary Tree Right Side View
    10. Count Good Nodes in Binary Tree
    11. Validate Binary Search Tree
    12. Kth Smallest Element in a BST
    13. Construct Tree from Preorder and Inorder
    14. Binary Tree Maximum Path Sum
    15. Serialize and Deserialize Binary Tree
    16. All Nodes Distance K in Binary Tree
  8. Tries
    1. Implement Trie (Prefix Tree)
    2. Design Add and Search Words Data Structure
    3. Word Search II
    4. Longest Word in Dictionary
    5. Replace Words
  9. Heap / PQ
    1. Kth Largest Element in an Array
    2. Last Stone Weight
    3. K Closest Points to Origin
    4. Task Scheduler
    5. Design Twitter
    6. Find Median from Data Stream
    7. IPO
    8. Reorganize String
    9. Smallest Range Covering Elements from K Lists
    10. Kth Largest Element in a Stream
  10. Backtracking
    1. Subsets
    2. Combination Sum
    3. Permutations
    4. Word Search
    5. N-Queens
    6. Palindrome Partitioning
    7. Letter Combinations of a Phone Number
    8. Combinations
    9. Restore IP Addresses
    10. Sudoku Solver
  11. Graphs
    1. Number of Islands
    2. Max Area of Island
    3. Clone Graph
    4. Pacific Atlantic Water Flow
    5. Surrounded Regions
    6. Rotting Oranges
    7. Walls and Gates
    8. Redundant Connection
    9. Number of Connected Components in Undirected Graph
    10. Graph Valid Tree
    11. Word Ladder
    12. 01 Matrix
    13. Evaluate Division
    14. Shortest Path in Binary Matrix
    15. Sliding Puzzle
    16. Shortest Bridge
    17. Number of Distinct Islands
  12. Advanced Graphs
    1. Network Delay Time
    2. Cheapest Flights Within K Stops
    3. Min Cost to Connect All Points
    4. Swim in Rising Water
    5. Alien Dictionary
    6. Reconstruct Itinerary
    7. Minimum Cost For Tickets
    8. Find the City With the Smallest Number of Neighbors
    9. Critical Connections in a Network
    10. Minimum Knight Moves
    11. Trapping Rain Water II
  13. 1-D DP
    1. Climbing Stairs
    2. Min Cost Climbing Stairs
    3. House Robber
    4. House Robber II
    5. Longest Palindromic Substring
    6. Palindromic Substrings
    7. Decode Ways
    8. Coin Change
    9. Longest Increasing Subsequence
    10. Word Break
    11. Partition Equal Subset Sum
    12. Maximum Product Subarray
    13. Maximum Subarray (Kadane's)
    14. Perfect Squares
  14. 2-D DP
    1. Unique Paths
    2. Longest Common Subsequence
    3. Edit Distance
    4. Regular Expression Matching
    5. Longest Palindromic Subsequence
    6. Distinct Subsequences
    7. Interleaving String
    8. Target Sum
    9. Ones and Zeroes
    10. Palindrome Partitioning II
    11. Burst Balloons
    12. Dungeon Game
    13. Cherry Pickup II
    14. Longest Increasing Path in a Matrix
    15. Wildcard Matching
    16. Minimum Cost to Cut a Stick
  15. Greedy
    1. Jump Game
    2. Jump Game II
    3. Gas Station
    4. Hand of Straights
    5. Merge Triplets to Form Target Triplet
    6. Partition Labels
    7. Valid Parenthesis String
    8. Candy
    9. Queue Reconstruction by Height
    10. Task Scheduler (Greedy formulation)
  16. Intervals
    1. Insert Interval
    2. Merge Intervals
    3. Non-overlapping Intervals
    4. Meeting Rooms
    5. Meeting Rooms II
    6. Minimum Interval to Include Each Query
    7. Employee Free Time
    8. Interval List Intersections
  17. Math / Bit
    1. Rotate Image
    2. Spiral Matrix
    3. Set Matrix Zeroes
    4. Happy Number
    5. Pow(x, n)
    6. Single Number
    7. Number of 1 Bits
    8. Missing Number
  18. Design / LLD
    1. Design HashMap
    2. Insert Delete GetRandom O(1)
    3. Design Tic-Tac-Toe
    4. LFU Cache
    5. Design Hit Counter

81 enrolments, as of Oct 2026

Questions about this course

Is it really free?

Yes. There is no fee and no card is needed. You join with a free site account so your progress is saved.

How long does it take?

It is self-paced, so it depends on you. There are 198 problems across 18 modules, one problem per step.

Is there a certificate?

No. This course doesn't award a certificate.

bottom of page