{"id":21086500,"url":"https://github.com/surajv311/myprogramming_interview-prep","last_synced_at":"2026-03-09T00:34:11.357Z","repository":{"id":189126676,"uuid":"283971581","full_name":"Surajv311/myProgramming_Interview-Prep","owner":"Surajv311","description":"A list of coding questions I solved (DS-Algo \u0026 CP) 👨‍💻 to enhance my algorithmic thinking skills. Also includes: Notes ✍ | Resources | Core-CS Subjects 📚 | Off-Campus... 🌏","archived":false,"fork":false,"pushed_at":"2026-01-23T07:51:57.000Z","size":105880,"stargazers_count":6,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-01-24T00:45:26.787Z","etag":null,"topics":["algorithms","amazon","codechef","codeforces","competitive-programming","cplusplus","cpp","data-structures","data-structures-and-algorithms","dynamic-programming","faang","google","graph-algorithms","hacktoberfest","interview","interview-practice","interview-questions","leetcode-solutions","microsoft","placement-preparation"],"latest_commit_sha":null,"homepage":"","language":"C++","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/Surajv311.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,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2020-07-31T07:27:40.000Z","updated_at":"2026-01-23T07:52:01.000Z","dependencies_parsed_at":"2024-05-31T20:16:46.172Z","dependency_job_id":null,"html_url":"https://github.com/Surajv311/myProgramming_Interview-Prep","commit_stats":null,"previous_names":["surajv311/myprogramming_interview-prep"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Surajv311/myProgramming_Interview-Prep","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Surajv311%2FmyProgramming_Interview-Prep","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Surajv311%2FmyProgramming_Interview-Prep/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Surajv311%2FmyProgramming_Interview-Prep/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Surajv311%2FmyProgramming_Interview-Prep/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Surajv311","download_url":"https://codeload.github.com/Surajv311/myProgramming_Interview-Prep/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Surajv311%2FmyProgramming_Interview-Prep/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30278558,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-08T20:45:49.896Z","status":"ssl_error","status_checked_at":"2026-03-08T20:45:49.525Z","response_time":56,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: 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","amazon","codechef","codeforces","competitive-programming","cplusplus","cpp","data-structures","data-structures-and-algorithms","dynamic-programming","faang","google","graph-algorithms","hacktoberfest","interview","interview-practice","interview-questions","leetcode-solutions","microsoft","placement-preparation"],"created_at":"2024-11-19T20:45:03.887Z","updated_at":"2026-03-09T00:34:11.336Z","avatar_url":"https://github.com/Surajv311.png","language":"C++","readme":"\n\n \n\n# myProgramming 👨‍💻\n\n**DS-Algo, CP Questions | CS-Core subjects | Notes | Practice | Resources to improve...! 🚀**\n\n\u003cbr\u003e\n\nThis repository hosts a list of DS-Algo Questions that I've solved, CS-Core Questions and resources that I have been following, \nand the handwritten notes I made; To improve my thinking skills to crack the opportunities that come in my way. \n\n`In progress: Since Nov 2020 - present.` \n\n## `Table of contents`:\n\n- [Coding Noob 🐣](#noob)\n- [Time to go Pro 🚀](#pro_noob)\n- [My_Handwritten-notes](#notes)\n- [DS-Algo-Questions](#ds-algo-qs)\n- [Author](#author)\n\n----------------------------------\n----------------------------------\n\n### Noob \n\n1. Written beginner level codes in Py/Java/C/C++ to get an experience of every language. \n\n\u003e [Codes in C](https://github.com/Surajv311/myProgramming/tree/master/Warmup-Prerequisites/CODES%20IN%20C) **|** [Codes in Cpp](https://github.com/Surajv311/myProgramming/tree/master/Warmup-Prerequisites/CODES%20IN%20CPP) **|** [Codes in Java](https://github.com/Surajv311/myProgramming/tree/master/Warmup-Prerequisites/CODES%20IN%20JAVA) **|** [Codes in Python](https://github.com/Surajv311/myProgramming/tree/master/Warmup-Prerequisites/CODES%20IN%20PY/LEARNING_BASICS).\n\n2. Learned [Git/Github](https://github.com/Surajv311/myProgramming/tree/master/Warmup-Prerequisites/LEARNING___git-github).\n\n3. Finally decided to go with **C++ (cpp)**.\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ Back To Top\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n-------------------------------------\n\n### Pro_Noob \n\nA compiled list of resources that I have been following and questions that I have been practising:\n\n#### Competitive Coding\n- [Questions upsolved](https://github.com/Surajv311/myProgramming/tree/master/Coding/COMPETITIVE%20PROGRAMMING/CP-Qs_-UPSOLVED)\n- [MY CP template](https://github.com/Surajv311/myProgramming/tree/master/Coding/COMPETITIVE%20PROGRAMMING/MY-CP-TEMPLATE)\n\n#### Practised \u0026 Learned from Internet\n\n\u003e [GFG](https://github.com/Surajv311/myProgramming/tree/master/Coding/PRACTICE-and-LEARNED/GFG) **|** [Hackerrank](https://github.com/Surajv311/myProgramming/tree/master/Coding/PRACTICE-and-LEARNED/HACKERRANK) **|** [Leetcode](https://github.com/Surajv311/myProgramming/tree/master/Coding/PRACTICE-and-LEARNED/LEETCODE) **|** [Youtube University](https://github.com/Surajv311/myProgramming/tree/master/Coding/PRACTICE-and-LEARNED/YOUTUBE_UNIVERSITY_XD) **|** [Misc](https://github.com/Surajv311/myProgramming/tree/master/Coding/PRACTICE-and-LEARNED/others)\n\n#### Internship \u0026 Placements specific preparation (that I've done)\n- [CS Core Subjects](https://github.com/Surajv311/myProgramming/tree/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/CS-CORE_SUBJECTS): \n[DBMS](https://github.com/Surajv311/myProgramming/tree/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/CS-CORE_SUBJECTS/dbms), \n[Networks](https://github.com/Surajv311/myProgramming/tree/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/CS-CORE_SUBJECTS/networks), \n[OOPS](https://github.com/Surajv311/myProgramming/tree/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/CS-CORE_SUBJECTS/oops), \n[OS](https://github.com/Surajv311/myProgramming/tree/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/CS-CORE_SUBJECTS/os)\n- [Subjective Questions](https://github.com/Surajv311/myProgramming/tree/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/SUBJECTIVE%20Qs%20%26%20PUZZLES/SUBJECTIVE%20Qs)\n- [Puzzles](https://github.com/Surajv311/myProgramming/tree/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/SUBJECTIVE%20Qs%20%26%20PUZZLES/PUZZLES)\n- [System Design](https://github.com/Surajv311/myProgramming/tree/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/%5BIGNORE%5D_SYSTEM-DESIGN)\n- [DS-Algo](https://github.com/Surajv311/myProgramming/tree/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D)\n(Check the table at bottom for DS Algo Qs. solved)\n\n#### Others\n- [Learned something unique](https://github.com/Surajv311/myProgramming/tree/master/Coding/OTHERS/LEARNED-SOMETHING-UNIQUE)\n- [Off-campus info.](https://github.com/Surajv311/myProgramming/tree/master/Coding/OTHERS/offcampus)\n- [Competitive Coding Resources](https://github.com/Surajv311/myProgramming/tree/master/Coding/OTHERS/RESOURCES/COMPETITIVE_PROGRAMMING)\n- [CS-Core Must Do Questions](https://github.com/Surajv311/myProgramming/tree/master/Coding/OTHERS/RESOURCES/COMPETITIVE_PROGRAMMING)\n- [DS-Algo Must Do Questions](https://github.com/Surajv311/myProgramming/tree/master/Coding/OTHERS/RESOURCES/DS-ALGO)\n- [Other resources](https://github.com/Surajv311/myProgramming/tree/master/Coding/OTHERS/RESOURCES/others)\n- [Misc](https://github.com/Surajv311/myProgramming/tree/master/Coding/OTHERS/MISC)\n- [Memory Dump of interesting tech stuff](https://github.com/Surajv311/mDumpSWE)\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ Back To Top\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n-------------------------------------\n\n### Notes\n\nLink to my `handwritten notes` (updated occasionally): \n\n\u003e Drive link: [link](https://drive.google.com/drive/folders/1DCXUvS2_-5aqUsNPJO7Wf8INegCi4Yi4?usp=sharing) (**or**) Github repo link: [link](https://github.com/Surajv311/myCS-NOTES)\n\n(both links host the same notes) \n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ Back To Top\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n------------------------------------\n\n### DS-Algo-Qs\n\n- This section consists of a list of DS-Algo Questions that I have practised for internships/placements: \u003cbr\u003e\n- These questions can be accessed via this path: \u003cbr\u003e\n`myProgramming/Coding/[IMP] INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_[SOLVED]/` .\u003cbr\u003e \n([Link](https://github.com/Surajv311/myProgramming/tree/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D))\u003cbr\u003e\n- **Note**: The main ans logic of the question is coded \u0026 just pasted in main function, than creating a separate function...!.\n\n\u003cbr\u003e\n\n#### Contents:\n\n- [Basics](#basics)\n- [Arrays](#arrays) \n- [String](#string)\n- [Linked List](#linkedlist)\n- [Stack and Queue](#stack_queue)\n- [Trees (BT and BST)](#trees)\n- [Heap](#heap)\n- [Recursion](#recursion)\n- [Hashing](#hashing)\n- [Graph](#graph)\n- [Greedy](#greedy)\n- [Dynamic Programming](#dp)\n- [Backtracking](#backtracking)\n- [Bit Magic](#bit_magic)\n- [Sorting Algos](#sorting_algos)\n- [Misc (Others)](#misc)\n\n\u003cbr\u003e\n\n#### Basics\n\n| Data Structure | Code |\n| ------------- | ------------- |\n| Graph | [Check](https://github.com/Surajv311/myProgramming_Interview-Prep/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/basics/graph.cpp) |\n| Linkedlist | [Check](https://github.com/Surajv311/myProgramming_Interview-Prep/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/basics/linkedlist.cpp) |\n| Tree | [Check](https://github.com/Surajv311/myProgramming_Interview-Prep/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/basics/tree.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### Arrays\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| Two numbers with sum closest to 0 | [Visit](https://practice.geeksforgeeks.org/problems/two-numbers-with-sum-closest-to-zero1737/1#:~:text=Two%20numbers%20with%20sum%20closest%20to%20zero.%20Given,is%20-68%20using%20numbers%20-60%20and%20-8.%20) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/2%20num.%20sum%20closest%20to%200.cpp) |\n| Convert array to zig-zag fashion | [Visit](https://practice.geeksforgeeks.org/problems/convert-array-into-zig-zag-fashion1638/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/array%20to%20zigzag%20fashion.cpp) |\n| Boolean Matrix | [Visit](https://practice.geeksforgeeks.org/problems/boolean-matrix-problem-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/boolean%20matrix.cpp) |\n| Chocolate Distribution Problem | [Visit](https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem3825/1#:~:text=%20Chocolate%20Distribution%20Problem%20%201%20Each%20student,number%20of%20chocolates%20given%20to%20a...%20More%20) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/chocolate%20distribution%20problem.cpp) |\n| Consecutive 1's not allowed | [Visit](https://practice.geeksforgeeks.org/problems/consecutive-1s-not-allowed1912/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/consecutive%201s%20not%20allowed.cpp) |\n| Contiguous Subarray with given sum | [Visit](https://practice.geeksforgeeks.org/problems/subarray-with-given-sum-1587115621/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/contiguous%20subarray%20with%20sum.cpp) |\n| Count Inversions | [Visit](https://practice.geeksforgeeks.org/problems/inversion-of-array-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/count%20inversions.cpp) |\n| Count the triplets | [Visit](https://www.geeksforgeeks.org/count-triplets-such-that-sum-of-any-two-number-is-equal-to-third-set-2/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/count%20the%20triplets.cpp) |\n| Element with left side smaller and right side greater | [Visit](https://practice.geeksforgeeks.org/problems/unsorted-array4925/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/element%20left%20side%20smaller%20right%20greater.cpp) |\n| Equilibrium Point | [Visit](https://practice.geeksforgeeks.org/problems/equilibrium-point-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/equilibrium%20point.cpp) |\n| Find Missing And Repeating | [Visit](https://practice.geeksforgeeks.org/problems/find-missing-and-repeating2512/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/find%20missing%20%26%20repeating.cpp) |\n| Kadane's Algorithm | [Visit](https://practice.geeksforgeeks.org/problems/kadanes-algorithm-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/kadane%20algo.cpp) |\n| Kth smallest element | [Visit](https://practice.geeksforgeeks.org/problems/kth-smallest-element5635/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/kth%20smallest%20element.cpp) |\n| Largest Number formed from an Array | [Visit](https://practice.geeksforgeeks.org/problems/largest-number-formed-from-an-array1117/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/largest%20number%20formed%20from%20array.cpp) |\n| Last index of One | [Visit](https://practice.geeksforgeeks.org/problems/last-index-of-15847/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/last%20index%20of%201.cpp) |\n| Leaders in an array | [Visit](https://practice.geeksforgeeks.org/problems/leaders-in-an-array-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/leaders%20in%20array.cpp) |\n| Majority Element | [Visit](https://practice.geeksforgeeks.org/problems/majority-element-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/majority%20element.cpp) |\n| Maximum Index | [Visit](https://practice.geeksforgeeks.org/problems/maximum-index-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/maximum%20index.cpp) |\n| Merge Without Extra Space | [Visit](https://practice.geeksforgeeks.org/problems/merge-two-sorted-arrays-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/merge%20without%20extra%20space.cpp) |\n| Minimum Platforms | [Visit](https://practice.geeksforgeeks.org/problems/minimum-platforms-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/minimum%20platforms.cpp) |\n| Missing number in array | [Visit](https://practice.geeksforgeeks.org/problems/missing-number-in-array1416/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/missing%20number.cpp) |\n| Nuts and Bolts Problem | [Visit](https://practice.geeksforgeeks.org/problems/nuts-and-bolts-problem0431/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/nuts%20and%20bolts%20problem.cpp) |\n| Pythagorean Triplet | [Visit](https://practice.geeksforgeeks.org/problems/pythagorean-triplet3018/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/pythagorean%20triplet.cpp) |\n| Rearrange Array Alternately | [Visit](https://practice.geeksforgeeks.org/problems/-rearrange-array-alternately-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/rearrange%20array%20alternatively.cpp) |\n| Smallest Positive missing number | [Visit](https://practice.geeksforgeeks.org/problems/smallest-positive-missing-number/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/smallest%20positive%20missing%20num..cpp) |\n| Reverse array in groups | [Visit](https://practice.geeksforgeeks.org/problems/reverse-array-in-groups0255/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/reverse%20array%20in%20gps..cpp) |\n| Sort an array of 0s, 1s and 2s | [Visit](https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s4231/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/sort%20array%20of%200%201%202.cpp) |\n| Spirally traversing a matrix | [Visit](https://practice.geeksforgeeks.org/problems/spirally-traversing-a-matrix-1587115621/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/spirally%20traverse%20a%20matrix.cpp) |\n| Stock buy and sell | [Visit](https://practice.geeksforgeeks.org/problems/stock-buy-and-sell-1587115621/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/stock%20buy%20sell.cpp) |\n| Trapping Rain Water | [Visit](https://practice.geeksforgeeks.org/problems/trapping-rain-water-1587115621/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/trapping%20rainwater.cpp) |\n| Find All Four Sum Numbers | [Visit](https://practice.geeksforgeeks.org/problems/find-all-four-sum-numbers1732/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/others/4%20sum%20numbers.cpp) |\n| Find the Duplicate Number | [Visit](https://leetcode.com/problems/find-the-duplicate-number/description/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/others/find%20the%20duplicate%20number.cpp) |\n| Fractional Knapsack | [Visit](https://practice.geeksforgeeks.org/problems/fractional-knapsack-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/others/fractional%20knapsack.cpp) |\n| Max Consecutive Ones | [Visit](https://leetcode.com/problems/max-consecutive-ones/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/others/max%20consecutive%20ones.cpp) |\n| Merge Intervals | [Visit](https://leetcode.com/problems/merge-intervals/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/others/merge%20intervals.cpp) |\n| Next Permutation | [Visit](https://leetcode.com/problems/next-permutation/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/others/next%20permutation.cpp) |\n| Count all possible paths from top left to bottom right | [Visit](https://practice.geeksforgeeks.org/problems/count-all-possible-paths-from-top-left-to-bottom-right3011/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/others/possible%20paths%20in%20a%20matrix.cpp) |\n| Remove Duplicates from Sorted Array | [Visit](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/others/remove%20duplicates%20from%20sorted%20array.cpp) |\n| Reverse Pairs | [Visit](https://leetcode.com/problems/reverse-pairs/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/others/reverse%20pairs.cpp) |\n| Rotate Image | [Visit](https://leetcode.com/problems/rotate-image/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/arrays/others/rotate%20image%20_arr.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### String\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| Check if string is rotated by two places | [Visit](https://practice.geeksforgeeks.org/problems/check-if-string-is-rotated-by-two-places-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/string/check%20if%20string%20rotated%20by%202%20places.cpp) |\n| Longest Palindrome in a String | [Visit](https://practice.geeksforgeeks.org/problems/longest-palindrome-in-a-string1956/1/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/string/longest%20palindromic%20substring.cpp) |\n| Smallest window in a string containing all the characters of another string | [Visit](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string-1587115621/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/string/minimum%20window%20substr....cpp) |\n| Permutations of a given string | [Visit](https://practice.geeksforgeeks.org/problems/permutations-of-a-given-string2041/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/string/permutations%20of%20a%20string.cpp) |\n| Remove All Adjacent Duplicates In String | [Visit](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/string/remove%20adjacent%20duplicates%20in%20a%20string.cpp) |\n| Remove Duplicates | [Visit](https://practice.geeksforgeeks.org/problems/remove-duplicates3034/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/string/remove%20duplicates%2C%20keep%201st%20occurrence.cpp) |\n| Reverse words in a given string | [Visit](https://practice.geeksforgeeks.org/problems/reverse-words-in-a-given-string5459/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/string/reverse%20words%20in%20a%20string.cpp) |\n| Longest Substring Without Repeating Characters | [Visit](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/string/substr.%20without%20repeating%20chars.cpp) |\n| Anagram | [Visit](https://practice.geeksforgeeks.org/problems/anagram-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/string/other/anagram.cpp) |\n| Longest Prefix Suffix - KMP Algo | [Visit](https://practice.geeksforgeeks.org/problems/longest-prefix-suffix2527/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/string/other/kmp%20algo__%20longest%20prefix%20suffix.cpp) |\n| Implement strstr \u0026 Rabin Karp Algo | [Visit](https://practice.geeksforgeeks.org/problems/implement-strstr/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/string/other/rabin%20carp..._implement%20strstr....cpp) |\n| Roman Number to Integer | [Visit](https://practice.geeksforgeeks.org/problems/roman-number-to-integer3201/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/string/other/roman%20num.%20to%20int.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### LinkedList\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| Construct a Linkedlist | [Visit](https://www.geeksforgeeks.org/data-structures/linked-list/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/CONSTRUCT%20A%20LINKEDLIST....cpp) |\n| Implement Queue using Linked List | [Visit](https://practice.geeksforgeeks.org/problems/implement-queue-using-linked-list/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/implement%20queue%20using%20ll.cpp) |\n| Implement Stack using Linked List | [Visit](https://practice.geeksforgeeks.org/problems/implement-stack-using-linked-list/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/implement%20stack%20using%20ll.cpp) |\n| Finding middle element in a linked list | [Visit](https://practice.geeksforgeeks.org/problems/finding-middle-element-in-a-linked-list/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/middle%20element%20of%20ll.cpp) |\n| Pairwise swap elements of a linked list | [Visit](https://practice.geeksforgeeks.org/problems/pairwise-swap-elements-of-a-linked-list-by-swapping-data/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/pairwise%20swap%20ll%20elements.cpp) |\n| Remove loop in Linked List | [Visit](https://practice.geeksforgeeks.org/problems/remove-loop-in-linked-list/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/remove%20loop%20in%20ll.cpp) |\n| Reverse a linked list | [Visit](https://practice.geeksforgeeks.org/problems/reverse-a-linked-list/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/reverse%20a%20ll.cpp) |\n| Rotate a Linked List | [Visit](https://practice.geeksforgeeks.org/problems/rotate-a-linked-list/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/rotate%20a%20ll.cpp) |\n| Sort a linked list of 0s, 1s and 2s | [Visit](https://practice.geeksforgeeks.org/problems/given-a-linked-list-of-0s-1s-and-2s-sort-it/1/?category[]=Linked%20List\u0026category[]=Linked%20List\u0026company[]=Amazon\u0026company[]=Amazon\u0026page=1\u0026query=category[]Linked%20Listcompany[]Amazonpage1company[]Amazoncategory[]Linked%20List) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/sort%20ll%20of%201s-2s-3s.cpp) |\n| Check if the linked list has loop or not (Floyd's Algorithm) | [Visit](https://www.geeksforgeeks.org/detect-loop-in-a-linked-list/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/other/Floyd%20Algo-%20loop%20in%20linkedlist.cpp) |\n| Add two numbers represented by linked lists | [Visit](https://practice.geeksforgeeks.org/problems/add-two-numbers-represented-by-linked-lists/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/other/add%202%20nums.%20in%20linkedlist.cpp) |\n| Check if Linked List is Palindrome | [Visit](https://practice.geeksforgeeks.org/problems/check-if-linked-list-is-pallindrome/1#) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/other/check%20if%20ll%20palindrome.cpp) |\n| Flattening a Linked List | [Visit](https://practice.geeksforgeeks.org/problems/flattening-a-linked-list/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/other/flatten%20a%20ll.cpp) |\n| Nth node from end of linked list | [Visit](https://practice.geeksforgeeks.org/problems/nth-node-from-end-of-linked-list/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/other/get-remove%20nth%20node%20from%20end%20in%20ll.cpp) |\n| Insert and delete from doubly linkedlist | [Visit](https://www.geeksforgeeks.org/doubly-linked-list/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/other/insert-del%20from%20doubly%20%26%20singly%20ll.cpp) |\n| Intersection point of two linked lists | [Visit](https://www.geeksforgeeks.org/write-a-function-to-get-the-intersection-point-of-two-linked-lists/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/other/intersection%20point%20of%202%20ll.cpp) |\n| Linked List Cycle II | [Visit](https://leetcode.com/problems/linked-list-cycle-ii/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/other/ll%20cycle%20_%202_floyd%20algo.cpp) |\n| Merge two sorted linked lists | [Visit](https://practice.geeksforgeeks.org/problems/merge-two-sorted-linked-lists/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/other/merge%202%20sorted%20ll.cpp) |\n| Reverse a Linked List in groups of given size | [Visit](https://practice.geeksforgeeks.org/problems/reverse-a-linked-list-in-groups-of-given-size/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/linkedlist/other/reverse%20k%20nodes.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### Stack_Queue\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| First non-repeating character in a stream | [Visit](https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream1216/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/first%20non%20repeating%20char%20in%20stream.cpp) |\n| Gas Station (Circular Tour) | [Visit](https://leetcode.com/problems/gas-station/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/gas%20station-%20circular%20tour.cpp) |\n| Get minimum element from stack | [Visit](https://practice.geeksforgeeks.org/problems/get-minimum-element-from-stack/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/min%20element%20from%20stack.cpp) |\n| Largest Rectangular Area in a Histogram | [Visit](https://practice.geeksforgeeks.org/problems/maximum-rectangular-area-in-a-histogram-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/other/largest%20rectangular%20area%20in%20histogram.cpp) |\n| LRU Cache | [Visit](https://leetcode.com/problems/lru-cache/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/other/lru_cache.cpp) |\n| Maximum of all subarrays of size k | [Visit](https://practice.geeksforgeeks.org/problems/maximum-of-all-subarrays-of-size-k3101/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/other/max%20all%20subarrays%2C%20k%20size.cpp) |\n| Given a binary matrix, find the maximum size rectangle binary-sub-matrix with all 1’s | [Visit](https://practice.geeksforgeeks.org/problems/max-rectangle/1#:~:text=Your%20task%20is%20to%20complete%20the%20function%20maxArea,which%20denotes%20the%20size%20of%20the%20matrix%20M.) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/other/max%20rectangle%20area%20in%20binary%20matrix.cpp) |\n| Special Stack | [Visit](https://practice.geeksforgeeks.org/problems/special-stack/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/other/min%20%2C%20special%20stack....cpp) |\n| Next Greater Element | [Visit](https://practice.geeksforgeeks.org/problems/next-larger-element-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/other/next%20greater%20element.cpp) |\n| Next Greater Element (Right) | [Visit](https://practice.geeksforgeeks.org/problems/next-larger-element-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/other/ngr.cpp) |\n| Parenthesis Checker | [Visit](https://practice.geeksforgeeks.org/problems/parenthesis-checker2744/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/other/parenthesis%20checker.cpp) |\n| Queue using two Stacks | [Visit](https://practice.geeksforgeeks.org/problems/queue-using-two-stacks/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/other/queue%20using%20stack.cpp) |\n| Rotten Oranges | [Visit](https://practice.geeksforgeeks.org/problems/rotten-oranges2536/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/other/rotten%20oranges.cpp) |\n| Stack using two queues | [Visit](https://practice.geeksforgeeks.org/problems/stack-using-two-queues/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/other/stack%20using%20queue.cpp) |\n| Stack using two queues | [Visit](https://practice.geeksforgeeks.org/problems/stack-using-two-queues/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/other/stack%20using%20queue.cpp) |\n| Stock Span Problem | [Visit](https://practice.geeksforgeeks.org/problems/stock-span-problem-1587115621/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/stack%26queue/other/stockspan.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### Trees\n\n(Binary Tree)\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| Level order traversal (BFS) | [Visit](https://practice.geeksforgeeks.org/problems/level-order-traversal/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/BFS_level%20order%20traversal.cpp) |\n| Inorder Traversal (Iterative \u0026 Recursive) | [Visit](https://practice.geeksforgeeks.org/problems/inorder-traversal/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/DFS_inorder%20traversal_iterative%26recursive.cpp) |\n| Postorder Traversal (Iterative \u0026 Recursive) | [Visit](https://practice.geeksforgeeks.org/problems/postorder-traversal/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/DFS_postorder%20traversal_iterative%26recursive.cpp) |\n| Preorder Traversal (Iterative \u0026 Recursive) | [Visit](https://practice.geeksforgeeks.org/problems/preorder-traversal/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/DFS_preorder%20traversal_iterative%26recursive.cpp) |\n| Lowest Common Ancestor in a Binary Tree | [Visit](https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-binary-tree/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/LCA-%20lowest%20common%20ancestor%2C%20binary%20tree.cpp) |\n| Constructing BT | [Visit](https://www.geeksforgeeks.org/binary-tree-data-structure/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/%5BRAW_CPP_FILE_%5D%5BIGNORE%5D%20tree%2C%20using%20struct-%26-class--.cpp) |\n| Binary Tree to DLL | [Visit](https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/binary%20tree%20to%20dll.cpp) |\n| Bottom View of Binary Tree (Iterative \u0026 Recursive) | [Visit](https://practice.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/bottom%20view...%20_%20recursive%26iterative.cpp) |\n| Check for Balanced Tree | [Visit](https://practice.geeksforgeeks.org/problems/check-for-balanced-tree/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/check%20balanced%20tree.cpp) |\n| Determine if Two Trees are Identical | [Visit](https://practice.geeksforgeeks.org/problems/determine-if-two-trees-are-identical/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/check%20if%20two%20trees%20identical.cpp) |\n| Check if Tree is Isomorphic | [Visit](https://practice.geeksforgeeks.org/problems/check-if-tree-is-isomorphic/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/check%20isomorphic%20trees.cpp) |\n| Symmetric Tree | [Visit](https://practice.geeksforgeeks.org/problems/symmetric-tree/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/check%20symmetric%20tree.cpp) |\n| Count Leaves in Binary Tree | [Visit](https://practice.geeksforgeeks.org/problems/count-leaves-in-binary-tree/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/count%20leaves%20in%20a%20BT.cpp) |\n| Diameter of Binary Tree | [Visit](https://practice.geeksforgeeks.org/problems/diameter-of-binary-tree/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/diameter%20of%20binary%20tree.cpp) |\n| Flatten Binary Tree to Linked List | [Visit](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/flatten%20binary%20tree%20to%20linkedlist.cpp) |\n| Height of Binary Tree | [Visit](https://practice.geeksforgeeks.org/problems/height-of-binary-tree/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/height%20of%20binary%20tree.cpp) |\n| Left View of Binary Tree (Iterative \u0026 Recursive) | [Visit](https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/left%20view%20of%20binary%20tree_recursive%26iterative.cpp) |\n| Binary Tree Maximum Path Sum | [Visit](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/maximum%20path%20sum.cpp) |\n| Mirror Tree | [Visit](https://practice.geeksforgeeks.org/problems/mirror-tree/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/mirror%20tree.cpp) |\n| Serialize and Deserialize a Binary Tree | [Visit](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/serialize%20%26%20deserialize%20a%20bt.cpp) |\n| Level order traversal in spiral form | [Visit](https://practice.geeksforgeeks.org/problems/level-order-traversal-in-spiral-form/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/spiral%20level%20order%20traversal.cpp) |\n| Top View of Binary Tree | [Visit](https://practice.geeksforgeeks.org/problems/top-view-of-binary-tree/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/top%20view%20of%20binary%20tree_recursive%26iterative.cpp) |\n| Tree from Postorder and Inorder | [Visit](https://practice.geeksforgeeks.org/problems/tree-from-postorder-and-inorder/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/tree%20from%20postorder-inorder.cpp) |\n| Construct Tree from Inorder \u0026 Preorder | [Visit](https://practice.geeksforgeeks.org/problems/construct-tree-1/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/tree%20from%20preorder-inorder.cpp) |\n| Vertical Traversal of Binary Tree | [Visit](https://practice.geeksforgeeks.org/problems/print-a-binary-tree-in-vertical-order/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-tree-qs/vertical%20traversal%20of%20a%20BT.cpp) |\n\n\u003cbr\u003e\n\n(Binary Search Tree) \n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| Constructing a BST | [Visit](https://www.geeksforgeeks.org/binary-search-tree-data-structure/#:~:text=1%20Find%20the%20node%20with%20minimum%20value%20in,modification%20to%20BST%20is%20not%20allowed.%20More%20items) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-search-tree-qs/construct%20%26%20search%20in%20bst.cpp) |\n| Lowest Common Ancestor in a BST | [Visit](https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-bst/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-search-tree-qs/LCA%20in%20BST.cpp) |\n| Check for BST | [Visit](https://practice.geeksforgeeks.org/problems/check-for-bst/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-search-tree-qs/check%20for%20bst.cpp) |\n| Floor and Ceil from a BST | [Visit](https://www.geeksforgeeks.org/floor-and-ceil-from-a-bst/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-search-tree-qs/floor%26ceil%20from%20bst.cpp) |\n| k-th smallest element in BST | [Visit](https://practice.geeksforgeeks.org/problems/find-k-th-smallest-element-in-bst/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-search-tree-qs/kth%20smallest%20element%20in%20bst.cpp) |\n| Largest BST | [Visit](https://practice.geeksforgeeks.org/problems/largest-bst/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-search-tree-qs/largest%20bst%20in%20bt.cpp) |\n| Find a pair with given target in BST | [Visit](https://practice.geeksforgeeks.org/problems/find-a-pair-with-given-target-in-bst/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-search-tree-qs/pair%20with%20given%20target%20bst.cpp) |\n| Populating Next Right Pointers in Each Node | [Visit](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/tree/binary-search-tree-qs/populate%20next%20right%20pointers.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### Heap\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| Heap Sort | [Visit](https://practice.geeksforgeeks.org/problems/heap-sort/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/heap/heap%20sort.cpp) |\n| Kth largest element in a stream | [Visit](https://practice.geeksforgeeks.org/problems/kth-largest-element-in-a-stream2220/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/heap/kth%20largest%20element%20in%20stream.cpp) |\n| Find median in a stream | [Visit](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/heap/median%20in%20a%20stream.cpp) |\n| Merge K sorted linked lists | [Visit](https://practice.geeksforgeeks.org/problems/merge-k-sorted-linked-lists/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/heap/merge%20k%20sorted%20ll.cpp) |\n| Find k closest numbers in an unsorted array | [Visit](https://www.geeksforgeeks.org/find-k-closest-numbers-in-an-unsorted-array/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/heap/other/k%20closest%20numbers.cpp) |\n| Find k numbers with most occurrences in the given array | [Visit](https://www.geeksforgeeks.org/find-k-numbers-occurrences-given-array/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/heap/other/k%20num.%20most%20occurrences.cpp) |\n| K’th Smallest/Largest Element in Unsorted Array | [Visit](https://practice.geeksforgeeks.org/problems/kth-smallest-element5635/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/heap/other/kth%20smallest%20element.cpp) |\n| Connect n ropes with minimum cost | [Visit](https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/heap/other/n%20ropes%20min%20cost_or_%20huffman%20_or_%20optimal%20merge%20pattern....cpp) |\n| Sort a K Sorted (nearly sorted) Array | [Visit](https://practice.geeksforgeeks.org/problems/nearly-sorted-algorithm/0) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/heap/other/sort%20k%20sorted%20array.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### Recursion\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| Flood fill Algorithm | [Visit](https://leetcode.com/problems/flood-fill/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/flood%20fill%20algo.cpp) |\n| Josephus problem | [Visit](https://practice.geeksforgeeks.org/problems/josephus-problem/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/josephus%20problem.cpp) |\n| Number of paths | [Visit](https://practice.geeksforgeeks.org/problems/number-of-paths0926/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/no.%20of%20paths.cpp) |\n| Special Keyboard | [Visit](https://practice.geeksforgeeks.org/problems/special-keyboard3018/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/special%20keyboard.cpp) |\n| Generate all balanced parenthesis | [Visit](https://practice.geeksforgeeks.org/problems/generate-all-possible-parentheses/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/other/balanced%20parenthesis.cpp) |\n| Combination Sum I | [Visit](https://leetcode.com/problems/combination-sum/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/other/combination%20sum%20I.cpp) |\n| Combination Sum II | [Visit](https://leetcode.com/problems/combination-sum-ii/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/other/combination%20sum%20II.cpp) |\n| kth symbol in grammar | [Visit](https://leetcode.com/problems/k-th-symbol-in-grammar/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/other/kth%20symbol%20in%20grammar.cpp) |\n| Letter case permutation | [Visit](https://leetcode.com/problems/letter-case-permutation/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/other/letter%20case%20permutation.cpp) |\n| Permutation Sequence | [Visit](https://leetcode.com/problems/permutation-sequence/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/other/permutation%20seq..cpp) |\n| Permutation with spaces | [Visit](https://practice.geeksforgeeks.org/problems/permutation-with-spaces3627/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/other/permutation%20with%20spaces.cpp) |\n| Reverse a stack using recursion | [Visit](https://www.geeksforgeeks.org/reverse-a-stack-using-recursion/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/other/reverse%20stack.cpp) |\n| Sort an array recursively | [Visit](https://practice.geeksforgeeks.org/problems/sort-the-array0055/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/other/sort%20array%20recursively.cpp) |\n| Subset Sums | [Visit](https://practice.geeksforgeeks.org/problems/subset-sums2234/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/recursion/other/subset%20sums.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### Hashing\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| Zero Sum Subarrays | [Visit](https://practice.geeksforgeeks.org/problems/zero-sum-subarrays1825/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/hashing/0-sum%20subarrays.cpp) |\n| Find all pairs with a given sum | [Visit](https://practice.geeksforgeeks.org/problems/find-all-pairs-whose-sum-is-x5808/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/hashing/all%20pairs%20with%20given%20sum.cpp) |\n| Common Elements | [Visit](https://practice.geeksforgeeks.org/problems/common-elements5420/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/hashing/common%20elements.cpp) |\n| Count distinct elements in every window | [Visit](https://practice.geeksforgeeks.org/problems/count-distinct-elements-in-every-window/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/hashing/count%20distinct%20elements%20in%20window...cpp) |\n| Longest Continuous Increasing Subsequence | [Visit](https://leetcode.com/problems/longest-continuous-increasing-subsequence/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/hashing/longest%20consecutive%20increasing%20seq..cpp) |\n| Longest Consecutive Sequence | [Visit](https://leetcode.com/problems/longest-consecutive-sequence/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/hashing/longest%20consecutive%20seq..cpp) |\n| Sort an array according to the other | [Visit](https://practice.geeksforgeeks.org/problems/relative-sorting4323/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/hashing/sort%20array%20according%20to%20other.cpp) |\n| Sorting Elements of an Array by Frequency | [Visit](https://practice.geeksforgeeks.org/problems/sorting-elements-of-an-array-by-frequency/0) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/hashing/sort%20elements%20by%20freq..cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### Graph\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| BFS of graph | [Visit](https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/bfs.cpp) |\n| DFS of Graph | [Visit](https://practice.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/dfs.cpp) |\n| Find whether path exist | [Visit](https://practice.geeksforgeeks.org/problems/find-whether-path-exist5238/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/find%20if%20path%20exist%20matrix..cpp) |\n| Alien Dictionary | [Visit](https://practice.geeksforgeeks.org/problems/alien-dictionary/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/alien%20dictionary.cpp) |\n| Detect cycle in a directed graph | [Visit](https://practice.geeksforgeeks.org/problems/detect-cycle-in-a-directed-graph/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/detect%20cycle%20in%20DIRECTED%20graph.cpp) |\n| Detect cycle in an undirected graph | [Visit](https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/detect%20cycle%20in%20undirected%20graph.cpp) |\n| Floyd Warshall | [Visit](https://practice.geeksforgeeks.org/problems/implementing-floyd-warshall2042/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/floyd%20warshall.cpp) |\n| Minimum Swaps to Sort | [Visit](https://practice.geeksforgeeks.org/problems/minimum-swaps/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/min%20swaps%20sort..cpp) |\n| Find the number of islands | [Visit](https://practice.geeksforgeeks.org/problems/find-the-number-of-islands/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/number%20of%20islands.cpp) |\n| Topological sort | [Visit](https://practice.geeksforgeeks.org/problems/topological-sort/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/topological%20sort%20-%20bfs_dfs.cpp) |\n| Dijkstra's Algorithm - Shortest Path in Undirected Graph | [Visit](https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/other/Dijkstra's%20Algorithm_%20Shortest%20Path%20in%20Undirected%20Graphs.cpp) |\n| Bellman Ford Algorithm - Detect Negative Weight Cycle in Graphs | [Visit](https://www.geeksforgeeks.org/bellman-ford-algorithm-dp-23/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/other/bellman%20ford%20algo%20to%20detect%20negative%20weight%20cycle.cpp) |\n| Check if it's a Bipartite Graph | [Visit](https://practice.geeksforgeeks.org/problems/bipartite-graph/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/other/bipartite%20graph.cpp) |\n| Bridges in Graph (or) Cut Edge | [Visit](https://www.geeksforgeeks.org/bridge-in-a-graph/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/other/bridges%20in%20graph.cpp) |\n| Disjoint Set - Union By Rank and Path Compression | [Visit](https://www.geeksforgeeks.org/union-find-algorithm-set-2-union-by-rank/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/other/disjoint%20set%20union%20_%20path%20compression.cpp) |\n| Kosaraju's Algorithm for Strongly Connected Components (SCC) | [Visit](https://www.geeksforgeeks.org/strongly-connected-components/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/other/kosaraju%20algo%20for%20SCC.cpp) |\n| Kruskal's Algorithm to find MST | [Visit](https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/other/kruskals%20algo%20_minimum%20spanning%20tree.cpp) |\n| MST Prims Algo | [Visit](https://www.geeksforgeeks.org/prims-minimum-spanning-tree-mst-greedy-algo-5/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/other/prims%20algo%20_%20Minimum%20Spanning%20Tree.cpp) |\n| Shortest Path in Undirected Graph with Unit Weights | [Visit](https://www.geeksforgeeks.org/shortest-path-unweighted-graph/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/other/shortest%20path%20UNDIRECTED%20UNIT%20WEIGHT%20GRAPH.cpp) |\n| Shortest Path in Directed Acyclic Graph (DAG) | [Visit](https://www.geeksforgeeks.org/shortest-path-for-directed-acyclic-graphs/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/graph/other/shortest%20path%20in%20DAG.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### Greedy\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| Activity Selection | [Visit](https://practice.geeksforgeeks.org/problems/activity-selection-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/greedy/activity%20selection.cpp) |\n| Largest number with given sum | [Visit](https://practice.geeksforgeeks.org/problems/largest-number-with-given-sum-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/greedy/largest%20number%20possible%20with%20given%20sum.cpp) |\n| Maximize Toys | [Visit](https://practice.geeksforgeeks.org/problems/maximize-toys0331/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/greedy/maximize%20toys.cpp#L9) |\n| Minimize the Heights II | [Visit](https://practice.geeksforgeeks.org/problems/minimize-the-heights3351/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/greedy/minimize%20heights%20II.cpp) |\n| Minimize the sum of product | [Visit](https://practice.geeksforgeeks.org/problems/minimize-the-sum-of-product1525/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/greedy/minimize%20the%20sum%20of%20pdt....cpp) |\n| N meetings in one room | [Visit](https://practice.geeksforgeeks.org/problems/n-meetings-in-one-room-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/greedy/n%20meetings%201%20room.cpp) |\n| Job Sequencing Problem | [Visit](https://practice.geeksforgeeks.org/problems/job-sequencing-problem-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/greedy/other/job%20sequencing%20problem.cpp) |\n| Greedy Algorithm to find Minimum number of Coins | [Visit](https://practice.geeksforgeeks.org/problems/number-of-coins1824/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/greedy/other/min%20no.%20of%20coins.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### DP\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| Box Stacking | [Visit](https://practice.geeksforgeeks.org/problems/box-stacking/1/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/box%20stacking.cpp) |\n| Count number of hops | [Visit](https://practice.geeksforgeeks.org/problems/count-number-of-hops-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/count%20no.%20of%20hops.cpp) |\n| Max length chain | [Visit](https://practice.geeksforgeeks.org/problems/max-length-chain/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/max%20length%20chain.cpp) |\n| Minimum number of jumps | [Visit](https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/min.%20no.%20of%20jumps.cpp) |\n| Minimum Operations | [Visit](https://practice.geeksforgeeks.org/problems/find-optimum-operation4504/1) | [Check](https://github.com/Surajv311/myProgramming/edit/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/minimum%20operations.cpp) |\n| 0/1 Knapsack Problem (DP) | [Visit](https://practice.geeksforgeeks.org/problems/0-1-knapsack-problem0945/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/0-1knapsack%20dp.cpp) |\n| 0/1 Knapsack Problem (Memoization) | [Visit](https://practice.geeksforgeeks.org/problems/0-1-knapsack-problem0945/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/0-1knapsack_memoization.cpp) |\n| Count ways to reach the n'th stair | [Visit](https://practice.geeksforgeeks.org/problems/count-ways-to-reach-the-nth-stair-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/Count%20ways%20to%20reach%20the%20n'th%20stair.cpp) |\n| Get Minimum Squares | [Visit](https://practice.geeksforgeeks.org/problems/get-minimum-squares0538/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/Get%20Minimum%20Squares.cpp) |\n| Find length of longest common subsequence \u0026 print the subsequence (string) | [Visit](https://practice.geeksforgeeks.org/problems/longest-common-subsequence-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/LC_Subseq%20-%20longest%20common%20sequence.cpp) |\n| Given two strings ‘X’ and ‘Y’, find the length of the longest common substring | [Visit](https://practice.geeksforgeeks.org/problems/longest-common-substring1452/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/LC_Substr.cpp) |\n| Longest Palindromic Subsequence Length | [Visit](https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/L_Palindrome_Subseq.cpp) |\n| Shortest Common Supersequence Length | [Visit](https://practice.geeksforgeeks.org/problems/shortest-common-supersequence0322/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/Shortest%20length%20common%20supersequence.cpp) |\n| Longest Increasing Subsequence | [Visit](https://practice.geeksforgeeks.org/problems/longest-increasing-subsequence-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/__longest%20increasing%20subseq.cpp) |\n| Coin change problem - I | [Visit](https://practice.geeksforgeeks.org/problems/coin-change2448/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/coin%20change%20problem1.cpp) |\n| Coin change problem - II | [Visit](https://practice.geeksforgeeks.org/problems/number-of-coins1824/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/coin%20change%20problem2.cpp) |\n| Count number of subset with a given difference / Target Sum | [Visit](https://www.geeksforgeeks.org/number-of-ways-to-calculate-a-target-number-using-only-array-elements/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/count%20no.%20of%20subs%20with%20given%20diff-%20target%20sum.cpp) |\n| Count subsets sum with X | [Visit](https://www.geeksforgeeks.org/count-of-subsets-with-sum-equal-to-x/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/count%20subsets%20with%20given%20sum.cpp) |\n| Edit Distance | [Visit](https://practice.geeksforgeeks.org/problems/edit-distance3702/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/edit%20distance.cpp) |\n| Egg dropping problem | [Visit](https://practice.geeksforgeeks.org/problems/egg-dropping-puzzle-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/egg%20dropping%20problem.cpp) |\n| Partition problem | [Visit](https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/equal%20sum%20partition.cpp) |\n| House Robber | [Visit](https://leetcode.com/problems/house-robber/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/house%20robber_leetcode.cpp) |\n| Longest Repeated Subsequence | [Visit](https://practice.geeksforgeeks.org/problems/longest-repeating-subsequence2004/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/longest%20repeated%20subseq.cpp) |\n| Maximum Product Subarray | [Visit](https://practice.geeksforgeeks.org/problems/maximum-product-subarray3604/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/max%20product%20subarray.cpp) |\n| Maximum sum increasing subsequence | [Visit](https://practice.geeksforgeeks.org/problems/maximum-sum-increasing-subsequence4749/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/max%20sum%20increasing%20subseq..cpp) |\n| Matrix Chain Multiplication | [Visit](https://practice.geeksforgeeks.org/problems/matrix-chain-multiplication0303/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/mcm.cpp) |\n| Minimum number of deletions to make a string palindrome | [Visit](https://practice.geeksforgeeks.org/problems/minimum-deletitions1648/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/min_del_to%20make%20string%20palindrome.cpp) |\n| Minimum Path Sum | [Visit](https://leetcode.com/problems/minimum-path-sum/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/minimum%20path%20sum.cpp) |\n| Minimum sum partition | [Visit](https://practice.geeksforgeeks.org/problems/minimum-sum-partition3317/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/minimum%20subset%20sum%20diff.cpp) |\n| Palindrome partitioning problem | [Visit](https://practice.geeksforgeeks.org/problems/palindromic-patitioning4845/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/palindrome%20partitioning.cpp) |\n| Printing Shortest Common Supersequence | [Visit](https://practice.geeksforgeeks.org/problems/shortest-common-supersequence0322/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/print%20shortest%20common%20supersequence.cpp) |\n| Maximize The Cut Segments/ Rod Cutting | [Visit](https://practice.geeksforgeeks.org/problems/cutted-segments1642/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/rod_cutting%20or%20_maximize%20cut%20segments.cpp) |\n| Scrambled String | [Visit](https://leetcode.com/problems/scramble-string/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/scrambled%20string.cpp) | \n| Sequence Pattern Matching | [Visit](https://practice.geeksforgeeks.org/problems/check-for-subsequence4930/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/seq.%20pattern%20matching.cpp) |\n| Subset sum problem | [Visit](https://practice.geeksforgeeks.org/problems/subset-sum-problem-1611555638/1/?category[]=Dynamic%20Programming\u0026category[]=Dynamic%20Programming\u0026page=4\u0026query=category[]Dynamic%20Programmingpage4category[]Dynamic%20Programming) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/subset%20sum%20problem.cpp) |\n| Minimum number of deletions and insertions to transform one string into another | [Visit](https://practice.geeksforgeeks.org/problems/minimum-number-of-deletions-and-insertions0209/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/transform%20string...%20min.%20ins-del.cpp) |\n| Knapsack with Duplicate Items/ Unbounded Knapsack | [Visit](https://practice.geeksforgeeks.org/problems/knapsack-with-duplicate-items4201/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/unbounded%20knapsack.cpp) |\n| Weighted Job Scheduling | [Visit](https://www.geeksforgeeks.org/weighted-job-scheduling/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/weighted%20job%20scheduling.cpp) |\n| Word Break | [Visit](https://practice.geeksforgeeks.org/problems/word-break1352/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/dp/other/word%20break%20problem.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### Backtracking\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| N-Queen Problem | [Visit](https://practice.geeksforgeeks.org/problems/n-queen-problem0315/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/backtracking/n%20queen%20problem.cpp) |\n| Word Boggle | [Visit](https://practice.geeksforgeeks.org/problems/word-boggle4143/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/backtracking/word%20boggle.cpp) |\n| M-Coloring Problem | [Visit](https://practice.geeksforgeeks.org/problems/m-coloring-problem-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/backtracking/other/m%20coloring%20problem.cpp) |\n| Permutations of a given string | [Visit](https://practice.geeksforgeeks.org/problems/permutations-of-a-given-string2041/0/?company[]=Accolite\u0026company[]=Accolite\u0026page=1\u0026query=company[]Accolitepage1company[]Accolite) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/backtracking/other/permutations%20of%20a%20string.cpp) |\n| Print all possible paths from top left to bottom right of a mXn matrix | [Visit](https://practice.geeksforgeeks.org/problems/count-all-possible-paths-from-top-left-to-bottom-right3011/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/backtracking/other/possible%20paths%20from%20top%20to%20bottom.cpp) |\n| Rat in a Maze Problem - I | [Visit](https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/backtracking/other/rat%20in%20a%20maze%20problem.cpp) |\n| Sudoku Solver | [Visit](https://leetcode.com/problems/sudoku-solver/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/backtracking/other/sudoku%20solver.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### Bit_Magic\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| BASIC Bit Operations | [Visit Page](https://www.hackerearth.com/practice/basic-programming/bit-manipulation/basics-of-bit-manipulation/tutorial/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/bitmagic/other/bit%20operations.set-get-clear-update-bit.cpp) |\n| Find first set bit | [Visit](https://practice.geeksforgeeks.org/problems/find-first-set-bit-1587115620/1#) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/bitmagic/find%20first%20set%20bit.cpp) |\n| Find the 2 unique numbers from an array where all numbers are repeated twice except the two | [Visit](https://practice.geeksforgeeks.org/problems/finding-the-numbers0215/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/bitmagic/other/2%20unique%20numbers%20if%20all%20number%20repeated%20twice.cpp) |\n| Find number of ones in bits of a number | [Visit](https://practice.geeksforgeeks.org/problems/set-bits0143/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/bitmagic/other/count%20ones%20in%20bits%20of%20number.cpp) |\n| Check if no. is power of 2 | [Visit](https://practice.geeksforgeeks.org/problems/power-of-2-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/bitmagic/other/power%20of%202.cpp) |\n| Power Set | [Visit](https://practice.geeksforgeeks.org/problems/power-set4302/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/bitmagic/other/power%20set%20....%20subsets%20of%20set.cpp) |\n| Find the unique number from an array where all numbers are repeated THRICE except the unique one | [Visit](https://www.geeksforgeeks.org/find-the-element-that-appears-once/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/bitmagic/other/unique%20number%20if%20all%20number%20repeated%20THRICE.cpp) |\n| Find the unique number from an array where all numbers are repeated TWICE except the unique one | [Visit](https://www.geeksforgeeks.org/find-element-appears-array-every-element-appears-twice/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/bitmagic/other/unique%20number%20if%20all%20number%20repeated%20twice.cpp) |\n \n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### Sorting_Algos\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| Bubble Sort | [Visit](https://www.programiz.com/dsa/bubble-sort) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/sorting_algos/bubble%20sort.cpp) |\n| Counting Sort | [Visit](https://www.programiz.com/dsa/counting-sort) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/sorting_algos/counting%20sort.cpp) |\n| Heap Sort | [Visit](https://www.programiz.com/dsa/heap-sort) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/sorting_algos/heap%20sort.cpp) |\n| Insertion Sort | [Visit](https://www.programiz.com/dsa/insertion-sort) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/sorting_algos/insertion%20sort.cpp) |\n| Merge Sort | [Visit](https://www.programiz.com/dsa/merge-sort) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/sorting_algos/merge%20sort.cpp) |\n| Quick Sort | [Visit](https://www.programiz.com/dsa/quick-sort) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/sorting_algos/quick%20sort.cpp) |\n| Radix Sort | [Visit](https://www.programiz.com/dsa/radix-sort) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/sorting_algos/radix%20sort.cpp) |\n| Selection Sort | [Visit](https://www.programiz.com/dsa/selection-sort) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/sorting_algos/selection%20sort.cpp) |\n| Shell Sort | [Visit](https://www.programiz.com/dsa/shell-sort) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/sorting_algos/shell%20sort.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n#### Misc\n\n| Problem | Link | My Solution | \n| ------------- | ------------- | ------------- |\n| Allocate minimum number of pages | [Visit](https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages0937/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/misc/allocate%20min%20num.%20of%20pages.cpp) |\n| Binary Search | [Visit](https://www.geeksforgeeks.org/search-insert-position-of-k-in-a-sorted-array/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/misc/binary%20search.cpp) |\n| Given two number x and n, find n-th root of x | [Visit](https://www.geeksforgeeks.org/calculating-n-th-real-root-using-binary-search/) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/misc/calculate%20nth%20root.cpp) |\n| Find the element that appears once in sorted array | [Visit](https://practice.geeksforgeeks.org/problems/find-the-element-that-appears-once-in-sorted-array0624/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/misc/element%20that%20appears%20once.cpp) |\n| Floor in a Sorted Array | [Visit](https://practice.geeksforgeeks.org/problems/floor-in-a-sorted-array-1587115620/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/misc/floor%20of%20sorted%20array.cpp) |\n| Median in a row-wise sorted Matrix | [Visit](https://practice.geeksforgeeks.org/problems/median-in-a-row-wise-sorted-matrix1527/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/misc/median%20in%20row-wise%20sorted%20matrix.cpp) |\n| Nth Natural Number | [Visit](https://practice.geeksforgeeks.org/problems/nth-natural-number/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/misc/nth%20natural%20number.cpp) |\n| Find the Rotation Count in Rotated Sorted array | [Visit](https://practice.geeksforgeeks.org/problems/rotation4723/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/misc/number%20of%20rotations%20in%20sorted%20rotated%20arr..cpp) |\n| Search in row wise and column wise sorted array | [Visit](https://practice.geeksforgeeks.org/problems/search-in-a-matrix17201720/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/misc/search%20in%20row%20-col%20wise%20sorted%20arr..cpp) |\n| Sum of Middle Elements of two sorted arrays | [Visit](https://practice.geeksforgeeks.org/problems/sum-of-middle-elements-of-two-sorted-arrays2305/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/misc/sum%20of%20middle%20elements%20of%20two%20sorted%20arrays.cpp) |\n| The Celebrity Problem | [Visit](https://practice.geeksforgeeks.org/problems/the-celebrity-problem/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/misc/the%20celebrity%20problem.cpp) |\n| Trailing zeroes in factorial | [Visit](https://practice.geeksforgeeks.org/problems/trailing-zeroes-in-factorial5134/1) | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/misc/trailing%20zeroes.cpp) |\n| Miscellaneous Qs | - | [Check](https://github.com/Surajv311/myProgramming/blob/master/Coding/%5BIMP%5D%20INTERN-PLACEMENTS-PREP/DS-ALGO_QUESTIONS_%5BSOLVED%5D/misc/MISC.cpp) |\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#contents\"\u003e⬆ Back To Contents\n \u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\n\u003cbr\u003e \n\n- Side Note: Github gist to some random questions solved again for practice from Leetcode/GFG/Neetcode, etc. ~ [Gist](https://gist.github.com/Surajv311/d355d08ab637c0e996e39bf7a4e01339)\n\n------------------------------------\n\n### Author\n\n- [Suraj Verma](https://github.com/surajv311)\n\n----------------------------------\n----------------------------------\n\n\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsurajv311%2Fmyprogramming_interview-prep","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsurajv311%2Fmyprogramming_interview-prep","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsurajv311%2Fmyprogramming_interview-prep/lists"}