{"id":22793828,"url":"https://github.com/codewithjaspreet/dsa_interview_problems","last_synced_at":"2026-03-06T18:37:48.248Z","repository":{"id":40555566,"uuid":"447476969","full_name":"codewithjaspreet/DSA_INTERVIEW_PROBLEMS","owner":"codewithjaspreet","description":"Important Problems on Different Data Structures and Algorithms from Leetcode \u0026 Gfg , with Brute \u0026 optimised Solutions in Java Programming Language depicting solving patterns in questions \u0026 are well commented whereever neccessary with the approach as well as the time \u0026 space complexity along with self-understanding commit messages :)","archived":false,"fork":false,"pushed_at":"2023-06-26T09:03:03.000Z","size":377,"stargazers_count":13,"open_issues_count":0,"forks_count":4,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-04-18T15:08:26.669Z","etag":null,"topics":["algorithms-and-data-structures","gfg","leetcode-java"],"latest_commit_sha":null,"homepage":"https://leetcode.com/leetcodejassi/","language":"Java","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/codewithjaspreet.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2022-01-13T05:38:30.000Z","updated_at":"2025-03-31T09:28:33.000Z","dependencies_parsed_at":"2024-12-12T03:42:25.511Z","dependency_job_id":"88355970-4a65-422c-9408-ac4ba5f77c5f","html_url":"https://github.com/codewithjaspreet/DSA_INTERVIEW_PROBLEMS","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/codewithjaspreet/DSA_INTERVIEW_PROBLEMS","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codewithjaspreet%2FDSA_INTERVIEW_PROBLEMS","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codewithjaspreet%2FDSA_INTERVIEW_PROBLEMS/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codewithjaspreet%2FDSA_INTERVIEW_PROBLEMS/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codewithjaspreet%2FDSA_INTERVIEW_PROBLEMS/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/codewithjaspreet","download_url":"https://codeload.github.com/codewithjaspreet/DSA_INTERVIEW_PROBLEMS/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codewithjaspreet%2FDSA_INTERVIEW_PROBLEMS/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30191234,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-06T18:30:16.692Z","status":"ssl_error","status_checked_at":"2026-03-06T18:30:13.818Z","response_time":250,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["algorithms-and-data-structures","gfg","leetcode-java"],"created_at":"2024-12-12T03:42:15.989Z","updated_at":"2026-03-06T18:37:48.227Z","avatar_url":"https://github.com/codewithjaspreet.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Important Algorithms \u0026 Questions for different data structures βœ”οΈ\n----\n## *1. DYNAMIC PROGRAMMING* πŸ”₯\n----\n## \u003csup\u003eYou can checkout all the solutions in the DP section with Recursive , Memoization , Tabulation \u0026 Space Optimisation following the order along with their well commented Time \u0026 Space Complexities πŸ˜ŽπŸš€\u003c/sup\u003e \n| `Video Solution` | `Problem - Pattern` | `Question Link` | \n| :------------ |:---------------:| -----:| \n| [Video](https://youtu.be/tyB0ztf0DNY ) | 1-D DP | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) |\n| [Video](https://youtu.be/mLfjzJsN8us ) | 1-D DP | [Climbing Stairs](https://leetcode.com/problems/fibonacci-number/) |\n| [Video](https://youtu.be/EgG3jsGoPvQ) | 1-D DP | [Frog Jump](https://bit.ly/3t1Sjyx) |\n| [Video](https://youtu.be/Kmh3rhyEtB8) | 1-D DP | [Frog Jump-With K distance](https://www.youtube.com/redirect?event=video_description\u0026redir_token=QUFFLUhqbUxtRy1pOXU1WmpjRDhCcUJxSGlKSEkxMWthQXxBQ3Jtc0tsNUtiVUNsdFNmQlA1N3pmRGh6N1kyUk5Ic2pkRlgyZEd6SjEyRmpWWTNhalktT3VJZXYzRWZMN1pYQVFjb013VUxqN1JMTEp2UHA2WFRMZklzdTVoRnhsQlpMZkhkOW0xdVgtRGc2ZGI4c2J3MWhjMA\u0026q=https%3A%2F%2Fatcoder.jp%2Fcontests%2Fdp%2Ftasks%2Fdp_b\u0026v=Kmh3rhyEtB8) |\n| [Video](https://youtu.be/GrMBfJNk_NY) | DP on Subsequences | [Maximum Sum of Non-Adjacent Elements - House Robber](https://leetcode.com/problems/house-robber/) |\n| [Video](https://youtu.be/AE39gJYuRog) | DP on 2D-MATRIX-INTRO | [Ninja’s Training ](https://www.codingninjas.com/codestudio/problems/ninja-s-training_3621003?source=youtube\u0026campaign=striver_dp_videos\u0026utm_source=youtube\u0026utm_medium=affiliate\u0026utm_campaign=striver_dp_videos) |\n| [Video](https://youtu.be/sdE0A2Oxofw) | DP on Grids| [Grid Unique Paths](https://leetcode.com/problems/unique-paths/) |\n| [Video](https://youtu.be/TmhpgXScLyY) | DP on Grids| [Grid with Maze Obstacles](https://leetcode.com/problems/unique-paths-ii/) |\n| [Video](https://youtu.be/_rgTlyky1uQ) | DP on Grids| [Minimum Path Sum in Grid](https://leetcode.com/problems/minimum-path-sum/) |\n| [Video](https://youtu.be/SrP-PiLSYC0) | DP on Grids-Fixed Starting| [Traingle](https://leetcode.com/problems/triangle/) |\n| [Video](https://youtu.be/N_aJ5qQbYA0) | DP on Grids-Variable Starting| [Minimum/Maximum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/) |\n| [Video](https://youtu.be/fWX9xDmIzRI) | DP on Subsequences/ Subsets| [Subset Sum Equals to Target](https://www.codingninjas.com/codestudio/problems/subset-sum-equal-to-k_1550954?leftPanelTab=1) |\n| [Video](https://youtu.be/7win3dcgo3k) | DP on Subsequences/ Subsets| [ Partition Equal Subset Sum ](https://leetcode.com/problems/partition-equal-subset-sum/) |\n| [Video](https://youtu.be/GS_OqZb2CWc) | DP on Subsequences/ Subsets| [ Partition A Set Into Two Subsets With Minimum Absolute Sum Difference ](https://www.codingninjas.com/codestudio/problems/partition-a-set-into-two-subsets-such-that-the-difference-of-subset-sums-is-minimum_842494?source=youtube\u0026campaign=striver_dp_videos\u0026utm_source=youtube\u0026utm_medium=affiliate\u0026utm_campaign=striver_dp_videos/) |\n| [Video](https://youtu.be/ZHyb-A2Mte4) | DP on Subsequences/ Subsets| [ Counts Subsets with Sum K](https://www.codingninjas.com/codestudio/problems/number-of-subsets_3952532?source=youtube\u0026campaign=striver_dp_videos\u0026utm_source=youtube\u0026utm_medium=affiliate\u0026utm_campaign=striver_dp_videos\u0026leftPanelTab=1) |\n| [Video](https://youtu.be/zoilQD1kYSg) |Dp on Subsequences/ Subsets| [Count Partitions With Given Difference](https://www.codingninjas.com/codestudio/problems/partitions-with-given-difference_3751628?source=youtube\u0026campaign=striver_dp_videos\u0026utm_source=youtube\u0026utm_medium=affiliate\u0026utm_campaign=striver_dp_videos) |\n| [Video](https://youtu.be/zoilQD1kYSg) |Dp on Subsequences/ Subsets| [0/1 Knapsack](https://www.codingninjas.com/codestudio/problems/0-1-knapsack_920542?source=youtube\u0026campaign=striver_dp_videos\u0026utm_source=youtube\u0026utm_medium=affiliate\u0026utm_campaign=striver_dp_videos) |\n| [Video](https://youtu.be/myPeWb3Y68A) |Dp on Subsequences/ Subsets| [Minimum Coins - Coin Change](https://www.codingninjas.com/codestudio/problems/minimum-elements_3843091?leftPanelTab=1?source=youtube\u0026campaign=striver_dpseries\u0026utm_source=youtube\u0026utm_medium=affiliate\u0026utm_campaign=striver_dpseries) |\n| [Video](https://youtu.be/b3GD8263-PQ) |Dp on Subsequences/ Subsets| [Target Sum](https://leetcode.com/problems/target-sum/) |\n| [Video](https://youtu.be/HgyouUi11zk) |Dp on Subsequences/ Subsets| [Minimum Coins - Coin Change-2](https://leetcode.com/problems/coin-change-2/) |\n| [Video](https://youtu.be/OgvOZ6OrJoY) |Dp on Subsequences/ Subsets| [Unbounded Knapsack ](https://www.codingninjas.com/codestudio/problems/unbounded-knapsack_1215029?source=youtube\u0026campaign=striver_dp_videos\u0026utm_source=youtube\u0026utm_medium=affiliate\u0026utm_campaign=striver_dp_videos) |\n|[Video](https://youtu.be/mO8XpGoJwuo) |Dp on Strings| [Rod Cutting Problem](https://practice.geeksforgeeks.org/problems/rod-cutting0840/1) |\n|[Video](https://youtu.be/NPZn9jBrX8U) |Dp on Strings| [Longest Common Subsequence](https://www.codingninjas.com/codestudio/problems/longest-common-subsequence_624879?source=youtube\u0026campaign=striver_dp_videos\u0026utm_source=youtube\u0026utm_medium=affiliate\u0026utm_campaign=striver_dp_videos) |\n|[Video](https://youtu.be/-zI4mrF2Pb4) |Dp on Strings| [Print Longest Common Subsequence](https://www.codingninjas.com/codestudio/problems/longest-common-subsequence_624879?source=youtube\u0026campaign=striver_dp_videos\u0026utm_source=youtube\u0026utm_medium=affiliate\u0026utm_campaign=striver_dp_videos) |\n|[Video](https://youtu.be/_wP9mWNPL5w) |Dp on Strings| [Longest Common Substring ](https://practice.geeksforgeeks.org/problems/longest-common-substring1452/1) |\n|[Video](https://youtu.be/6i_T5kkfv4A) |Dp on Strings| [ Longest Palindromic Subsequence ](https://www.codingninjas.com/codestudio/problems/longest-common-subsequence_624879?source=youtube\u0026campaign=striver_dp_videos\u0026utm_source=youtube\u0026utm_medium=affiliate\u0026utm_campaign=striver_dp_videos) |\n|[Video](https://youtu.be/xPBLEj41rFU) |Dp on Strings| [ Minimum Insertions to Make String Palindrome ](https://www.codingninjas.com/codestudio/problems/minimum-insertions-to-make-palindrome_985293?source=youtube\u0026campaign=striver_dp_videos\u0026utm_source=youtube\u0026utm_medium=affiliate\u0026utm_campaign=striver_dp_videos) |\n|[Video](https://youtu.be/yMnH0jrir0Q) |Dp on Strings| [ Minimum Insertions/Deletions to Convert String A to String B ](https://leetcode.com/problems/delete-operation-for-two-strings/) |\n|[Video](https://youtu.be/xElxAuBcvsU) |Dp on Strings| [ Shortest Common Supersequence ](https://leetcode.com/problems/shortest-common-supersequence/) |\n\n\n----\n\n## *2. Binary Trees \u0026 Binary Search Trees* πŸ”₯\n| `Video Solution` | `Problem Name` | `Question Link` |\n| :------------ |:---------------:| -----:| \n|[Video](https://youtu.be/hyLyW7rP24I) |Representation In Java| [Binary Tree Representation in Java](https://www.geeksforgeeks.org/binary-tree-set-1-introduction/) |\n|[Video](https://youtu.be/RlUu72JrOCQ) |Recursive - Pre -Order Traversal| [Preorder Traversal of Binary Tree ](https://leetcode.com/problems/binary-tree-preorder-traversal/) |\n|[Video](https://youtu.be/Z_NEgBgbRVI) |Recursive - In -Order Traversal| [ Inorder Traversal of Binary Tree](https://leetcode.com/problems/binary-tree-inorder-traversal/) |\n|[Video](https://youtu.be/COQOU6klsBg) |Recursive - Post-Order Traversal| [ Postorder Traversal of Binary Tree](https://leetcode.com/problems/binary-tree-postorder-traversal/) |\n|[Video](https://youtu.be/EoAsWbO7sqg) |Level Order - Traversal - Queue Data Structure| [ Level Order Traversal of Binary Tree](https://leetcode.com/problems/binary-tree-level-order-traversal/) |\n\n----\n\n## *3. GRAPHS* πŸ”₯\n| `Video Solution` | `Problem Name` | `Question Link` |\n| :------------ |:---------------:| -----:| \n|[Video](https://youtu.be/M3_pLsDdeuU) |Introduction to Graph - Different Conventions Used||\n|[Video](https://youtu.be/OsNklbh9gYI) |Representation in JAVA ||\n\n\n---\n\n\n## *3. Basic Maths* πŸ”₯\n| `Problem Name` | `Question Link` |\n |:---------------:| -----:| \n |Count Digits| [Count Digits](https://practice.geeksforgeeks.org/problems/count-digits5716/1)|\n |Reverse A Integer|[Reverse Integer](https://leetcode.com/problems/reverse-integer/)|\n \n---\n\n## *4. Sliding Window* πŸ”₯\n| `Problem Name` | `Question Link` |\n |:---------------:| -----:| \n |Max Sum Subarray of size K| [Max Sum Subarray of size K](https://practice.geeksforgeeks.org/problems/max-sum-subarray-of-size-k5313/1)|\n\n---\n\n\n## *5. Stacks* πŸ”₯\n| `Problem Name` | `Question Link` |\n |:---------------:| -----:| \n |Stack Implementation using Arrays| [Implementation](https://practice.geeksforgeeks.org/problems/implement-stack-using-array/1?utm_source=youtube\u0026utm_medium=collab_striver_ytdescription\u0026utm_campaign=implement-stack-using-array)|\n |Stack Implementation using LinkedList| [Implementation](https://practice.geeksforgeeks.org/problems/implement-stack-using-linked-list/1?utm_source=youtube\u0026utm_medium=collab_striver_ytdescription\u0026utm_campaign=implement-stack-using-linked-list ) |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodewithjaspreet%2Fdsa_interview_problems","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcodewithjaspreet%2Fdsa_interview_problems","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodewithjaspreet%2Fdsa_interview_problems/lists"}