{"id":25533561,"url":"https://github.com/adityaprakash-bobby/interview-prep","last_synced_at":"2025-07-31T10:04:12.990Z","repository":{"id":39160965,"uuid":"186177074","full_name":"adityaprakash-bobby/interview-prep","owner":"adityaprakash-bobby","description":"Repo containing solutions to competitive programs' solution in C++/Python/Golang/Java","archived":false,"fork":false,"pushed_at":"2021-11-14T12:32:36.000Z","size":201,"stargazers_count":5,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-13T16:36:28.839Z","etag":null,"topics":["algorithms","bit-manipulation","competitive-programming","cpp17","data-structures-and-algorithms","dynamic-programming","hackerearth","hackerrank","interview-prep","interviewbit","linked-list","mathematics","stl","string-manipulation","string-matching","string-search"],"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/adityaprakash-bobby.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2019-05-11T20:09:36.000Z","updated_at":"2024-11-01T19:34:36.000Z","dependencies_parsed_at":"2022-08-31T00:40:23.854Z","dependency_job_id":null,"html_url":"https://github.com/adityaprakash-bobby/interview-prep","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/adityaprakash-bobby/interview-prep","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adityaprakash-bobby%2Finterview-prep","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adityaprakash-bobby%2Finterview-prep/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adityaprakash-bobby%2Finterview-prep/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adityaprakash-bobby%2Finterview-prep/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/adityaprakash-bobby","download_url":"https://codeload.github.com/adityaprakash-bobby/interview-prep/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adityaprakash-bobby%2Finterview-prep/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":268021939,"owners_count":24182767,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-07-31T02:00:08.723Z","response_time":66,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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","bit-manipulation","competitive-programming","cpp17","data-structures-and-algorithms","dynamic-programming","hackerearth","hackerrank","interview-prep","interviewbit","linked-list","mathematics","stl","string-manipulation","string-matching","string-search"],"created_at":"2025-02-20T02:46:19.789Z","updated_at":"2025-07-31T10:04:12.958Z","avatar_url":"https://github.com/adityaprakash-bobby.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Track CP Progress\n\n**Refer to [Sahil Bansal's repo](https://github.com/sahilbansal17/Get_Better_at_CP_in_2_Months) for finding the original checklist.**\n\n# Month 1\n\n## Week 1\n### Dynamic Programming\n- [X] Read [Dynamic Programming Notes Hackerearth](https://www.hackerearth.com/practice/notes/dynamic-programming-i-1/)\n- [X] Read [DP Tutorial involving grids](https://www.hackerearth.com/practice/notes/dynamic-programming-problems-involving-grids/)\n- [X] Read [TopCoder Tutorial on DP](https://www.topcoder.com/community/competitive-programming/tutorials/dynamic-programming-from-novice-to-advanced/)\n- Solve the following classical problems:\n  - [ ] [Max 3D Range Sum](https://uva.onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026category=649\u0026page=show_problem\u0026problem=1696)\n  - [ ] [Max 2D Range Sum](https://uva.onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026category=650\u0026page=show_problem\u0026problem=3102)\n  - [ ] [Longest Increasing Subsequence I](https://uva.onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026category=651\u0026page=show_problem\u0026problem=2890)\n  - [ ] [Longest Increasing Subsequence II](https://uva.onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026category=651\u0026page=show_problem\u0026problem=2451)\n  - [ ] [0-1 Knapsack I](https://uva.onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026category=652\u0026page=show_problem\u0026problem=1557)\n  - [ ] [0-1 Knapsack II](https://uva.onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026category=652\u0026page=show_problem\u0026problem=2613)\n  - [ ] [Coin Change I](https://uva.onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026category=653\u0026page=show_problem\u0026problem=1247)\n  - [ ] [Coin Change II](https://uva.onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026category=653\u0026page=show_problem\u0026problem=2512)\n- Solve the following MISC problems:\n  - [ ] [Cutting](https://codeforces.com/problemset/problem/998/B)\n  - [ ] [The Great Julya Calendar](https://codeforces.com/problemset/problem/331/C1)\n  - [ ] [Shashlik Cooking](https://codeforces.com/problemset/problem/1040/B)\n  - [ ] [Divisibility by Eight](https://codeforces.com/problemset/problem/550/C)\n  - [ ] [Bishwock](https://codeforces.com/problemset/problem/991/D)\n  - [ ] [Functions again](https://codeforces.com/problemset/problem/788/A)\n  - [ ] [An impassioned circulation of affection](https://codeforces.com/problemset/problem/814/C)\n  - [ ] [Color Stripe](https://codeforces.com/problemset/problem/219/C)\n  - [ ] [Bar Codes](https://uva.onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026category=655\u0026page=show_problem\u0026problem=1662)\n  - [ ] [How do you add?](https://uva.onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026category=655\u0026page=show_problem\u0026problem=1884)\n  - [ ] [Prime XOR](https://www.hackerrank.com/challenges/prime-xor/problem)\n  - [ ] [HackerRank City](https://www.hackerrank.com/challenges/hr-city/problem)\n- Try to solve as much tasks as possible in this [Educational DP contest on AtCoder](https://atcoder.jp/contests/dp)\n\n***\n\n## Week 2\n### String Algorithms\n1. #### Reading material\n- [X] [Basics of String manipulation](https://www.hackerearth.com/practice/algorithms/string-algorithm/basics-of-string-manipulation/tutorial/)\n- [X] [KMP algorithm](https://www.hackerearth.com/practice/algorithms/string-algorithm/string-searching/tutorial/)\n- [X] [Z algorithm](https://www.hackerearth.com/practice/algorithms/string-algorithm/z-algorithm/tutorial/)\n- [ ] [Manachar's algorithm](https://www.hackerearth.com/practice/algorithms/string-algorithm/manachars-algorithm/tutorial/)\n- [ ] [Rabin-Karp and KMP TopCoder](https://www.topcoder.com/community/competitive-programming/tutorials/introduction-to-string-searching-algorithms/)\n\n2. #### Problems on HackerEarth\n| ☆   | Problem Link                                                                                                                                                                              | Finished                  |\n|-----|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------|\n| ★★☆ | [Find the substrings](https://www.hackerearth.com/practice/algorithms/string-algorithm/basics-of-string-manipulation/practice-problems/algorithm/find-the-substrings/)                    | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★☆ | [The Cheapest Palindrome](https://www.hackerearth.com/practice/algorithms/string-algorithm/basics-of-string-manipulation/practice-problems/algorithm/make-the-cheapest-palindrome-1/)     | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★☆ | [Largest Lexicographical Rotation II](https://www.hackerearth.com/practice/algorithms/string-algorithm/string-searching/practice-problems/algorithm/largest-lexicographical-rotation-ii/) | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★☆ | [Monk and Monster](https://www.hackerearth.com/practice/algorithms/string-algorithm/string-searching/practice-problems/algorithm/monk-and-monster-1acbb78c/)                              | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★★ | [Prefix Number](https://www.hackerearth.com/practice/algorithms/string-algorithm/z-algorithm/practice-problems/algorithm/prefix-number-f5c76976/)                                         | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★★ | [Last Forever](https://www.hackerearth.com/practice/algorithms/string-algorithm/manachars-algorithm/practice-problems/algorithm/last-forever/)                                            | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n\n3. #### Problems on HackerRank\n| ☆   | Problem Link                                                                                             | Finished                  |\n|-----|----------------------------------------------------------------------------------------------------------|---------------------------|\n| ★☆☆ | [Sherlock and the Valid String](https://www.hackerrank.com/challenges/sherlock-and-valid-string/problem) | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★☆☆ | [Highest Value Palindrome](https://www.hackerrank.com/challenges/richie-rich/problem)                    | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★☆ | [Sherlock and Anagrams](https://www.hackerrank.com/challenges/sherlock-and-anagrams/problem)             | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★☆ | [Common Child](https://www.hackerrank.com/challenges/common-child/problem)                               | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★★ | [Build a Palindrome](https://www.hackerrank.com/challenges/challenging-palindromes/problem)              | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n\n4. ### Problems on Codeforces\n\n| ☆   | Problem Link                                                                                             | Finished                  |\n|-----|----------------------------------------------------------------------------------------------------------|---------------------------|\n| ★☆☆ | [Petya and Exam](https://codeforces.com/problemset/problem/832/B) | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★☆ | [Password](https://codeforces.com/problemset/problem/126/B)              | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★★ | [Prefixes and Suffixes](https://codeforces.com/problemset/problem/432/D)              | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n\n5. ### Problems on Codechef\n- [ ] [Kira Loves Palindromes](https://www.codechef.com/APRIL19A/problems/KLPM/)\n\n***\n\n## Week 3\n- Solve the remaining problems from Week 1 and Week 2.\n- Take part in [CodeChef June Challenge](https://www.codechef.com/JUNE19).\n\nThis list will be updated frequently.\n\n***\n\n## Week 4\n### Square Root Decomposition\n1. #### Reading Material\n- [ ] [Tutorial 1: Base Concept + Mo's algorithm](https://cp-algorithms.com/data_structures/sqrt_decomposition.html)\n- [ ] [Tutorial 2](https://codeforces.com/blog/entry/20489)\n- [ ] [Tutorial 3 : Read the comments](https://codeforces.com/blog/entry/16883)\n- [ ] [Tutorial 4 : Video Lecture, find slides in video description](https://www.youtube.com/watch?v=VGq6w9TlJBY)\n- [ ] [Tutorial 5 : Exhaustive PDF](http://acm.math.spbu.ru/~sk1/mm/lections/mipt2016-sqrt/mipt-2016-burunduk1-sqrt.en.pdf)\n- [ ] [Tutorial 6 : Mo's Algorithm](https://blog.anudeep2011.com/mos-algorithm/)\n\n\n2. #### Problems\n\n- [ ] [CHEFXQ](https://www.codechef.com/problems/CHEFEXQ)\n- [ ] [RACETIME](https://www.spoj.com/problems/RACETIME)\n- [ ] [GIVEAWAY](http://www.spoj.com/problems/GIVEAWAY/)\n- [ ] [13E](http://codeforces.com/contest/13/problem/E)\n- [ ] [342E](https://codeforces.com/contest/342/problem/E)\n- [ ] [DQUERY](http://www.spoj.com/problems/DQUERY/)\n- [ ] [375D](http://codeforces.com/problemset/problem/375/D)\n- [ ] [840D](http://codeforces.com/contest/840/problem/D)\n- [ ] [86D](https://codeforces.com/contest/86/problem/D)\n- [ ] [398D](https://codeforces.com/contest/398/problem/D)\n- [ ] [GERALD07](https://www.codechef.com/problems/GERALD07)\n- [ ] [MKTHNUM](https://www.spoj.com/problems/MKTHNUM/)\n\n## Week 5\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fadityaprakash-bobby%2Finterview-prep","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fadityaprakash-bobby%2Finterview-prep","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fadityaprakash-bobby%2Finterview-prep/lists"}