{"id":26575588,"url":"https://github.com/ahnaf1524/become-cf-pupil","last_synced_at":"2025-03-23T02:19:34.335Z","repository":{"id":276276032,"uuid":"928775909","full_name":"ahnaf1524/become-cf-pupil","owner":"ahnaf1524","description":"Journey to become a Codeforces Pupil! Practice problem-solving, master algorithms, and track progress step by step","archived":false,"fork":false,"pushed_at":"2025-03-21T09:51:48.000Z","size":4,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-21T10:39:58.327Z","etag":null,"topics":["competitive","cpp17","datastructures-algorithms","programming"],"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/ahnaf1524.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}},"created_at":"2025-02-07T08:09:43.000Z","updated_at":"2025-03-21T09:51:51.000Z","dependencies_parsed_at":null,"dependency_job_id":"563b5ce2-c9c7-4388-9df8-bef1e97e28c7","html_url":"https://github.com/ahnaf1524/become-cf-pupil","commit_stats":null,"previous_names":["ahnaf1524/local-connect","ahnaf1524/become-cf-pupil"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahnaf1524%2Fbecome-cf-pupil","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahnaf1524%2Fbecome-cf-pupil/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahnaf1524%2Fbecome-cf-pupil/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahnaf1524%2Fbecome-cf-pupil/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ahnaf1524","download_url":"https://codeload.github.com/ahnaf1524/become-cf-pupil/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245045021,"owners_count":20551964,"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":["competitive","cpp17","datastructures-algorithms","programming"],"created_at":"2025-03-23T02:19:33.858Z","updated_at":"2025-03-23T02:19:34.316Z","avatar_url":"https://github.com/ahnaf1524.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# Become CF Pupil Anyhow Within 4 Months 💪\n\n## Goal 🏆\nThe primary goal of this repository is to achieve the **Codeforces Pupil** rank within **4 months** through consistent problem-solving and mastering fundamental algorithms and data structures.\n\n---\n\n## Learning Objectives 📚\n\n### 🔢 Array Basics\n- 1D and 2D arrays\n- Basic array operations:\n  - Minimum and maximum element search\n  - Linear search\n  - Insertion, deletion, and updation\n  - Reverse and swap\n  - Removing duplicates\n  - Sum of array elements\n- Built-in functions from `\u003carray\u003e` library\n\n---\n\n### 📐 Vectors and Their Operations\n- Basics of vectors and useful functions\n- Multi-dimensional vectors\n- Problem-solving using vectors\n\n---\n\n### ✨ String Manipulation\n- String basics and built-in functions\n- String operations:\n  - Concatenation\n  - Reversal\n  - Palindrome check\n  - Anagram check\n- Solving basic string problems\n\n---\n\n### 🧰 Standard Template Library (STL)\n- Reviewing and mastering STL functions for competitive programming\n- Revising essential functions commonly used in contests\n\n---\n\n### 📝 Problem-Solving Plan\n- Solve **150 implementation problems** on Codeforces within **40 days**  \n  [Implementation Problemset (sorted by most solved)](https://codeforces.com/problemset?order=BY_SOLVED_DESC)\n\n---\n\n### 💡 Algorithmic Concepts\n- Bitwise operations and problem-solving\n- Time and space complexity analysis\n- Searching algorithms:\n  - Binary Search\n- Sorting algorithms:\n  - Merge Sort\n  - `std::sort()`\n\n---\n\n### 🏗️ Problem-Solving Paradigms\n- Greedy Algorithms\n- Constructive Algorithms\n- Brute Force\n- Implementation Techniques\n- Two Pointers Technique\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fahnaf1524%2Fbecome-cf-pupil","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fahnaf1524%2Fbecome-cf-pupil","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fahnaf1524%2Fbecome-cf-pupil/lists"}