{"id":13809139,"url":"https://github.com/sahilbansal17/Get_Better_at_CP_in_2_Months","last_synced_at":"2025-05-14T05:33:21.909Z","repository":{"id":43308864,"uuid":"188525890","full_name":"sahilbansal17/Get_Better_at_CP_in_2_Months","owner":"sahilbansal17","description":"This contains the curriculum that I will follow to get better at Competitive Programming in 2 months.","archived":false,"fork":false,"pushed_at":"2023-08-27T10:12:01.000Z","size":53,"stargazers_count":1012,"open_issues_count":1,"forks_count":404,"subscribers_count":28,"default_branch":"master","last_synced_at":"2024-10-14T21:41:46.526Z","etag":null,"topics":["algorithm","algorithm-challenges","algorithm-competitions","algorithm-library","algorithms","algorithms-and-data-structures","algorithms-datastructures","algorithms-implemented","competitive-coding","competitive-programming","competitive-programming-algorithms","competitive-programming-contests","competitive-programming-reference","competitive-sites","competitiveprogramming","data-structures"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sahilbansal17.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}},"created_at":"2019-05-25T05:45:33.000Z","updated_at":"2024-10-13T14:16:58.000Z","dependencies_parsed_at":"2024-01-08T07:58:42.472Z","dependency_job_id":"4ec9510e-6158-477d-95bb-d3a65e28cc8e","html_url":"https://github.com/sahilbansal17/Get_Better_at_CP_in_2_Months","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilbansal17%2FGet_Better_at_CP_in_2_Months","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilbansal17%2FGet_Better_at_CP_in_2_Months/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilbansal17%2FGet_Better_at_CP_in_2_Months/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilbansal17%2FGet_Better_at_CP_in_2_Months/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sahilbansal17","download_url":"https://codeload.github.com/sahilbansal17/Get_Better_at_CP_in_2_Months/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":225277980,"owners_count":17448796,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","algorithm-challenges","algorithm-competitions","algorithm-library","algorithms","algorithms-and-data-structures","algorithms-datastructures","algorithms-implemented","competitive-coding","competitive-programming","competitive-programming-algorithms","competitive-programming-contests","competitive-programming-reference","competitive-sites","competitiveprogramming","data-structures"],"created_at":"2024-08-04T01:02:03.374Z","updated_at":"2025-05-14T05:33:21.890Z","avatar_url":"https://github.com/sahilbansal17.png","language":null,"funding_links":[],"categories":["Others"],"sub_categories":[],"readme":"# Get_Better_CP_in_2_Months\n\nJoin us on X community: https://x.com/i/communities/1873085009294410088\n\n# Month 1\n\n\u003cdetails\u003e\n\u003csummary\u003eWeek 1\u003c/summary\u003e\n\nDynamic Programming \n\n- [ ] Read [Dynamic Programming Notes Hackerearth](https://www.hackerearth.com/practice/notes/dynamic-programming-i-1/)\n- [ ] Read [DP Tutorial involving grids](https://www.hackerearth.com/practice/notes/dynamic-programming-problems-involving-grids/)\n- [ ] 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  - [ ] [Coin change problem](https://www.hackerrank.com/challenges/coin-change/problem)\n  - [ ] [Unbounded Knapsack](https://www.hackerrank.com/challenges/unbounded-knapsack/problem)\n  - [ ] [Longest common subsequence](https://www.hackerrank.com/challenges/dynamic-programming-classics-the-longest-common-subsequence/problem)\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  - [ ] [Prime XOR](https://www.hackerrank.com/challenges/prime-xor/problem)\n  - [ ] [HackerRank City](https://www.hackerrank.com/challenges/hr-city/problem)\n\n### Contests\n- [ ] [Educational DP contest on AtCoder](https://atcoder.jp/contests/dp)\n- [ ] [DSA Learning Series: Week 7 - DP By CodeChef](https://www.codechef.com/LRNDSA07)\n- [ ] [Marathon DP - 01](https://vjudge.net/contest/202878)\n- [ ] [V Planet DP - 2](https://codeforces.com/group/hK6hgc8x94/contest/222255)\n- [ ] [V Planet DP - 3](https://codeforces.com/group/hK6hgc8x94/contest/222261)\n- [ ] [V Planet DP Week 5](https://codeforces.com/group/hK6hgc8x94/contest/238061)\n\n\u003c/details\u003e\n\n***\n\n\u003cdetails\u003e\n\u003csummary\u003eWeek 2\u003c/summary\u003e\n\nTrees \u0026 Graphs\n\n### Trees \n\n| ☆   | Problem Link                                                                                             | Finished                  |\n|-----|----------------------------------------------------------------------------------------------------------|---------------------------|\n| ★☆☆ | [Diameter of a Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★☆☆ | [Path Sum](https://leetcode.com/problems/path-sum/)                    | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★☆ | [K-th smallest element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)             | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★☆ | [Find duplicate subtrees](https://leetcode.com/problems/find-duplicate-subtrees/)                               | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★☆ | [Lowest Common Ancestor of a binary tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)              | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n| ★★★ | [Sum of distances in tree](https://leetcode.com/problems/sum-of-distances-in-tree/)              | \u003cul\u003e \u003cli\u003e [ ] \u003c/li\u003e \u003c/ul\u003e |\n\n### Graphs\n\n#### BFS and DFS\n\n- [ ] [Ones and Zeroes](https://www.spoj.com/problems/ONEZERO/)\n- [ ] [Prime Path](https://www.spoj.com/problems/PPATH/)\n\n#### Strongly Connected Components\n\n- [ ] [The Bottom of a Graph](https://www.spoj.com/problems/BOTTOM/)\n- [ ] [Fake Tournament](https://www.spoj.com/problems/TOUR/)\n\n### Biconnected Components, Shortest Path and MST\n\n#### Reading Material\n\n- [ ] [:movie_camera:](https://www.youtube.com/watch?v=aZXi1unBdJA)[Finding Bridges in Graphs](https://cp-algorithms.com/graph/bridge-searching.html)\n- [ ] [:movie_camera:](https://www.youtube.com/watch?v=aZXi1unBdJA)[Articulation Points](https://github.com/williamfiset/Algorithms/blob/master/slides/graphtheory/bridges_and_articulation_points.pdf)\n- [ ] [:movie_camera:](https://www.youtube.com/watch?v=pSqmAO-m7Lk)[Dijkstra's Shortest path](https://cp-algorithms.com/graph/dijkstra_sparse.html)\n- [ ] [Bellman Ford algorithm](https://cp-algorithms.com/graph/bellman_ford.html)\n- [ ] [:movie_camera:](https://www.youtube.com/watch?v=4NQ3HnhyNfQ)[Floyd Warshall's algorithm](https://cp-algorithms.com/graph/all-pair-shortest-path-floyd-warshall.html)\n- [ ] [:movie_camera:](https://www.youtube.com/watch?v=JZBQLXgSGfs)[Kruska's Minimum Spanning Tree](https://cp-algorithms.com/graph/mst_kruskal.html)\n- [ ] [:movie_camera:](https://www.youtube.com/watch?v=jsmMtJpPnhU)[Prim's MST Algorithm](https://cp-algorithms.com/graph/mst_prim.html)\n\n#### Problems: Biconnected Components\n- [ ] [UVa 00315: Network](https://onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026category=670\u0026page=show_problem\u0026problem=251) (finding articulation points)\n- [ ] [UVa 00796: Critical Links](https://onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026category=670\u0026page=show_problem\u0026problem=737) (finding bridges)\n- [ ] [CF 193A: Cutting Figure](http://codeforces.com/problemset/problem/193/A)\n\n#### Problems: Shortest Path \n- [ ] [HE: Minimum Valid Path](https://www.hackerearth.com/practice/algorithms/graphs/graph-representation/practice-problems/algorithm/minimum-valid-path-3dc5bd03/)\n- [ ] [CC: DIGJUMP](https://www.codechef.com/problems/DIGJUMP)\n- [ ] [CC: AMR14B](https://www.codechef.com/AMR14ROS/problems/AMR14B)\n- [ ] [SPOJ: Mice and Maze](https://www.spoj.com/problems/MICEMAZE/)\n\n#### Problems: Minimum Spanning Tree\n- [ ] [SPOJ: BLINNET](https://www.spoj.com/problems/BLINNET/)\n- [ ] [HR: Roads in HackerLand](https://www.hackerrank.com/contests/june-world-codesprint/challenges/johnland/problem)\n- [ ] [CC: MST Queries](https://www.codechef.com/problems/MSTQS)\n- [ ] [SPOJ: KOICOST](https://www.spoj.com/problems/KOICOST/)\n\n### Contests\n\n- [ ] [DSA Learning Series: Week 8 - Graphs By CodeChef](https://www.codechef.com/LRNDSA08)\n***\n\n\u003c/details\u003e\n\n***\n\n\u003cdetails\u003e\n\u003csummary\u003eWeek 3\u003c/summary\u003e\n\nString Algorithms \n\n1. #### Reading material\n- [ ] [Basics of String manipulation](https://www.hackerearth.com/practice/algorithms/string-algorithm/basics-of-string-manipulation/tutorial/)\n- [ ] [KMP algorithm](https://www.hackerearth.com/practice/algorithms/string-algorithm/string-searching/tutorial/)\n- [ ] [Z algorithm](https://www.hackerearth.com/practice/algorithms/string-algorithm/z-algorithm/tutorial/)\n- [ ] [Z algorithm II](https://cp-algorithms.com/string/z-function.html)\n- [ ] [Manachar's algorithm](https://www.hackerearth.com/practice/algorithms/string-algorithm/manachars-algorithm/tutorial/)\n- [ ] [Manacher's algorithm II](https://cp-algorithms.com/string/manacher.html)\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/)\n6. ### Problems on SPOJ\n- [ ] [Word Puzzles](https://www.spoj.com/problems/WPUZZLES/)\n\n\u003c/details\u003e\n\n***\n\n\u003cdetails\u003e\n\u003csummary\u003eWeek 4\u003c/summary\u003e\n\n## Week 4: Practice Contest\n\n- [ ] [ZCO Practice Contest](https://www.codechef.com/ZCOPRAC)\n- [ ] [INOI Problems](https://www.codechef.com/INOIPRAC)\n- [ ] [IARCS OPC Judge Problems](https://www.codechef.com/IARCSJUD)\n\n\u003c/details\u003e\n\n***\n\n# Month 2\n\n\u003cdetails\u003e\n\u003csummary\u003eWeek 5\u003c/summary\u003e\n\nData Structures\n\n### Sparse Table\n\n1. #### Reading Material\n- [ ] [:movie_camera:](https://www.youtube.com/watch?v=uUatD9AudXo)[Tutorial](https://cp-algorithms.com/data_structures/sparse-table.html)\n- [ ] [Blog post](http://adilet.org/blog/sparse-table/)\n\n2. #### Problems\n- [ ] [B. Maximum of Maximums of Minimums](https://codeforces.com/problemset/problem/872/B)\n- [ ] [CGCDSSQ](https://codeforces.com/contest/475/problem/D)\n- [ ] [D. R2D2 and Droid Army](https://codeforces.com/problemset/problem/514/D)\n\n### Disjoint Set Union\n\n1. #### Reading Material\n- [ ] [:movie_camera:](https://www.youtube.com/watch?v=0jNmHPfA_yE)[Tutorial](https://cp-algorithms.com/data_structures/disjoint_set_union.html)\n\n2. #### Problems\n- [ ] [D. Roads not only in Berland](https://codeforces.com/contest/25/problem/D)\n- [ ] [HackerEarth CodeMonk: DSU](https://www.hackerearth.com/challenges/competitive/code-monk-disjoint-set-union-union-find/)\n\n\u003c/details\u003e\n\n***\n\n\u003cdetails\u003e\n\u003csummary\u003eWeek 6\u003c/summary\u003e\n\nSquare Root Decomposition\n\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\u003c/details\u003e\n\n*** \n\n\u003cdetails\u003e\n\u003csummary\u003eWeek 7\u003c/summary\u003e\n\nSegment Tree \n\n1. #### Reading Material\n- [ ] [Tutorial](https://cp-algorithms.com/data_structures/segment_tree.html)\n\n2. #### Problems\n- [ ] [D. Distinct Characters Queries](https://codeforces.com/problemset/problem/1234/D)\n- [ ] [A. Knight Tournament](https://codeforces.com/contest/356/problem/A)\n- [ ] [F. Ant colony](https://codeforces.com/contest/474/problem/F)\n- [ ] [E. Drazil and Park](https://codeforces.com/contest/515/problem/E)\n- [ ] [C. DZY Loves Fibonacci Numbers](https://codeforces.com/contest/446/problem/C)\n\n\u003c/details\u003e\n\n***\n\n\u003cdetails\u003e\n\u003csummary\u003eWeek 8\u003c/summary\u003e\n\n## Week 8\nFenwick Tree \n\n1. #### Reading Material\n- [ ] [Tutorial](https://cp-algorithms.com/data_structures/fenwick.html)\n\n2. #### Problems\n- [ ] [E. Little Artem and Time Machine](https://codeforces.com/contest/669/problem/E)\n- [ ] [E. Hanoi Factory](https://codeforces.com/contest/777/problem/E)\n- [ ] [C. Subsequences](https://codeforces.com/contest/597/problem/C)\n- [ ] [D. Ball](https://codeforces.com/contest/12/problem/D)\n- [ ] [E. Garlands](https://codeforces.com/contest/707/problem/E)\n\n\u003c/details\u003e\n\n***\n\n\u003cdetails\u003e\n\u003csummary\u003eWhy use this list?\u003c/summary\u003e\n  \nSince getting better at competitive programming takes a lot of effort, you need to keep practicing a lot of problems. This list will keep you focussed and you will have a target with you that you need to finish atleast these many problems before moving on. It can help you organize your practice.\n\n\u003c/details\u003e\n\n***\n\n\u003cdetails\u003e\n\u003csummary\u003eHow to use this list?\u003c/summary\u003e\n\nThe Github markdown's task list feature is used to check progress.\n\n**Create a new branch so that you can check items like this, just put a x in the brackets: [x]**\n\n- **One time steps**:\n1. Fork this repository. \n2. Clone the forked repository.\n\n      `git clone https://github.com/your_user_name/Get_Better_at_CP_in_2_Months.git`\n    \n3. Create a new branch for tracking your progress. Let's name this *your_user_name*\n\n      `git checkout -b your_user_name`\n      \n4. Add remote\n\n      `git remote add your_user_name https://github.com/your_user_name/Get_Better_at_CP_in_2_Months.git`\n  \n- **Marking tasks as completed and pushing to your branch**:\n\n      git add .\n      git commit -m \"Completed tasks x and y\"\n      git rebase your_user_name/master\n      git push --force\n    \n- **Keeping your fork's list updated with the changes made here**:\n\n      git remote add upstream https://github.com/sahilbansal17/Get_Better_at_CP_in_2_Months.git\n      git checkout master\n      git pull upstream master\n      git push your_user_name master\n\nRefer to [this](https://github.com/susam/gitpr/blob/master/README.md) for understanding more about Fork and PR workflow.\n\n\u003c/details\u003e\n\n***\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsahilbansal17%2FGet_Better_at_CP_in_2_Months","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsahilbansal17%2FGet_Better_at_CP_in_2_Months","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsahilbansal17%2FGet_Better_at_CP_in_2_Months/lists"}