### Recent Posts

- k-Nearest Neighbors
- Find longest Snake sequence in a given matrix
- Dynamic Programming — Count all paths in 2D Matrix with Obstructions in it
- Dynamic Programming — Count all paths from top left to bottom right of a mXn matrix
- Reverse the given Array without using built in function
- Print All Diagonals of a given matrix
- Dynamic Programming — Edit Distance Problem

### Follow me on Twitter

My Tweets### Top Posts & Pages

- Binary Search Tree Complete Implementation.
- Reverse a Linked List
- All Articles
- Dynamic Programming - Coin Change Problem
- Binary Min - Max Heap
- Introduction To Backtracking Programming
- Backtracking - N Queens Problem
- Dynamic Programming - Subset Sum Problem
- Dynamic Programming - Longest Common Subsequence
- Introduction To Dynamic Programming - Fibonacci Series

More

### Top Posts & Pages

- Binary Search Tree Complete Implementation.
- Reverse a Linked List
- All Articles
- Dynamic Programming - Coin Change Problem
- Binary Min - Max Heap
- Introduction To Backtracking Programming
- Backtracking - N Queens Problem
- Dynamic Programming - Subset Sum Problem
- Dynamic Programming - Longest Common Subsequence
- Introduction To Dynamic Programming - Fibonacci Series

### Categories

- Adobe (30)
- Amazon Questions (123)
- Apache (13)
- Arrays (71)
- Backtracking (9)
- Beginner (63)
- Binary Tree (72)
- Bit Manipulation (3)
- Bloomberg (5)
- Difficulty Level (39)
- Divide and Conquer (7)
- Dynamic Programming (22)
- Epic Systems (22)
- Expert (51)
- Facebook (26)
- Flipkart (8)
- Goldman Sachs (5)
- Google Interview (46)
- Graphs (2)
- Groupon (6)
- Hash Table (3)
- Heaps (4)
- Intermediate (94)
- Linked List (27)
- Machine Learning (1)
- Microsoft Interview (75)
- MISC (3)
- NetApp (12)
- Numbers (4)
- NVIDIA (3)
- Oracle (5)
- Priority Queue (5)
- Qualcomm (3)
- Recursion (106)
- Search Algorithms (4)
- Sorting Techniques (10)
- Strings (13)
- Top Companies (91)
- Trees (58)
- Twitter (8)
- Uncategorized (5)
- Yahoo (25)

## Recent Comments