-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
2e464a1
commit aac3a3a
Showing
2 changed files
with
51 additions
and
4 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,14 +1,12 @@ | ||
## [practicing efficiently](https://leetcode.com/discuss/study-guide/2009997/how-to-get-started-with-dsa-and-practice-leetcode-efficiently ) | ||
> useful resource for getting better at dsa/leetcode. | ||
|
||
## [Study plan](https://leetcode.com/discuss/study-guide/494279/Comprehensive-Data-Structure-and-Algorithm-Study-Guide) | ||
> resources for Datastructure and algorithms. | ||
## [Graphs](https://leetcode.com/discuss/study-guide/655708/Graph-For-Beginners-Problems-or-Pattern-or-Sample-Solutions) | ||
> templets and curated list of graph problems. | ||
|
||
|
||
## [OOP](https://leetcode.com/discuss/study-guide/1852219/Object-Oriented-Programming-Made-Easy) | ||
> OOP Main ideas. | ||
> OOP Main ideas. | ||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,49 @@ | ||
# Topics | ||
|
||
# Two Pointers | ||
# Binary Search | ||
# Sliding Window | ||
# Prefix Sum | ||
[prefix sum](https://leetcode.com/discuss/general-discussion/563022/prefix-sum-problems) | ||
|
||
|
||
# Hash Table | ||
# Stack | ||
# Queue | ||
## Sets | ||
|
||
## Divide and Conquer | ||
## Recursion | ||
|
||
[Recursion](https://leetcode.com/discuss/study-guide/1733447/Become-Master-In-Recursion) | ||
|
||
# Backtracking | ||
# Dynamic Programming | ||
Resources: youtube video on freecodecamp | ||
|
||
[dynamic programming patterns](https://leetcode.com/discuss/study-guide/458695/Dynamic-Programming-Patterns) | ||
|
||
|
||
|
||
# Greedy | ||
# Bit Manipulation | ||
# String Manipulation | ||
# Tree | ||
# Graph | ||
- DFS | ||
- BFS | ||
- Topological Sort | ||
- Shortest Path | ||
- Minimum Spanning Tree | ||
- union find | ||
|
||
# Sort | ||
# Search | ||
# Math | ||
|
||
|
||
# Array | ||
# Trie | ||
# Linked List | ||
# Binary Search Tree | ||
# Heap |