{"id":13627932,"url":"https://github.com/ashuray/InterviewRoom","last_synced_at":"2025-04-17T00:32:50.205Z","repository":{"id":37410223,"uuid":"163823512","full_name":"ashuray/InterviewRoom","owner":"ashuray","description":"Contains all important data structure and algorithms problems asked in interviews","archived":false,"fork":false,"pushed_at":"2022-11-10T10:31:10.000Z","size":9,"stargazers_count":798,"open_issues_count":7,"forks_count":186,"subscribers_count":10,"default_branch":"master","last_synced_at":"2024-08-01T22:41:42.039Z","etag":null,"topics":["algorithm","amazon-interview","datastructures-algorithms","geeksforgeeks","interview","interview-preparation","interview-questions","interviewbit","leetcode","microsoft-interview"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ashuray.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2019-01-02T09:54:44.000Z","updated_at":"2024-07-27T09:52:08.000Z","dependencies_parsed_at":"2022-07-09T18:46:12.472Z","dependency_job_id":null,"html_url":"https://github.com/ashuray/InterviewRoom","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ashuray%2FInterviewRoom","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ashuray%2FInterviewRoom/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ashuray%2FInterviewRoom/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ashuray%2FInterviewRoom/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ashuray","download_url":"https://codeload.github.com/ashuray/InterviewRoom/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":223735178,"owners_count":17194061,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","amazon-interview","datastructures-algorithms","geeksforgeeks","interview","interview-preparation","interview-questions","interviewbit","leetcode","microsoft-interview"],"created_at":"2024-08-01T22:00:40.915Z","updated_at":"2024-11-08T18:31:07.607Z","avatar_url":"https://github.com/ashuray.png","language":null,"readme":"# Interview Preparation\nYou can crack any Interview if you are preparing yourself in a well organised manner. There are lots of Data Structure and Algorithm problems on internet and it is quite impossible for a person to practice all of them. So it is really important that you practice a list of few problems which are really important and covers almost every concepts. \n\nI have tried my best to sort all those problems for you and ordered them as well. I hope if you follow my list and study in the same order in which i have given, it will surely help you prepare very well for the Job Interview in your 2 months vacation.\n\n## Table of Contents\n- [Data Structures](#data-structures)\n  - [Array](#array)\n  - [LinkedList](#linkedlist)\n  - [Stack](#stack)\n  - [Queue](#queue)\n  - [Binary Tree](#binary-tree)\n  - [Binary Search Tree](#binary-search-tree)\n  - [Heap and Priority Queue](#heap-and-priority-queue)\n- [Algorithms](#algorithms)\n  - [Binary Search](#binary-search)\n  - [Dynamic Programming](#dynamic-programming)\n\n## Data Structures\n - [ ] Tutorials:\n     - [MIT 6.006 Introduction to Algorithms, Fall 2011 (video)](https://www.youtube.com/watch?v=HtSuA80QTyo\u0026list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)\n     - [mycodeschool (video)](https://www.youtube.com/watch?v=92S4zgXN17o\u0026list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P)\n     - [UCSanDiegoX's Algorithms and Data Structures](https://www.edx.org/course/data-structures-fundamentals)\n\n### Array\n| **ID** | **PROBLEM STATEMENT**                                    |  **PROBLEM LINK**           |\n|--------|----------------------------------------------------------|-----------------------------|\n| 1      | Missing number in array                     | [Leetcode](https://leetcode.com/problems/missing-number/) ,  [GFG](https://practice.geeksforgeeks.org/problems/missing-number-in-array/0)           |\n| 2      | Subarray with given sum                     |  [GFG](https://practice.geeksforgeeks.org/problems/subarray-with-given-sum/0)           |\n| 3     | 2 Sum                |  [LeetCode](https://leetcode.com/problems/two-sum/) , [InterviewBit](https://www.interviewbit.com/problems/2-sum/), [GFG](https://practice.geeksforgeeks.org/problems/key-pair/0) ,         |\n| 4     | Majority Element               |   [LeetCode](https://leetcode.com/problems/majority-element/)  , [InterviewBit](https://www.interviewbit.com/problems/majority-element/) , [GFG](https://practice.geeksforgeeks.org/problems/majority-element/0)      |\n| 5     | Max Consecutive Ones              |        [LeetCode](https://leetcode.com/problems/max-consecutive-ones/) , [InterviewBit](https://www.interviewbit.com/problems/max-continuous-series-of-1s/)     |\n| 6     | Sort an array of 0s, 1s and 2s               |  [GFG](https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s/0) , [LeetCode](https://leetcode.com/problems/sort-colors/)   |\n| 7     | Spiral Matrix              |        [LeetCode](https://leetcode.com/problems/spiral-matrix/)  , [InterviewBit](https://www.interviewbit.com/problems/spiral-order-matrix-i/)      |\n| 8     | Find the duplicate number              |        [LeetCode](https://leetcode.com/problems/find-the-duplicate-number/) |\n| 9     | Largest number formed from an array              |   [LeetCode](https://leetcode.com/problems/largest-number/) , [InterviewBit](https://www.interviewbit.com/problems/largest-number/), [GFG](https://practice.geeksforgeeks.org/problems/largest-number-formed-from-an-array/0) |\n| 10     | Next Permutation               |   [LeetCode](https://leetcode.com/problems/next-permutation/)  , [InterviewBit](https://www.interviewbit.com/problems/next-permutation/)      |\n| 11     | Merge Overlapping Intervals              |   [LeetCode](https://leetcode.com/problems/merge-intervals/) , [InterviewBit](https://www.interviewbit.com/problems/merge-intervals/), [GFG](https://www.interviewbit.com/problems/merge-intervals/) |\n| 12     | First Missing Positive               |   [LeetCode](https://leetcode.com/problems/first-missing-positive/)  , [InterviewBit](https://www.interviewbit.com/problems/first-missing-integer/)      |\n\n### LinkedList\n| **ID** | **PROBLEM STATEMENT**                                    |  **PROBLEM LINK**           |\n|--------|----------------------------------------------------------|-----------------------------|\n| 1      | Find middle element in a linked list                     | [LeetCode](https://leetcode.com/problems/middle-of-the-linked-list/) , [GFG](https://practice.geeksforgeeks.org/problems/finding-middle-element-in-a-linked-list/1)           |\n| 2      | Remove n'th node from end of a linked list          | [LeetCode](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) , [InterviewBit](https://www.interviewbit.com/problems/remove-nth-node-from-list-end/)                            |\n| 3      | Intersection Point in Y shaped linked list               | [LeetCode](https://leetcode.com/problems/intersection-of-two-linked-lists/) , [InterviewBit](https://www.interviewbit.com/problems/intersection-of-linked-lists/)                             |\n| 4      | Reverse a linked list                                    | [LeetCode](https://leetcode.com/problems/reverse-linked-list/) , [InterviewBit](https://www.interviewbit.com/problems/reverse-linked-list/)                                      |\n| 5      | Check if a linked list is Palindrome                     | [LeetCode](https://leetcode.com/problems/palindrome-linked-list/) , [InterviewBit](https://www.interviewbit.com/problems/palindrome-list/)                                          |\n| 6      | Rotate a LinkedList                                       | [LeetCode](https://leetcode.com/problems/rotate-list/) ,           [InterviewBit](https://www.interviewbit.com/problems/rotate-list/)                                              |\n| 7      | Reverse linked list in a group of given size k           | [LeetCode](https://leetcode.com/problems/reverse-nodes-in-k-group/) , [InterviewBit](https://www.interviewbit.com/problems/k-reverse-linked-list/)                                    |\n| 8      | Detect and Remove Loop in a linked list                  | [LeetCode](https://leetcode.com/problems/linked-list-cycle-ii/) ,   [InterviewBit](https://www.interviewbit.com/problems/list-cycle/)                                               |\n| 9      | Find length of the Loop in a linked list                 | [GFG](https://practice.geeksforgeeks.org/problems/find-length-of-loop/1)                               |\n| 10      | Segregate even and odd positioned nodes in a linked list | [LeetCode](https://leetcode.com/problems/odd-even-linked-list/) , [GFG](https://practice.geeksforgeeks.org/problems/rearrange-a-linked-list/1)                           |\n| 11     | Segregate even and odd valued nodes in a linked list     | [GFG](https://www.geeksforgeeks.org/segregate-even-and-odd-elements-in-a-linked-list/)                 |\n| 12     | Clone a linked list with next and random pointer         | [LeetCode](https://leetcode.com/problems/copy-list-with-random-pointer/) , [GFG](https://practice.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1)  |\n| 13     | Reorder List L1-\u003eL2-\u003e...Ln to L1-\u003eLn-\u003eL2-\u003eLn-1....       | [LeetCode](https://leetcode.com/problems/reorder-list/) ,          [InterviewBit](https://www.interviewbit.com/problems/reorder-list/)                                             |\n| 14     | Delete N nodes after M nodes of a linked list            | [GFG](https://practice.geeksforgeeks.org/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/1)     |\n| 15     | Merge K sorted list                                      | [LeetCode](https://leetcode.com/problems/merge-k-sorted-lists/) , [InterviewBit](https://www.interviewbit.com/problems/merge-two-sorted-lists/) , [GFG](https://practice.geeksforgeeks.org/problems/merge-k-sorted-linked-lists/1)                       |\n| 16     | Add two numbers represented by a linked list             | [LeetCode](https://leetcode.com/problems/add-two-numbers/) , [InterviewBit](https://www.interviewbit.com/problems/add-two-numbers-as-lists/)                                 |\n\n### Stack\n| **ID** | **PROBLEM STATEMENT**                                    |  **PROBLEM LINK**            |\n|--------|----------------------------------------------------------|------------------------------|\n| 1      | Valid Parentheses                                        | [LeetCode](https://leetcode.com/problems/valid-parentheses/)                                                 |\n| 2      | Length of longest valid Parentheses                      | [LeetCode](https://leetcode.com/problems/longest-valid-parentheses/)                                         |\n| 3      | Next Greater Element                                     | [GFG](https://practice.geeksforgeeks.org/problems/next-larger-element/0) , [LeetCode](https://leetcode.com/problems/next-greater-element-ii/)                                           |\n| 4      | Nearest Smaller Element                                  | [InterviewBit](https://www.interviewbit.com/problems/nearest-smaller-element/)                                   |\n| 5      | Trapping Rain Water                                      | [LeetCode](https://leetcode.com/problems/trapping-rain-water/) ,                 [InterviewBit](https://www.interviewbit.com/problems/rain-water-trapped/)                                        |\n| 6      | Largest Rectangle in a Histogram                         | [LeetCode](https://leetcode.com/problems/largest-rectangle-in-histogram/) ,     [InterviewBit](https://www.interviewbit.com/problems/largest-rectangle-in-histogram/)                            |\n| 7     | Min Stack                                                  | [LeetCode](https://leetcode.com/problems/min-stack/) ,                           [InterviewBit](https://www.interviewbit.com/problems/min-stack/)                                                 |\n\n### Queue\n| **ID** | **PROBLEM STATEMENT**                                    | **PROBLEM LINK**              |\n|--------|----------------------------------------------------------|-------------------------------|\n| 1      | Generate binary numbers from 1 to n                      | [GFG](https://www.geeksforgeeks.org/interesting-method-generate-binary-numbers-1-n/)                     |\n| 2      | Minimum time required to rot all Oranges                 | [GFG](https://practice.geeksforgeeks.org/problems/rotten-oranges/0) , [LeetCode](https://leetcode.com/problems/rotting-oranges/)                                     |\n| 3      | First non repeating character in a stream                | [GFG](https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream/0)           |\n| 4      | Circular tour                                            | [GFG](https://practice.geeksforgeeks.org/problems/circular-tour/1) ,      [LeetCode](https://leetcode.com/problems/gas-station/)                                                        |\n| 5      | Sliding Window Maximum                                   | [LeetCode](https://leetcode.com/problems/sliding-window-maximum/) , [InterviewBit](https://www.interviewbit.com/problems/sliding-window-maximum/)                                     |\n\n### Binary Tree\n| **ID** | **PROBLEM STATEMENT**                                   | **PROBLEM LINK**               |\n|--------|---------------------------------------------------------|--------------------------------|\n| 1      | Determine Height of a binary tree                       |  [LeetCode](https://leetcode.com/problems/maximum-depth-of-binary-tree/) , [InterviewBit](https://www.interviewbit.com/problems/max-depth-of-binary-tree/)                                   |\n| 2      | Inorder Traversal                                       | [InterviewBit](https://www.interviewbit.com/problems/inorder-traversal/)                                          |\n| 3      | Preorder Traversal                                      |  [InterviewBit](https://www.interviewbit.com/problems/preorder-traversal/)                                         |\n| 4      | Postorder Traversal                                     |  [InterviewBit](https://www.interviewbit.com/problems/postorder-traversal/)                                        |\n| 5      | Level Order Traversal                                   |  [LeetCode](https://leetcode.com/problems/binary-tree-level-order-traversal/)                                  |\n| 6      | Level Order Traversal in Spiral Form                    | [LeetCode](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) , [InterviewBit](https://www.interviewbit.com/problems/zigzag-level-order-traversal-bt/)                            |\n| 7      | Left and Right View of Binary Tree                      |   [LeetCode](https://leetcode.com/problems/binary-tree-right-side-view/)                                        |\n| 8      | Diameter of a Binary tree                               |  [LeetCode](https://leetcode.com/problems/diameter-of-binary-tree/)                                            |\n| 9      | Populating Next Right Pointers in Each Node             |   [LeetCode](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)  , [InterviewBit](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)                        |\n| 10     | Check if a Binary Tree is Sum Tree                      |   [GFG](https://practice.geeksforgeeks.org/problems/sum-tree/1)                                            |\n| 11     | Check if a Binary Tree is Balanced                      | [LeetCode](https://leetcode.com/problems/balanced-binary-tree/)   , [InterviewBit](https://leetcode.com/problems/balanced-binary-tree/)                                               |\n| 12     | Check if a Binary Tree is BST                           | [GFG](https://practice.geeksforgeeks.org/problems/check-for-bst/1)                                       |\n| 13     | Convert a given Binary Tree into its mirror Tree        |  [GFG](https://practice.geeksforgeeks.org/problems/mirror-tree/1)                                         |\n| 14     | Check if two Binary Tree are mirror image of each other |   [GFG](https://practice.geeksforgeeks.org/problems/check-mirror-in-n-ary-tree/0)                          |\n| 15     | Check if a Binary Tree is Symmetric Binary Tree         |   [InterviewBit](https://www.interviewbit.com/problems/symmetric-binary-tree/)  , [LeetCode](https://leetcode.com/problems/symmetric-tree/)                                                     |\n| 16     | Invert a Binary Tree                                    |   [InterviewBit](https://www.interviewbit.com/problems/invert-the-binary-tree/) , [LeetCode](https://leetcode.com/problems/invert-binary-tree/)                                                 |\n| 17     | Vertical order Traversal                                |  [InterviewBit](https://www.interviewbit.com/problems/vertical-order-traversal-of-binary-tree/)                    |\n| 18     | Top View Of Binary Tree                                 |  [GFG](https://practice.geeksforgeeks.org/problems/top-view-of-binary-tree/1)                             |\n| 19     | Bottom View of Binary Tree                              |  [GFG](https://practice.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1)                          |\n| 20     | Check if Root to Leaf path sum exist                    |  [InterviewBit](https://www.interviewbit.com/problems/path-sum/) ,                     [LeetCode](https://leetcode.com/problems/path-sum/)                                                           |\n| 21     | All Root to Leaf path sum                     |  [InterviewBit](https://www.interviewbit.com/problems/root-to-leaf-paths-with-sum/) ,   [LeetCode](https://leetcode.com/problems/path-sum-ii/)                                                        |\n| 22     | Maximum path sum from leaf to leaf                      | [GFG](https://practice.geeksforgeeks.org/problems/maximum-path-sum/1)                                    |\n| 23     | Maximum path sum from any node to any node              | [LeetCode](https://leetcode.com/problems/binary-tree-maximum-path-sum/)                                       |\n| 24     | Least Common Ancestor                                   |  [LeetCode](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)                            |\n| 25     | Find the distance between two nodes of a Binary Tree    |  [GFG](https://practice.geeksforgeeks.org/problems/min-distance-between-two-given-nodes-of-a-binary-tree/1)                                                                                                                          |\n\n### Binary Search Tree\n| **ID** | **PROBLEM STATEMENT**         | **PROBLEM LINK**                                          |\n|--------|-------------------------------|-----------------------------------------------------------|\n| 1      | Insert a Node in BST          |      [LeetCode](https://leetcode.com/problems/insert-into-a-binary-search-tree/)                                    |\n| 2      | Delete a Node from BST        |                  [LeetCode](https://leetcode.com/problems/delete-node-in-a-bst/)                                                |\n| 3      | Lowest common ancestor in BST |   [LeetCode](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)                      |\n| 4      | Inorder Successor in BST      |  [LeetCode](https://practice.geeksforgeeks.org/problems/inorder-successor-in-bst/1)                             |\n| 5      | Kth Smallest node in BST       |        [LeetCode](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)                                       |\n\n### Heap and Priority Queue\n| **ID** | **PROBLEM STATEMENT**                    | **PROBLEM LINK**                              |\n|--------|------------------------------------------|-----------------------------------------------|\n| 1      | Median in a stream of integers           | [GFG](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)                             |\n| 2      | Top K Frequent Elements in an Array      |    [LeetCode](https://leetcode.com/problems/top-k-frequent-elements/)                                            |\n| 3      | Kth Largest Element in a Stream          | [LeetCode](https://leetcode.com/problems/kth-largest-element-in-a-stream/)                                    |\n| 4      | Sort a nearly sorted (or K sorted) array |         [GFG](https://www.geeksforgeeks.org/nearly-sorted-algorithm/)                                            |\n| 5      | Kth Smallest Element in a Sorted Matrix  | [LeetCode](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/)                           |\n\n\n\n## Algorithms\n\n### Binary Search\n| **ID** | **PROBLEM STATEMENT**                                    |  **PROBLEM LINK**           |\n|--------|----------------------------------------------------------|---------------------------|\n| 1     | Find First and Last Position of Element in Sorted Array              |  [LeetCode](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) |\n| 2     | Search in Rotated Sorted Array              | [LeetCode](https://leetcode.com/problems/search-in-rotated-sorted-array/) , [InterviewBit](https://www.interviewbit.com/problems/rotated-sorted-array-search/) , [GFG](https://practice.geeksforgeeks.org/problems/search-in-a-rotated-array/0)  |\n| 3     | Find Minimum in Rotated Sorted Array              | [LeetCode](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)  |\n| 4     | Pow(x,n)             | [LeetCode](https://leetcode.com/problems/powx-n/) , [InterviewBit](https://www.interviewbit.com/problems/implement-power-function/) |\n| 5    | Sqrt(n)             | [LeetCode](https://leetcode.com/problems/sqrtx/) , [InterviewBit](https://www.interviewbit.com/problems/square-root-of-integer/)   |\n| 6    | Matrix Search             | [LeetCode](https://leetcode.com/problems/search-a-2d-matrix/) , [InterviewBit](https://www.interviewbit.com/problems/matrix-search/)   |\n| 6    | Median of Two Sorted Arrays             | [LeetCode](https://leetcode.com/problems/median-of-two-sorted-arrays/) , [InterviewBit](https://www.interviewbit.com/problems/median-of-array/)   |\n\n\n## Dynamic Programming\n| **ID** | **PROBLEM STATEMENT**                                | **PROBLEM LINK**                        |\n|--------|------------------------------------------------------|-----------------------------------------|\n| 1     | Climbing Stairs                                      | [LeetCode](https://leetcode.com/problems/climbing-stairs/)                                                          |\n| 2     | Coin Sum Infinite                                    | [InterviewBit](https://www.interviewbit.com/problems/coin-sum-infinite/)                                                |\n| 3     | Min Cost Climbing Stairs                             | [LeetCode](https://leetcode.com/problems/min-cost-climbing-stairs/)                                                 |\n| 4      | Rod Cutting Problem                                  | [GFG](https://www.geeksforgeeks.org/cutting-a-rod-dp-13/)                                                      |\n| 5      | Longest Common Subsequence                           | [LeetCode](https://leetcode.com/problems/delete-operation-for-two-strings/)                                         |\n| 6      | Print Longest Common Subsequence                     | [Hackerrank](https://www.hackerrank.com/challenges/dynamic-programming-classics-the-longest-common-subsequence/problem)|\n| 7      | Longest Increasing Subsequence                       | [LeetCode](https://leetcode.com/problems/longest-increasing-subsequence/) , [InterviewBit](https://www.interviewbit.com/problems/longest-increasing-subsequence/)                                    |\n| 8     | Edit Distance                                        |   [LeetCode](https://leetcode.com/problems/edit-distance/)                                                             |\n| 9     |   Longest Common Substring                           | [LeetCode](https://leetcode.com/problems/maximum-length-of-repeated-subarray/)                                       |\n| 10     | Maximum Sum Contiguous Subarray                      | [LeetCode](https://leetcode.com/problems/maximum-subarray/)                                                          |\n| 11     | Maximum Sum without adjacent Element(House Robber)   |   [LeetCode](https://leetcode.com/problems/house-robber/)                                                              |\n| 12     | Maximum Product Subarray                             | [LeetCode](https://leetcode.com/problems/maximum-product-subarray/)                                                  |\n| 13      | Find minimum number of coins that make a given value |   [LeetCode](https://leetcode.com/problems/coin-change/)                                                               |\n| 14      | Min Cost Path                                        | [InterviewBit](https://www.interviewbit.com/problems/min-sum-path-in-matrix/ )                                           |\n| 15      | Maximal Rectangle                                    | [LeetCode](https://leetcode.com/problems/maximal-rectangle/) , [InterviewBit](https://www.interviewbit.com/problems/max-rectangle-in-binary-matrix/)                                    |\n| 16     | Minimum Jump to reach End                            |   [LeetCode](https://leetcode.com/problems/jump-game-ii/) ,      [InterviewBit](https://www.interviewbit.com/problems/min-jumps-array/)                                                   |\n| 17     | 0 - 1 Knapsack Problem                               | [GFG](https://practice.geeksforgeeks.org/problems/0-1-knapsack-problem/0)                                       |\n| 18     | Partition Equal Subset Sum                           | [LeetCode](https://leetcode.com/problems/partition-equal-subset-sum/)                                                |\n| 19     | Longest Palindromic Subsequence                      | [LeetCode](https://leetcode.com/problems/longest-palindromic-subsequence/)                                           |\n| 20      | Longest Bitonic Subsequence                          | [InterviewBit](https://www.interviewbit.com/problems/length-of-longest-subsequence/)                                     |\n| 21     | Word Break                                           |      [LeetCode](https://leetcode.com/problems/word-break/) ,              [InterviewBit](https://www.interviewbit.com/problems/word-break/)                                                        |\n| 22     | Interleaving String                                  | [LeetCode](https://leetcode.com/problems/interleaving-string/) , [InterviewBit](https://www.interviewbit.com/problems/interleaving-strings/)                                              |\n| 23     | Matrix Chain Multiplication                          | [LeetCode](https://leetcode.com/problems/burst-balloons/)                                                            |\n| 24     | Palindrome Partitioning                              | [LeetCode](https://leetcode.com/problems/palindrome-partitioning-ii/)                                                |\n\n## Graph\n| **ID** | **PROBLEM STATEMENT**                                | **PROBLEM LINK**                        |\n|--------|------------------------------------------------------|-----------------------------------------|\n| 1     | Region in Binary Matrix                                      | [InterviewBit](https://www.interviewbit.com/problems/region-in-binarymatrix/) , [GFG](https://practice.geeksforgeeks.org/problems/length-of-largest-region-of-1s-1587115620/1)                                                          |\n| 2     | Rotting Oranges                                    | [LeetCode](https://leetcode.com/problems/rotting-oranges/)  , [GFG](https://practice.geeksforgeeks.org/problems/rotten-oranges/0)                                              |\n| 3     | Number of Islands                             | [LeetCode](https://leetcode.com/problems/number-of-islands/)  , [GFG](https://practice.geeksforgeeks.org/problems/find-the-number-of-islands/1/?category[]=Graph\u0026category[]=Graph\u0026page=1\u0026query=category[]Graphpage1category[]Graph)                                               |\n| 4      | Find whether path exist                                  | [InterviewBit](https://www.interviewbit.com/problems/path-in-directed-graph/) , [GFG](https://practice.geeksforgeeks.org/problems/find-whether-path-exist5238/1/?category[]=Graph\u0026category[]=Graph\u0026page=1\u0026query=category[]Graphpage1category[]Graph)                                                      |\n| 5      | Cycle in Undirected Graph                           | [InterviewBit](https://www.interviewbit.com/problems/cycle-in-undirected-graph/) , [GFG](https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1/?category[]=Graph\u0026category[]=Graph\u0026page=1\u0026query=category[]Graphpage1category[]Graph)                                       |\n| 6      | Cycle in Directed Graph                     | [InterviewBit](https://www.interviewbit.com/problems/cycle-in-directed-graph/) , [LeetCode](https://leetcode.com/problems/course-schedule/) |\n| 7      | Topological Sort                       | [LeetCode](https://leetcode.com/problems/course-schedule-ii/)                                     |\n| 8     | Snakes and Ladders                                        |   [LeetCode](https://leetcode.com/problems/snakes-and-ladders/) , [InterviewBit](https://www.interviewbit.com/problems/snake-ladder-problem/)                                                           |\n| 9     | Alien Dictionary                                      | [GFG](https://practice.geeksforgeeks.org/problems/alien-dictionary/1/?category[]=Graph\u0026category[]=Graph\u0026page=1\u0026query=category[]Graphpage1category[]Graph)                                                          |\n| 10     | Word Search                                    | [LeetCode](https://leetcode.com/problems/word-search/)  , [InterviewBit](https://www.interviewbit.com/problems/word-search-board/)                                              |\n| 11     | Word Search 2                             | [LeetCode](https://leetcode.com/problems/word-search-ii/)  , [GFG](https://practice.geeksforgeeks.org/problems/word-boggle4143/1/?category[]=Graph\u0026category[]=Graph\u0026page=2\u0026query=category[]Graphpage2category[]Graph)                                               |\n| 12      | Word Ladder                                  | [InterviewBit](https://www.interviewbit.com/problems/word-ladder-i/) , [LeetCode](https://leetcode.com/problems/word-ladder/)                                                    |\n","funding_links":[],"categories":["Uncategorized"],"sub_categories":["Uncategorized"],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fashuray%2FInterviewRoom","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fashuray%2FInterviewRoom","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fashuray%2FInterviewRoom/lists"}