161 lines
3.3 KiB
Markdown
161 lines
3.3 KiB
Markdown
```
|
|
__
|
|
_____ _____ ____ ____ / /____ _____
|
|
/ ___/ / ___/ / __ \/ __ \/ __/ _ \/ ___/
|
|
/ /__ (__ ) / / / / /_/ / /_/ __(__ )
|
|
\___/ /____/ /_/ /_/\____/\__/\___/____/
|
|
|
|
```
|
|
|
|
# CS notes
|
|
|
|
This is where I store notes about CS
|
|
|
|
___
|
|
|
|
## Lists
|
|
#### Needs more understandings #CS_list_need_understanding
|
|
```expander
|
|
tag:#CS_list_need_understanding
|
|
- [ ] [[$filename]]
|
|
```
|
|
|
|
- [ ] [[Leetcode Reverse-Linked-List]]
|
|
|
|
|
|
|
|
#### Needs practicing #CS_list_need_practicing
|
|
```expander
|
|
tag:#CS_list_need_practicing
|
|
- [ ] [[$filename]]
|
|
```
|
|
|
|
- [ ] [[Leetcode Reverse-Linked-List]]
|
|
|
|
|
|
|
|
## Websites
|
|
|
|
#### [leetcode.com](https://leetcode.com)
|
|
|
|
```expander
|
|
tag:#leetcode
|
|
- [[$filename]]
|
|
```
|
|
|
|
- [[Leetcode Valid-Parentheses]]
|
|
- [[Leetcode Best-Time-To-Buy-And-Sell-Stock]]
|
|
- [[Leetcode First-Unique-Character-In-a-String]]
|
|
- [[Leetcode Intersection-of-Two-Arrays-II]]
|
|
- [[Leetcode Linked-List-Cycle]]
|
|
- [[Leetcode Maxinum-subarray]]
|
|
- [[Leetcode Merge-Sorted-Array]]
|
|
- [[Leetcode Merge-Two-Sorted-Lists]]
|
|
- [[Leetcode Pascal's-Triangle]]
|
|
- [[Leetcode Ransom-Note]]
|
|
- [[Leetcode Remove-Duplicates-From-Sorted-List]]
|
|
- [[Leetcode Remove-Linked-List-Elements]]
|
|
- [[Leetcode Reshape-The-Matrix]]
|
|
- [[Leetcode Reverse-Linked-List]]
|
|
- [[Leetcode Search-a-2D-Matrix]]
|
|
- [[Leetcode Two-Sum]]
|
|
- [[Leetcode Valid-Anagram]]
|
|
- [[Leetcode Valid-Sodoku]]
|
|
|
|
|
|
|
|
#### [hackerearth.com](https://www.hackerearth.com/)
|
|
|
|
```expander
|
|
tag:#hackerearch
|
|
- [[$filename]]
|
|
```
|
|
|
|
|
|
|
|
|
|
|
|
|
|
___
|
|
## Data Structure
|
|
#### Coding problems
|
|
```expander
|
|
tag:#DS tag:#coding_problem -tag:#template_remove_me
|
|
- [[$filename]]
|
|
```
|
|
|
|
- [[Leetcode Valid-Parentheses]]
|
|
- [[Leetcode Best-Time-To-Buy-And-Sell-Stock]]
|
|
- [[Leetcode First-Unique-Character-In-a-String]]
|
|
- [[Leetcode Intersection-of-Two-Arrays-II]]
|
|
- [[Leetcode Linked-List-Cycle]]
|
|
- [[Leetcode Maxinum-subarray]]
|
|
- [[Leetcode Merge-Sorted-Array]]
|
|
- [[Leetcode Merge-Two-Sorted-Lists]]
|
|
- [[Leetcode Pascal's-Triangle]]
|
|
- [[Leetcode Ransom-Note]]
|
|
- [[Leetcode Remove-Duplicates-From-Sorted-List]]
|
|
- [[Leetcode Remove-Linked-List-Elements]]
|
|
- [[Leetcode Reshape-The-Matrix]]
|
|
- [[Leetcode Reverse-Linked-List]]
|
|
- [[Leetcode Search-a-2D-Matrix]]
|
|
- [[Leetcode Two-Sum]]
|
|
- [[Leetcode Valid-Anagram]]
|
|
- [[Leetcode Valid-Sodoku]]
|
|
|
|
|
|
|
|
#### Analysis
|
|
```expander
|
|
tag:#DS tag:#CS_analysis -tag:#template_remove_me
|
|
- [[$filename]]
|
|
```
|
|
|
|
- [[cpp_Range_based_for_loop]]
|
|
- [[cpp_std_multiset]]
|
|
- [[cpp_std_unordered_map]]
|
|
|
|
|
|
|
|
___
|
|
## Algorithm
|
|
#### Coding problems
|
|
```expander
|
|
tag:#algorithm tag:#coding_problem -tag:#template_remove_me
|
|
- [[$filename]]
|
|
```
|
|
|
|
- [[Leetcode Best-Time-To-Buy-And-Sell-Stock]]
|
|
- [[Leetcode First-Unique-Character-In-a-String]]
|
|
- [[Leetcode Intersection-of-Two-Arrays-II]]
|
|
- [[Leetcode Linked-List-Cycle]]
|
|
- [[Leetcode Maxinum-subarray]]
|
|
- [[Leetcode Merge-Sorted-Array]]
|
|
- [[Leetcode Merge-Two-Sorted-Lists]]
|
|
- [[Leetcode Pascal's-Triangle]]
|
|
- [[Leetcode Ransom-Note]]
|
|
- [[Leetcode Reverse-Linked-List]]
|
|
- [[Leetcode Search-a-2D-Matrix]]
|
|
- [[Leetcode Two-Sum]]
|
|
- [[Leetcode Valid-Anagram]]
|
|
|
|
|
|
|
|
|
|
|
|
#### Analysis
|
|
|
|
```expander
|
|
tag:#algorithm tag:#CS_analysis -tag:#template_remove_me
|
|
- [[$filename]]
|
|
```
|
|
|
|
- [[Binary Search Algorithm]]
|
|
- [[cpp_std_sort]]
|
|
- [[Floyd's Cycle Finding Algorithm]]
|
|
- [[Kadane's Algorithm]]
|
|
- [[Two pointers approach]]
|
|
|
|
|
|
|
|
|