{"id":23893816,"url":"https://github.com/tanjib-rafi/leetcode","last_synced_at":"2025-02-23T06:15:51.866Z","repository":{"id":139645694,"uuid":"444819361","full_name":"Tanjib-Rafi/Leetcode","owner":"Tanjib-Rafi","description":null,"archived":false,"fork":false,"pushed_at":"2022-03-06T18:19:56.000Z","size":85,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-04T14:41:46.517Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","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/Tanjib-Rafi.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":"2022-01-05T13:45:39.000Z","updated_at":"2023-01-25T18:58:02.000Z","dependencies_parsed_at":null,"dependency_job_id":"a0ac4b9c-c70d-443b-8488-aeb6e459e0c3","html_url":"https://github.com/Tanjib-Rafi/Leetcode","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/Tanjib-Rafi%2FLeetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tanjib-Rafi%2FLeetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tanjib-Rafi%2FLeetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tanjib-Rafi%2FLeetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Tanjib-Rafi","download_url":"https://codeload.github.com/Tanjib-Rafi/Leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240275909,"owners_count":19775615,"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":[],"created_at":"2025-01-04T14:40:27.847Z","updated_at":"2025-02-23T06:15:51.855Z","avatar_url":"https://github.com/Tanjib-Rafi.png","language":"Python","readme":"If 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/minumum 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%2Ftanjib-rafi%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftanjib-rafi%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftanjib-rafi%2Fleetcode/lists"}