qwertyboss

https://www.pramp.com/question/lK4AoGA0E5SgKL5MLmVw

Be better at
- competitive coding
- ML system design
- understanding AI research papers

- basics
- inferential stats

Algorithms: Largest Smaller BST Key @9:30 pm

https://leetcode.com/problems/accounts-merge/
Pattern: connected graph

- Project metrics: https://psvishnu.substack.com/p/summary-critical-project-metrics
- Collected new use cases
- Started working on a new use case

Pattern: Graph DFS/BFS
Complexity: T:O(2^N), S:O(N)

- Find Target Indices After Sorting Array. Pattern: sorting
- K Radius Subarray Averages. Pattern: Sliding Window
- Removing Minimum and Maximum from Array, Pattern: ???
- Find All people with Secret, Pattern: Graph

1. Count Common Words With One Occurrence
2. Minimum Number of Buckets Required to Collect Rainwater from Houses
3. Minimum Cost Homecoming of a Robot in a Grid
4. Count Fertile Pyramids in a Land

Optimized solution: T:O(n) S:O(1)
Pattern: Prefix and Suffix sum

Pattern: binary search
Time: O(logn)
Space: O(1)

https://leetcode.com/problems/interval-list-intersections/

Important point: Know what are intersecting points and the formula to find intersection is max(x1,x2) and min(y1,y2)