Introduction
Table of Content
Computer Science
Algorithms
1.
Data Structure & Algorithms
1.1.
Array
1.1.1.
Find Kth Smallest in Two Sorted Arrays
1.2.
Linked List
1.3.
String/Expression
1.4.
Binary Tree
1.4.1.
Binary Index Tree
1.5.
Graph
1.6.
Dynamic Programming/Backtrack
1.6.1.
Subsets
1.6.2.
Combinations
1.6.3.
Permutations
1.7.
Bit Manipulation
1.7.1.
Add without Plus
1.8.
Geometry
1.9.
Math
1.9.1.
Greatest Common Divisor
Computer Network
2.
Computer Network
2.1.
Concepts
Operating System
Linux
Software Design
3.
System Design
3.1.
Volcabulary
3.2.
Common Algorithms
3.3.
Useful Numbers
3.4.
Common Questions
3.4.1.
Notification System
4.
Database
5.
Concepts
Interview
6.
Leetcode
6.1.
Questions List
6.2.
Frequently Used Python Functions
6.3.
Frequently Used C++ Functions
6.4.
Question Series
6.5.
Array
6.5.1.
Median of Two Sorted Arrays
6.5.2.
Container With Most Water
6.5.3.
4Sum
6.5.4.
Generate Parentheses
6.5.5.
Longest Valid Parentheses
6.5.6.
Search in Rotated Sorted Array
6.5.7.
Maximum Subarray (Kadane's Algorithm)
6.5.8.
Jump Game
6.5.9.
Sort Colors
6.5.10.
Search in Rotated Sorted Array II
6.5.11.
Largest Rectangle in Histogram
6.5.12.
Merge Sorted Array (in place)
6.5.13.
Longest Consecutive Sequence
6.5.14.
Candy
6.5.15.
Maximum Product Subarray
6.5.16.
Find Peak Element
6.5.17.
Two Sum II - Input Array Is Sorted
6.5.18.
Kth Largest Element in an Array
6.5.19.
Implement Stack using Queues
6.5.20.
Implement Queue using Stacks
6.5.21.
Sliding Window Maximum
6.5.22.
Find Median from Data Stream
6.5.23.
Longest Increasing Subsequence
6.5.24.
Remove Invalid Parentheses
6.5.25.
Count of Smaller Numbers After Self
6.5.26.
Remove Duplicate Letters
6.5.27.
Flatten Nested List Iterator
6.5.28.
Top K Frequent Elements
6.5.29.
Max Sum of Rectangle No Larger Than K
6.5.30.
Remove K Digits
6.5.31.
Non-overlapping Intervals
6.5.32.
Find Permutation
6.5.33.
Brick Wall
6.5.34.
Shortest Unsorted Continuous Subarray
6.5.35.
Find K Closest Elements
6.5.36.
Maximum Swap
6.5.37.
Count Binary Substrings
6.5.38.
Maximum Frequency Stack
6.5.39.
Subarrays with K Different Integers
6.5.40.
Max Consecutive Ones III
6.5.41.
Maximum Profit in Job Scheduling
6.5.42.
Count Number of Nice Subarrays
6.5.43.
Iterator for Combination
6.5.44.
Remove Covered Intervals
6.5.45.
Leftmost Column with at Least a One
6.5.46.
Find the Most Competitive Subsequence
6.5.47.
Jump Game VI
6.5.48.
Minimum Limit of Balls in a Bag
6.5.49.
Find Kth Largest XOR Coordinate Value
6.5.50.
Car Fleet II
6.5.51.
Jump Game VII
6.5.52.
Number of Visible People in a Queue
6.6.
Linked List
6.6.1.
Merge Two Sorted Lists
6.6.2.
Reorder List
6.6.3.
LRU Cache
6.6.4.
Intersection of Two Linked Lists
6.6.5.
Palindrome Linked List
6.6.6.
Find the Duplicate Number
6.6.7.
LFU Cache
6.6.8.
Lowest Common Ancestor of a Binary Tree III
6.7.
Priority Queue
6.7.1.
Kth Largest Element in a Stream
6.7.2.
Swim in Rising Water
6.7.3.
Amount of New Area Painted Each Day
6.8.
String/Expression
6.8.1.
Regular Expression Matching
6.8.2.
Minimum Window Substring
6.8.3.
Palindrome Partitioning II
6.8.4.
Basic Calculator I
6.8.5.
Basic Calculator II
6.8.6.
Strong Password Checker
6.8.7.
Basic Calculator III
6.8.8.
Build Binary Expression Tree From Infix Expression
6.8.9.
Check if an Original String Exists Given Two Encoded Strings
6.9.
Binary Tree
6.9.1.
Recover Binary Search Tree
6.9.2.
Binary Tree Maximum Path Sum
6.9.3.
Binary Tree Right Side View
6.9.4.
Lowest Common Ancestor of a Binary Tree
6.9.5.
Inorder Successor in BST
6.9.6.
Range Sum Query - Mutable
6.9.7.
Count of Smaller Numbers After Self
6.9.8.
Path Sum III
6.9.9.
Check Completeness of a Binary Tree
6.10.
Tree
6.10.1.
Word Break II
6.10.2.
Word Search II
6.10.3.
My Calendar I
6.10.4.
Short Encoding of Words
6.10.5.
Maximum XOR With an Element From Array
6.10.6.
Stock Price Fluctuation
6.11.
Graph
6.11.1.
Course Schedule II
6.11.2.
Shortest Distance from All Buildings
6.11.3.
Reconstruct Itinerary
6.11.4.
Cheapest Flights Within K Stops
6.11.5.
Shortest Path Visiting All Nodes
6.11.6.
Shortest Path in a Grid with Obstacles Elimination
6.11.7.
Critical Connections in a Network
6.11.8.
Minimum Cost to Reach Destination in Time
6.11.9.
Process Restricted Friend Requests
6.12.
Dynamic Programming/Backtrack
6.12.1.
Combination Sum
6.12.2.
N-Queens
6.12.3.
Edit Distance
6.12.4.
Subsets
6.12.5.
Interleaving String
6.12.6.
Best Time to Buy and Sell Stock IV
6.12.7.
Expression Add Operators
6.12.8.
Best Time to Buy and Sell Stock with Cooldown
6.12.9.
Burst Balloons
6.12.10.
Coin Change
6.12.11.
Split Array Largest Sum
6.12.12.
Robot Room Cleaner
6.12.13.
Longest Palindromic Subsequence
6.12.14.
Coin Change 2
6.12.15.
K Inverse Pairs Array
6.12.16.
Partition to K Equal Sum Subsets
6.12.17.
Best Time to Buy and Sell Stock with Transaction Fee
6.12.18.
Maximum Length of Repeated Subarray
6.12.19.
Delete and Earn
6.12.20.
Race Car
6.12.21.
Minimum Distance to Type a Word Using Two Fingers
6.12.22.
Jump Game V
6.12.23.
Maximize Score After N Operations
6.12.24.
Painting a Grid With Three Different Colors
6.12.25.
Maximum Number of Points with Cost
6.12.26.
First Day Where You Have Been in All the Rooms
6.13.
Bit Manipulation
6.13.1.
Divide Two Integers
6.13.2.
Add Binary
6.13.3.
Single Number
6.13.4.
Single Number II
6.13.5.
Single Number III
6.14.
Geometry
6.14.1.
Circle and Rectangle Overlapping
6.15.
Multi-Threading
6.15.1.
Web Crawler Multithreaded
6.16.
Others
6.16.1.
Random Pick Index
6.16.2.
Erect the Fence
Casual
7.
Resources
7.1.
Github
7.2.
System Design
7.3.
Machine Learning
Light (default)
Rust
Coal
Navy
Ayu
Learning On the Way
Concepts
Transaction Isolation Levels
Read Committed
Repeatable Read
Serializable