{"id":26479277,"url":"https://github.com/va-run23/geeksforgeeks-potd","last_synced_at":"2026-06-23T12:01:58.701Z","repository":{"id":271213270,"uuid":"912312754","full_name":"VA-run23/GeeksforGeeks-POTD","owner":"VA-run23","description":"Namaste, Welcome to the GeeksforGeeks-POTD repository! 🎉  This repository contains C++ solutions to GeeksforGeeks' \"Problem of the Day\" (POTD). It's a valuable resource for practicing and improving your problem-solving skills in C++, covering a wide range of topics and difficulty levels.","archived":false,"fork":false,"pushed_at":"2025-08-18T14:33:04.000Z","size":258,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-08-18T16:23:19.953Z","etag":null,"topics":["arrays","coding-challenge","competitive-coding","competitive-programming","data-structures-and-algorithms","dsa","dsa-practice","geeksforgeeks","geeksforgeeks-cpp","geeksforgeeks-dsa","geeksforgeeks-practice","geeksforgeeks-practice-solutions","geeksforgeeks-solutions","linked-list","matrix","potd-gfg","potd-github","potd-practice","potd-solution","vectors"],"latest_commit_sha":null,"homepage":"https://github.com/VA-run23/GFG-POTD","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/VA-run23.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2025-01-05T07:57:26.000Z","updated_at":"2025-08-18T14:33:07.000Z","dependencies_parsed_at":"2025-02-09T05:18:22.021Z","dependency_job_id":"2426c0ca-c5f8-4c69-8ef5-331efe263fd3","html_url":"https://github.com/VA-run23/GeeksforGeeks-POTD","commit_stats":null,"previous_names":["va-run23/gfg-potd","va-run23/geeksforgeeks-potd"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/VA-run23/GeeksforGeeks-POTD","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/VA-run23%2FGeeksforGeeks-POTD","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/VA-run23%2FGeeksforGeeks-POTD/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/VA-run23%2FGeeksforGeeks-POTD/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/VA-run23%2FGeeksforGeeks-POTD/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/VA-run23","download_url":"https://codeload.github.com/VA-run23/GeeksforGeeks-POTD/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/VA-run23%2FGeeksforGeeks-POTD/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271252993,"owners_count":24726918,"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-08-20T02:00:09.606Z","response_time":69,"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":["arrays","coding-challenge","competitive-coding","competitive-programming","data-structures-and-algorithms","dsa","dsa-practice","geeksforgeeks","geeksforgeeks-cpp","geeksforgeeks-dsa","geeksforgeeks-practice","geeksforgeeks-practice-solutions","geeksforgeeks-solutions","linked-list","matrix","potd-gfg","potd-github","potd-practice","potd-solution","vectors"],"created_at":"2025-03-20T01:40:36.944Z","updated_at":"2026-06-23T12:01:58.691Z","avatar_url":"https://github.com/VA-run23.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# GFG Problem of the Day — C++ Solutions (2025 \u0026 2026)\n\n\nA daily-committed, chronologically organized archive of C++ solutions to the [GeeksforGeeks Problem of the Day](https://www.geeksforgeeks.org/problem-of-the-day). Every solution represents a real submission on the day of its commit: no backdating, no skips, no filler.\n\n---\n\n## Repository Structure\n\n```\nGFG_POTD/\n│\n├── 2025_CPP_SOLUTIONS_POTD/\n│   ├── 01_Jan_2025/\n│   ├── 02_Feb_2025/\n│   ├── 03_Mar_2025/\n│   ├── 04_Apr_2025/\n│   ├── 05_May_2025/\n│   ├── 06_Jun_2025/\n│   ├── 07_Jul_2025/\n│   ├── 08_Aug_2025/\n│   ├── 09_Sep_2025/\n│   ├── 10_Oct_2025/\n│   ├── 11_Nov_2025/\n│   └── 12_Dec_2025/\n│\n└── 2026_CPP_SOLUTIONS_POTD/\n    ├── 01_Jan_2026/\n    ├── 02_Feb_2026/\n    ├── 03_Mar_2026/\n    ├── 04_Apr_2026/\n    └── 05_May_2026/\n            ...\n```\n\nSolutions are organized **year-wise, then month-wise**. Each file is named `POTD_DD_MM_YYYY.cpp` and committed on the day it was solved, with the commit timestamp reflecting the actual solve time in IST.\n\n---\n\n## How to Use This Repository\n\nIf you are stuck on a GFG POTD, here is the recommended way to use this archive:\n\n1. Navigate to the folder for the relevant year and month\n2. Open the `.cpp` file for the date you need\n3. Read the solution, understand the approach, then close it and try it yourself\n\nEvery file follows the same structure: includes, class or function definition, and a clean implementation. No bloated boilerplate, no copied editorial text, just the working solution.\n\n---\n\n## What This Repository Covers\n\n**Data Structures**\n- Arrays, strings, linked lists, stacks, queues\n- Binary trees, BSTs, heaps, tries\n- Graphs: adjacency list and matrix representations\n- Segment trees, sparse tables, disjoint set union\n\n**Algorithms**\n- Dynamic programming: memoization and tabulation\n- Greedy approaches, divide and conquer\n- Graph traversal: BFS, DFS, Dijkstra, Floyd-Warshall\n- Backtracking, bit manipulation, two pointers, sliding window\n\n**Difficulty Range:** Easy through Hard, as set by GFG daily.\n\n---\n\n## Consistency Record\n\nThis repository is part of an unbroken daily coding habit maintained across GitHub, LeetCode, and GeeksforGeeks.\n\n| Metric | Value |\n| --- | --- |\n| Current streak | 503+ consecutive days |\n| Solutions committed | 500+ |\n| Language | C++ throughout |\n| Commit policy | One solution per day, committed on the day itself |\n\nThe commit history of this repository reflects real daily effort. Each timestamp is the actual time the solution was written and pushed.\n\n---\n\n## About the Git History\n\nThe git history of the 2026 folder was rewritten once, in May 2026. This was not to alter content or fake timestamps: the solutions, the dates, and the commit messages are all accurate. The rewrite was necessary to correct a naming convention error (`POTD_DD_MM_2025.cpp` instead of `POTD_DD_MM_2026.cpp`) that went unnoticed across 132 consecutive commits, discovered only when an unrelated git misconfiguration caused two days to disappear from the contribution graph.\n\nThe full story, including how the bug was found, how the files were lost and recovered, and what was learned from it, is documented openly:\n\n\u003e **[132 Days of a Silent Bug, One Night of Recovery](https://vskript.netlify.app/post/29)**\n\u003e *An honest account of the naming bug, the file deletion, the VS Code history recovery, and the git history rewrite that brought 503 days of streak back from nothing.*\n\nIf you noticed unusual commit SHAs or a rewritten history in the 2026 folder, that post explains exactly what happened and why.\n\n---\n\n## Connect\n\n| Platform | Link |\n| --- | --- |\n| GitHub | [VA-run23](https://github.com/VA-run23) |\n| Blog | [VSKript](https://vskript.netlify.app) |\n| GFG Profile | [GeeksforGeeks](https://www.geeksforgeeks.org/profile/neurovarun23) |\n\n---\n\n*Solved daily. Committed honestly. Documented openly.*\n\n\u003cp align=\"center\"\u003e\n  \u003cimg src=\"https://komarev.com/ghpvc/?username=VA-run\u0026color=0e75b6\" alt=\"Profile Views\" /\u003e\n\u003c/p\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fva-run23%2Fgeeksforgeeks-potd","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fva-run23%2Fgeeksforgeeks-potd","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fva-run23%2Fgeeksforgeeks-potd/lists"}