{"id":19787120,"url":"https://github.com/sahilbansal17/coding-interview-problems","last_synced_at":"2025-10-27T18:04:17.441Z","repository":{"id":56359224,"uuid":"218319793","full_name":"sahilbansal17/Coding-Interview-Problems","owner":"sahilbansal17","description":"This repository contains the coding interview problems along with solutions.","archived":false,"fork":false,"pushed_at":"2022-12-31T16:55:45.000Z","size":433,"stargazers_count":54,"open_issues_count":1,"forks_count":11,"subscribers_count":3,"default_branch":"master","last_synced_at":"2023-03-04T22:57:26.460Z","etag":null,"topics":["algorithms","coding-challenges","coding-interviews","data-structures","interview-questions"],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sahilbansal17.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2019-10-29T15:25:48.000Z","updated_at":"2022-12-31T16:55:50.000Z","dependencies_parsed_at":"2023-01-31T19:31:03.373Z","dependency_job_id":null,"html_url":"https://github.com/sahilbansal17/Coding-Interview-Problems","commit_stats":null,"previous_names":[],"tags_count":null,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilbansal17%2FCoding-Interview-Problems","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilbansal17%2FCoding-Interview-Problems/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilbansal17%2FCoding-Interview-Problems/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilbansal17%2FCoding-Interview-Problems/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sahilbansal17","download_url":"https://codeload.github.com/sahilbansal17/Coding-Interview-Problems/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":224227177,"owners_count":17276755,"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":["algorithms","coding-challenges","coding-interviews","data-structures","interview-questions"],"created_at":"2024-11-12T06:21:11.132Z","updated_at":"2025-10-27T18:04:12.410Z","avatar_url":"https://github.com/sahilbansal17.png","language":"C++","readme":"# Coding-Interview-Problems\nThis repository contains the coding interview problems along with solutions.\n\n| Problem       | Solution | Code | Category | Difficulty |\n|---------------|----------|------|----------|------------|\n| [Island Count](Island%20Count) | | [CPP](Island%20Count/solution.cpp) | Graph Traversal | Medium |\n| [Minimum Falling Path Sum](Minimum%20Falling%20Path%20Sum) | [text](Minimum%20Falling%20Path%20Sum/solution.txt) | [CPP](Minimum%20Falling%20Path%20Sum/solution.cpp) | Dynamic Programming | Medium |\n| [Word Break](Word%20Break) | [text](Word%20Break/solution.txt) | [CPP](Word%20Break/solution.cpp) | Dynamic Programming | Medium |\n| [Remove K Digits](Remove%20K%20Digits) | [text](Remove%20K%20Digits/solution.txt) | [CPP](Remove%20K%20Digits/solution.cpp) | Greedy, Stack | Medium |\n| [Binary Search Tree Checker](BST%20Checker) | To be updated | [CPP](BST%20Checker/solution.cpp) | Trees | Medium |\n| [Delete node in singly-linked list](Linked%20List/Delete%20Node/) | [text](Linked%20List/Delete%20Node/solution.txt) | [CPP](Linked%20List/Delete%20Node/solution.cpp) | Linked-List | Easy, Tricky |\n| [Minimize The Absolute Difference](Minimize%20The%20Absolute%20Difference/) | [text](Minimize%20The%20Absolute%20Difference/solution.txt) | [CPP](Minimize%20The%20Absolute%20Difference/solution.cpp) | Two Pointers | Easy |\n| [Majority Element](Majority%20Element/) | [text](Majority%20Element/solution.txt) | [CPP](Majority%20Element/solution.cpp) | Hashing, Trick | Easy, Tricky |\n| [Count Numbers Less Than K](Count%20Numbers%20Less%20Than%20K/) | [text](Count%20Numbers%20Less%20Than%20K/solution.txt) | [CPP](Count%20Numbers%20Less%20Than%20K/solution.cpp) | Mathematics | Easy-Medium |\n| [Remove Zero Sum Consecutive Nodes](Linked%20List/Remove%20Zero%20Sum%20Consecutive%20Nodes/) | [text](Linked%20List/Remove%20Zero%20Sum%20Consecutive%20Nodes/solution.txt) | [CPP](Linked%20List/Remove%20Zero%20Sum%20Consecutive%20Nodes/solution.cpp) | Linked Lists | Medium |\n| [Ways To Form Max Heap](Ways%20To%20Form%20Max%20Heap/) | [text](Ways%20To%20Form%20Max%20Heap/solution.txt) | [CPP](Ways%20To%20Form%20Max%20Heap/solution.cpp) | Heap, Mathematics | Medium-Hard |\n| [Find K Closest Elements](Find%20K%20Closest%20Elements/) | text | [CPP](Find%20K%20Closest%20Elements/solution.cpp) | MISC | Easy |\n| [Populating Next Right Pointers](Populating%20Next%20Right%20Pointers/) | text | [CPP](Populating%20Next%20Right%20Pointers/solution.cpp) | Trees | Medium |\n| [Gas Station](Gas%20Station/) | [text](Gas%20Station/solution.txt) | [CPP](Gas%20Station/solution.cpp) | Greedy Algorithm | Medium |\n| [Set Matrix Zeroes](Set%20Matrix%20Zeroes/) | [text](Set%20Matrix%20Zeroes/solution.txt) | [CPP](Set%20Matrix%20Zeroes/solution_constant_space.cpp) | Matrix Manipulation | Easy, Tricky |\n| [Diameter of Generic Tree](Diameter%20of%20Generic%20Tree) | text | [CPP](Diameter%20of%20Generic%20Tree/solution.cpp) | Trees, Graphs | Medium |\n| [2 Keys Keyboard](2%20Keys%20Keyboard) | [text](2%20Keys%20Keyboard/solution.txt) | [CPP](2%20Keys%20Keyboard/solution.cpp) | DP, Maths | Medium |\n| [Very Hard Queries](Very%20Hard%20Queries) | [Solution article](Very%20Hard%20Queries/solution.md) | [CPP](Very%20Hard%20Queries/solution.cpp) | Queries, Maths | Medium |\n| [Deterministic Finite Automaton](Deterministic%20Finite%20Automaton/) | [Solution article](Deterministic%20Finite%20Automaton/solution.md) | [CPP](Deterministic%20Finite%20Automaton/solution.cpp) | Recursion, Dynamic Programming | Medium |\n| [Maximum Selling Gap](Maximum%20Selling%20Gap) | [Solution article](Maximum%20Selling%20Gap/solution.md) | [CPP](Maximum%20Selling%20Gap/solution.cpp) | Arrays | Medium |\n| [Game of Life](Game%20of%20Life) | - | [CPP](Game%20of%20Life/solution.cpp) | Arrays | Medium |\n| [3 Sum](3%20Sum) | [Article](3%20Sum/README.md) | [CPP](3%20Sum/solution.cpp) | Two Pointers | Medium |\n| [Shift Linked List](Linked%20List/Shift%20Linked%20List) | [Scratchpad](Linked%20List/Shift%20Linked%20List/scratchpad.txt) | [CPP](Linked%20List/Shift%20Linked%20List/solution.cpp) | Linked List | Easy, Medium |\n| [Unique Paths III](Unique%20Paths%20III) | [Article](https://leetcode.com/problems/unique-paths-iii/solutions/2976056/backtracking-solution-in-c/) | [CPP](Unique%20Paths%20III/solution.cpp) | Backtracking | Medium |\n| [Get Set Queries](Get%20Set%20Queries) | - | [CPP](Get%20Set%20Queries/solution.cpp) | Ordered Sets | Medium |\n\n# CS Fundamentals\n\n1. [DBMS Glossary](CS%20Fundamentals/DBMS.txt)\n2. [Object Oriented Programming Glossary](CS%20Fundamentals/OOPs.txt)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsahilbansal17%2Fcoding-interview-problems","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsahilbansal17%2Fcoding-interview-problems","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsahilbansal17%2Fcoding-interview-problems/lists"}