{"id":18518516,"url":"https://github.com/sugaliudaykiran/cpp","last_synced_at":"2025-05-14T15:32:45.943Z","repository":{"id":41454347,"uuid":"436662654","full_name":"sugaliudaykiran/Cpp","owner":"sugaliudaykiran","description":"Lets_go","archived":false,"fork":false,"pushed_at":"2023-01-19T10:11:43.000Z","size":2129,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-17T04:44:01.999Z","etag":null,"topics":["algorithms","cpp","cpp-stl-algorithms","data-structures","gfg-cpp","leetcode","stack"],"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/sugaliudaykiran.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":"2021-12-09T15:16:35.000Z","updated_at":"2023-05-24T07:18:13.000Z","dependencies_parsed_at":"2023-02-10T22:15:39.798Z","dependency_job_id":null,"html_url":"https://github.com/sugaliudaykiran/Cpp","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/sugaliudaykiran%2FCpp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sugaliudaykiran%2FCpp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sugaliudaykiran%2FCpp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sugaliudaykiran%2FCpp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sugaliudaykiran","download_url":"https://codeload.github.com/sugaliudaykiran/Cpp/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254171959,"owners_count":22026554,"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":["algorithms","cpp","cpp-stl-algorithms","data-structures","gfg-cpp","leetcode","stack"],"created_at":"2024-11-06T17:13:38.756Z","updated_at":"2025-05-14T15:32:45.878Z","avatar_url":"https://github.com/sugaliudaykiran.png","language":"C++","readme":"# Cpp\n\n\n\nIf input array is sorted then\n    - Binary search\n    - Two pointers\n\nIf asked for all permutations/subsets then\n    - Backtracking\n\nIf given a tree then\n    - DFS\n    - BFS\n\nIf given a graph then\n    - DFS\n    - BFS\n\nIf given a linked list then\n    - Two pointers\n\nIf recursion is banned then\n    - Stack\n\nIf must solve in-place then\n    - Swap corresponding values\n    - Store one or more different values in the same pointer\n\nIf asked for maximum/minimum subarray/subset/options then\n    - Dynamic programming\n\nIf asked for top/least K items then\n    - Heap\n\nIf asked for common strings then\n    - Map\n    - Trie\n\nElse\n    - Map/Set for O(1) time \u0026 O(n) space\n    - Sort input for O(nlogn) time and O(1) space\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsugaliudaykiran%2Fcpp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsugaliudaykiran%2Fcpp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsugaliudaykiran%2Fcpp/lists"}