{"id":18664992,"url":"https://github.com/arnavbee/data-structures-and-algorithms","last_synced_at":"2026-01-05T20:43:33.699Z","repository":{"id":251261142,"uuid":"836877827","full_name":"arnavbee/data-structures-and-algorithms","owner":"arnavbee","description":"Collection of solutions of all the problems in SDE Sheet \u0026 Blind75.","archived":false,"fork":false,"pushed_at":"2024-09-13T16:28:16.000Z","size":103,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-25T19:21:33.035Z","etag":null,"topics":["algorithms","blind75","data-structures-and-algorithms","leetcode"],"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/arnavbee.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":"2024-08-01T18:39:20.000Z","updated_at":"2025-01-30T16:11:27.000Z","dependencies_parsed_at":"2024-09-14T06:23:04.745Z","dependency_job_id":null,"html_url":"https://github.com/arnavbee/data-structures-and-algorithms","commit_stats":null,"previous_names":["arnavbee/data-structures-and-algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arnavbee%2Fdata-structures-and-algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arnavbee%2Fdata-structures-and-algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arnavbee%2Fdata-structures-and-algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arnavbee%2Fdata-structures-and-algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/arnavbee","download_url":"https://codeload.github.com/arnavbee/data-structures-and-algorithms/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248489486,"owners_count":21112583,"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","blind75","data-structures-and-algorithms","leetcode"],"created_at":"2024-11-07T08:25:49.531Z","updated_at":"2026-01-05T20:43:28.660Z","avatar_url":"https://github.com/arnavbee.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Table Of Contents\n- [Arrays](arrays/)\n- [Dynamic Programming](dynamic-programming/)\n- [Graphs](graphs/)\n- [Queue](queue/)\n- [Stack](stack/)\n\n\n# Arrays [🔗](arrays/)\n- [Best Time to Buy and Sell Stocks](arrays/best-time-to-buy-and-sell-stocks.cpp)\n- [Contains Duplicate](arrays/contains-duplicate.cpp)\n- [Longest Consequence](arrays/longest-consequence.cpp)\n- [Maximum Product Subarray](arrays/maximum-product-subarray.cpp)\n- [Reverse Pairs](arrays/reverse-pairs.cpp)\n- [Minimum In Rotated Sorted](arrays/minimum-in-rotated-sorted.cpp)\n- [Inversion of Array](arrays/inversion-of-array.cpp)\n- [Find Missing Repeating Number](arrays/find-missing-repeating-number.cpp)\n- [Container With Most Water](arrays/container-with-most-water.cpp)\n- [Find All Duplicates in an Array](arrays/find-all-duplicates.cpp)\n\n# Dynamic Programming [🔗](dynamic-programming/)\n- [Fibonacci](dynamic-programming/01-Fibonacci.cpp)\n- [Climbing Stars](dynamic-programming/02-ClimbingStairs.cpp)\n- [House Robber](dynamic-programming/03-HouseRobber.cpp)\n- [House Robber 2](dynamic-programming/04-HouseRobber2.cpp)\n- [Unique Path](dynamic-programming/05-UniquePath.cpp)\n- [Unique Path 2](dynamic-programming/06-UniquePath-2.cpp)\n- [Minimum Path Sum](dynamic-programming/07-MinimumPathSum.cpp)\n- [Word Break](dynamic-programming/WordBreak.cpp)\n\n# Graphs [🔗](graphs/)\n- [BFS](graphs/BFS.cpp) [🔗](https://www.geeksforgeeks.org/problems/bfs-traversal-of-graph/1)\n- [DFS](graphs/DFS.cpp) [🔗](https://www.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/1)\n- [Bellman Ford](graphs/BellmanFord.cpp)\n- [Bipartite BFS](graphs/BipartiteBFS.cpp)\n- [Bipartite DFS](graphs/BipartiteDFS.cpp)\n- [Clone Graph](graphs/CloneGraph.cpp)\n- [Course Schedule](graphs/CourseSchedule.cpp)\n- [Course Schedule 2](graphs/CourseSchedule2.cpp)\n- [Cycle Directed BFS](graphs/CycleDirectedBFS.cpp)\n- [Cycle Directed DFS](graphs/CycleDirectedDFS.cpp)\n- [Cycle Undirected BFS](graphs/CycleUndirectedBFS.cpp)\n- [Cycle Undirected DFS](graphs/CycleUndirectedDFS.cpp)\n- [Dijkstra](graphs/Dijkstra-01.cpp)\n- [Dijkstra Using Set](graphs/Dijkstra02-UsingSet.cpp)\n- [Floyd Warshall](graphs/FloydWarshall.cpp)\n- [Islands BFS](graphs/IslandsBFS.cpp)\n- [Kosaraju](graphs/Kosaraju.cpp)\n- [Prims Algorithm](graphs/PrimsAlgorithm.cpp)\n- [Rotting Oranges](graphs/RottingOranges.cpp)\n- [Topo Sort BFS](graphs/TopoSortBFS.cpp)\n- [Topological Sort DFS](graphs/TopologicalSortDFS.cpp)\n\n\n# Queue [🔗](queue/)\n- [Queue Intro](queue/queueintro.cpp)\n- [Queue Implementation](queue/queue-implementation.cpp)\n- [Stack using Queue](queue/stack-using-queue.cpp)\n\n\n# Stack [🔗](stack/)\n- [Stack Intro](stack/stackintro.cpp)\n- [Stack Implementation](stack/stack-implementation.cpp)\n- [Valid Parenthesis](stack/valid-parenthesis.cpp)\n- [Minimum Stack](stack/Minimum-Stack.cpp)\n- [LRU-Cache](stack/LRU-Cache.cpp)\n\n\n# Linked List [🔗](linked-list/)\n- [Add Two Numbers](linked-list/add-two-numbers.cpp)\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farnavbee%2Fdata-structures-and-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Farnavbee%2Fdata-structures-and-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farnavbee%2Fdata-structures-and-algorithms/lists"}