## More Problems

- Breadth-First Search (BFS) in 2D Matrix/2D-Array
- Depth-First Search (DFS) in 2D Matrix/2D-Array - Iterative Solution
- Number's Complement - 2 Approaches
- ZigZag OR Diagonal traversal in 2d array/Matrix using queue
- Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution
- Maximum Consecutive Ones in a given array
- Breadth-First Search in Disconnected Graph
- Find all the numbers in the range which has prime set bits.
- Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS)
- Number of Islands using BFS

## Subscribe ( No Spam!!)

Enter your email address to subscribe to this blog and receive notifications of new posts by email.

## Recent Posts

- Find an extra element in two almost similar arrays
- find the Arithmetic Progression sequence
- Find the Nth-term in a given arithmetic progression
- Find The Minimum time difference
- Departure and Destination Cities in a given itinerary
- Given an array, rank its elements
- Find Three Consecutive Odd Numbers in an array
- Convert to Non-decreasing Array with one change
- In an array, Duplicate the zeroes without expanding it
- Maximum Depth of Valid Nested Parentheses in an arithmetic expression