https://github.com/arnavbee/data-structures-and-algorithms

Collection of solutions of all the problems in SDE Sheet & Blind75.
https://github.com/arnavbee/data-structures-and-algorithms

algorithms blind75 data-structures-and-algorithms leetcode

Last synced: 9 days ago
JSON representation

Collection of solutions of all the problems in SDE Sheet & Blind75.

• Host: GitHub
• URL: https://github.com/arnavbee/data-structures-and-algorithms
• Owner: arnavbee
• Created: 2024-08-01T18:39:20.000Z (4 months ago)
• Default Branch: main
• Last Pushed: 2024-09-13T16:28:16.000Z (2 months ago)
• Last Synced: 2024-09-14T07:22:25.088Z (2 months ago)
• Topics: algorithms, blind75, data-structures-and-algorithms, leetcode
• Language: C++
• Homepage:
• Size: 101 KB
• Stars: 2
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Table Of Contents

- [Arrays](arrays/)

- [Dynamic Programming](dynamic-programming/)

- [Graphs](graphs/)

- [Queue](queue/)

- [Stack](stack/)

# Arrays [🔗](arrays/)

- [Best Time to Buy and Sell Stocks](arrays/best-time-to-buy-and-sell-stocks.cpp)

- [Contains Duplicate](arrays/contains-duplicate.cpp)

- [Longest Consequence](arrays/longest-consequence.cpp)

- [Maximum Product Subarray](arrays/maximum-product-subarray.cpp)

- [Reverse Pairs](arrays/reverse-pairs.cpp)

- [Minimum In Rotated Sorted](arrays/minimum-in-rotated-sorted.cpp)

- [Inversion of Array](arrays/inversion-of-array.cpp)

- [Find Missing Repeating Number](arrays/find-missing-repeating-number.cpp)

- [Container With Most Water](arrays/container-with-most-water.cpp)

- [Find All Duplicates in an Array](arrays/find-all-duplicates.cpp)

# Dynamic Programming [🔗](dynamic-programming/)

- [Fibonacci](dynamic-programming/01-Fibonacci.cpp)

- [Climbing Stars](dynamic-programming/02-ClimbingStairs.cpp)

- [House Robber](dynamic-programming/03-HouseRobber.cpp)

- [House Robber 2](dynamic-programming/04-HouseRobber2.cpp)

- [Unique Path](dynamic-programming/05-UniquePath.cpp)

- [Unique Path 2](dynamic-programming/06-UniquePath-2.cpp)

- [Minimum Path Sum](dynamic-programming/07-MinimumPathSum.cpp)

- [Word Break](dynamic-programming/WordBreak.cpp)

# Graphs [🔗](graphs/)

- [BFS](graphs/BFS.cpp) [🔗](https://www.geeksforgeeks.org/problems/bfs-traversal-of-graph/1)

- [DFS](graphs/DFS.cpp) [🔗](https://www.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/1)

- [Bellman Ford](graphs/BellmanFord.cpp)

- [Bipartite BFS](graphs/BipartiteBFS.cpp)

- [Bipartite DFS](graphs/BipartiteDFS.cpp)

- [Clone Graph](graphs/CloneGraph.cpp)

- [Course Schedule](graphs/CourseSchedule.cpp)

- [Course Schedule 2](graphs/CourseSchedule2.cpp)

- [Cycle Directed BFS](graphs/CycleDirectedBFS.cpp)

- [Cycle Directed DFS](graphs/CycleDirectedDFS.cpp)

- [Cycle Undirected BFS](graphs/CycleUndirectedBFS.cpp)

- [Cycle Undirected DFS](graphs/CycleUndirectedDFS.cpp)

- [Dijkstra](graphs/Dijkstra-01.cpp)

- [Dijkstra Using Set](graphs/Dijkstra02-UsingSet.cpp)

- [Floyd Warshall](graphs/FloydWarshall.cpp)

- [Islands BFS](graphs/IslandsBFS.cpp)

- [Kosaraju](graphs/Kosaraju.cpp)

- [Prims Algorithm](graphs/PrimsAlgorithm.cpp)

- [Rotting Oranges](graphs/RottingOranges.cpp)

- [Topo Sort BFS](graphs/TopoSortBFS.cpp)

- [Topological Sort DFS](graphs/TopologicalSortDFS.cpp)

# Queue [🔗](queue/)

- [Queue Intro](queue/queueintro.cpp)

- [Queue Implementation](queue/queue-implementation.cpp)

- [Stack using Queue](queue/stack-using-queue.cpp)

# Stack [🔗](stack/)

- [Stack Intro](stack/stackintro.cpp)

- [Stack Implementation](stack/stack-implementation.cpp)

- [Valid Parenthesis](stack/valid-parenthesis.cpp)

- [Minimum Stack](stack/Minimum-Stack.cpp)

- [LRU-Cache](stack/LRU-Cache.cpp)

# Linked List [🔗](linked-list/)

- [Add Two Numbers](linked-list/add-two-numbers.cpp)