Tech Notes
Dp on strings
Initializing search
advpetc/Tech_Notes
Tech Notes
advpetc/Tech_Notes
Welcome to Peter's Tech Notes
About
Acwing
Acwing
1142 繁忙的都市
895. 最长上升子序列 (LCIS)
905 区间选点
906 区间分组
区间覆盖
最大不相交区间数量
Lca最小公共祖先
Topological Sort
算法基础课
Google Kick Start
Google Kick Start
2020 Round A
2020 Round B
Past Interview: Design a Minesweeper
Interview
Interview
Internet Protocol (计算机网络)
Interview questions and their answers
All Vaid Permutation of Parentheses
Array
Balanced Search Trees
Behavior Questions
Binary Search
Choose k cards and find the maximum
Count Array Inversion
Property for a heap (min heap for example)
Notes for a mock interview
Dynamic Programming 1
Dynamic Programming 4
Final Exam
Find longest substring at most k characters
Find minimum in rotated sorted array
First non repeating character in stream
Graph
Greedy Algorithm
Goldman Sachs
Hashmap
K sum problem
Keep distance for identical elements
Knight Dialer
Kth problem
Linked List
Lowest Common Ancester Problems
Majority Element with k times
Math
Maximum Product Subarray
Midterm
Object Oriented Design
2 Dimension Dynamic Programming
Recursion and Tree
Recursion
Russian Doll
Searcg in Bitonic Array
Serializing and Deserializing a tree
Singleton
Sorting Algorithms
Stack and Queue
String Match
String
Subset, combination, Permutation Problems
System Design Questions
Tree
午间课堂
每日打卡
Java
Java
Serialization
Useful notes and codes for Java
Common problem
Comparison with other languages
Control flow and methods
Primitive types and basic operations
Tips
Leetcode
Leetcode
0002. Add Two Numbers
0003. Longest Substring Without Repeating Characters
0004. Median of Two Sorted Arrays
0010. Regular Expression Matching
0011. Container with Most Water
0012. Integer to Roman
0013. Roman to Integer
0019. Remove Nth Node From End of List
0024. Swap Nodes in Pairs
0032. Longest Valid Parentheses
0036. Valid Sudoku
0042. Trapping Rain Water
0045. Jump Game II
0046. Permutations
0054. Spiral Matrix
0055. Jump Game
0058. Length of Last Word
0069. Sqrt(x)
0072. Edit Distance
0085. Maximal Rectangle
0087. Scramble String
0091. Decode Ways
0093. Restore IP addresses
0095. Unique Binary Search Trees II
0096. Unique Binary Search Trees
0097. Interleaving String
0099. Recover Binary Search Tree
0103. Binary Tree Zigzag Level Order Traversal
0109. Convert Sorted List to Binary Search Tree
0112. Path Sum
0113. Path Sum II
0114. Flatten binary tree to linked list
0115. Distinct Subsequences
0116. Populating Next Right Pointers in Each Node
0130. Surrounded Regions
0138. Copy List with Random Pointer
0139. Word Break
0140. Word Break II
0146. LRU Cache
0148. Sort List
0149. Max Points on a Line
0164. Maximum Gap
0167. Two Sum II - Input Array Is Sorted
0169. Majority Element
0174. Dungeon Game
0189. Rotate Array
0208. Implement Trie (Prefix Tree)
0212. Word Search II
0222. Count Complete Tree Nodes
0224. Basic Calculator
0227. Basic Calculator II
0229. Majority Element II
0239. Sliding Window Maximum
0253. Meeting Rooms II
0254. Factor Combinations
0274. H-Index
0283. Move Zeroes
0287. Find the Duplicate Number
0290. Word Pattern
0291. Word Pattern II
0295. Find Median From Data Stream
0299. Bulls and Cows
0312. Burst Balloons
0341. Flatten Nested List Iterator
0344. Reverse String
0376. Wiggle Subsequence
0394. Decode String
0402. Remove K Digits
0413. Arithmetic Slices
0437. Path Sum III
0496. Next Greater Element I
0520. Detect Capital
0532. K diff Pairs in an Array
0542. 01 Matrix
0557. Reverse Words in a String III
0560. Subarray Sum Equals K
0568. Maximum Vacation Days
0617. Merge Two Binary Trees
0621. Task Scheduler
0636. Exclusive Time of Functions
0646. Maximum Length of Pair Chain
0647. Palindromic Substrings
0684. Redundant Connection
0695. Max Area of Island
0723. Candy Crush
0733. Flood Fill
0754. Reach a Number
0815. Bus Routes
871. Minimum Number of Refueling Stops
0876. Middle of the Linked List
0952. Largest Component Size by Common Factor
0977. Squares of a Sorted Array
0987. Vertical Order Traversal of a Binary Tree
0994. Rotting Oranges
1011. Capacity To Ship Packages Within D Days
1014. Best Sightseeing Pair
1015. Smallest Integer Divisible by K
1020. Number of Enclaves
1021. Remove Outermost Parentheses
1041. Robot Bounded in Circle
1047. Remove All Adjacent Duplicates in String
1057. Campus Bikes
1074. Number of Submatrices that sum to Target
1235. Maximum Profit in Job Scheduling
1240. Tiling a Rectangle with the Fewest Squares
1286. Iterator for Combination
1288. Remove Covered Intervals
1306. Jump Game III
1340. Jump Game V
1345. Jump Game IV
1396. Design Underground System
1610. Maximum Number of Visible Points
1650. Lowest Common Ancestor of a Binary Tree III
1675. Minimize Deviation in Array
1995. Count Special Quadruplets
1996. The Number of Weak Characters in the Game
2141. Maximum Running Time of N Computers
2180. Count Integers With Even Digit Sum
Topics
Topics
Best Time to Buy and Sell Stock -- Summary
Sliding Window Pattern
DP pattern summary
Dp patterns
Dp patterns
Decision making
Distinct Ways
Dp on strings
Merging intervals
Minimum (Maximum) Path to Reach a Target
LibreOJ
LibreOJ
「一本通 1.1 例 1」活动安排
「一本通 1.1 例 2」种树
「一本通 1.1 例 3」喷水装置
「一本通 1.1 例 4」加工生产调度
Misc
Misc
Example css file
RSA encryption and decryption
Operating System
Operating System
CS-124: Operating Class from CalTech
Python
Python
Tips
Reading notes
Reading notes
Apache Solr
Book notes for Design Data Intensive Apps
Streaming Systems CP 1 and CP 2
Streaming Systems CP 3 watermarks
Binomial Coefficient
Fibonacci Sequence
Harmonic Numbers
Lowest Common Ancestor Problem with Advanced Methods to Solve
Max Flow Problem
Minimal Spanning Tree
Shortest Path Problem
C
C
Functional Programming in C
Marcos vs Functions
Misc
Overloading Operator
Smart Pointer
STL Complexity
Golang
Golang
Notes for reading Caleb Doxsey - Introducing Go_ Build Reliable, Scalable Programs
Data structure
Learning notes from geektutu
Struct
iOS
iOS
Exam review Part 1
Exam review Part 2
iOS API
Some tools
Machine learning
Machine learning
Coursera ml week1
Cs231n lecture 3 loss function
Cs231n lecture 4 introduction to neural networks
Cs231n lecture 5 convolutional neural networks
Cs231n lecture 6 training neural networks i
Dp on strings