- DSA Problems
Minimum Number of Vertices to Reach All Nodes
Find the minimum set of vertices needed to reach all nodes in a directed acyclic graph using topological sorting and in-degree analysis.
- DSA Problems
Flood Fill Algorithm Implementation and Analysis
Complete Java solution for flood fill algorithm with BFS/DFS approaches, time complexity analysis, and practical implementation considerations for FAANG interviews.
- DSA Problems
Max Area of Island Java Solution
Complete Java implementation for finding maximum area of island in 2D grid using DFS and BFS approaches with time and space complexity analysis.
- DSA Problems
Rotting Oranges Java Solution with BFS
Complete Java implementation of the rotting oranges problem using breadth-first search to find minimum time for all oranges to rot.
- DSA Problems
Pacific Atlantic Water Flow Problem Solution
Complete Java implementation for finding cells where water can flow to both Pacific and Atlantic oceans in a grid.
- DSA Problems
Clone Graph Problem Solution | Graph Traversal and Deep Copy
Complete Java solution for cloning a connected undirected graph with BFS/DFS approaches, handling node duplication and adjacency mapping.
- DSA Problems
Number of Islands Problem Solution
Complete Java implementation for counting connected land cells in a 2D grid using DFS and BFS approaches.
- DSA Problems
Design Search Suggestions System
Implementation of a search suggestions system with autocomplete functionality using trie data structure and priority queue for efficient result retrieval.
- DSA Problems
Add and Search Word Data Structure Implementation
Complete Java solution for designing a word dictionary with add and search functionality using Trie data structure.
- DSA Problems
Word Search II Java Solution with Trie and DFS
Complete Java implementation for Word Search II problem using Trie data structure and depth-first search with backtracking.
- DSA Problems
Implement Trie (Prefix Tree) Data Structure in Java
Complete Java solution for implementing a Trie (Prefix Tree) data structure with insert, search, and startsWith operations optimized for string prefix matching.
- DSA Problems
Convert Sorted Array to Binary Search Tree
Learn to convert a sorted array into a height-balanced binary search tree using divide-and-conquer approach with O(n) time and space complexity.
FAANG Data Structures & Algorithms Problems Guide
A curated catalog of concrete data structures and algorithms problems. Use it to plan practice, track coverage, and rehearse solutions with a repeatable approach.