Skip to content

zjyzh/leetcode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

19 Commits
1 - 438. Find All Anagrams in a String
1 - 438. Find All Anagrams in a String
 
 
10 - kmp_and_string_matching
10 - kmp_and_string_matching
 
 
11 - 116. Populating Next Right Pointers in Each Node
11 - 116. Populating Next Right Pointers in Each Node
 
 
12 - 545. Boundary of Binary Tree
12 - 545. Boundary of Binary Tree
 
 
13 - 2742. Painting the Walls
13 - 2742. Painting the Walls
 
 
14 - 261. Graph Valid Tree
14 - 261. Graph Valid Tree
 
 
15 - 10. Regular Expression Matching
15 - 10. Regular Expression Matching
 
 
16 - 210. Course Schedule II
16 - 210. Course Schedule II
 
 
17 - 212. Word Search II
17 - 212. Word Search II
 
 
18 - 330. Patching Array
18 - 330. Patching Array
 
 
19 - 362. Design Hit Counter
19 - 362. Design Hit Counter
 
 
2 - 588. Design In-Memory File System
2 - 588. Design In-Memory File System
 
 
20 - 2050. Parallel Courses III
20 - 2050. Parallel Courses III
 
 
21 - 42. Trapping Rain Water
21 - 42. Trapping Rain Water
 
 
22 - 200. Number of Islands
22 - 200. Number of Islands
 
 
23 - 227. Basic Calculator II
23 - 227. Basic Calculator II
 
 
24 - 304. Range Sum Query 2D - Immutable
24 - 304. Range Sum Query 2D - Immutable
 
 
25 - 399. Evaluate Division
25 - 399. Evaluate Division
 
 
26 - 480. Sliding Window Median
26 - 480. Sliding Window Median
 
 
27 - 2002. Maximum Product of the Length of Two Palindromic Subsequences
27 - 2002. Maximum Product of the Length of Two Palindromic Subsequences
 
 
28 - 2291. Maximum Profit From Trading Stocks
28 - 2291. Maximum Profit From Trading Stocks
 
 
29 - 460. LFU Cache
29 - 460. LFU Cache
 
 
3- 1639. Number of Ways to Form a Target String Given a Dictionary
3- 1639. Number of Ways to Form a Target String Given a Dictionary
 
 
30 - 2702. Minimum Operations to Make Numbers Non-positive
30 - 2702. Minimum Operations to Make Numbers Non-positive
 
 
31 - 11. Container With Most Water
31 - 11. Container With Most Water
 
 
32 - 33. Search in Rotated Sorted Array
32 - 33. Search in Rotated Sorted Array
 
 
33 - 56. Merge Intervals
33 - 56. Merge Intervals
 
 
34 - uber OA
34 - uber OA
 
 
36 - amazon oa
36 - amazon oa
 
 
37 - 3. Longest Substring Without Repeating Characters
37 - 3. Longest Substring Without Repeating Characters
 
 
38 - 621. Task Scheduler
38 - 621. Task Scheduler
 
 
39 - 49. Group Anagrams
39 - 49. Group Anagrams
 
 
4 - 2856. Minimum Array Length After Pair Removals
4 - 2856. Minimum Array Length After Pair Removals
 
 
40 - 767. Reorganize String
40 - 767. Reorganize String
 
 
41 - 875. Koko Eating Bananas
41 - 875. Koko Eating Bananas
 
 
42 - 2. Add Two Numbers
42 - 2. Add Two Numbers
 
 
43 - 5. Longest Palindromic Substring
43 - 5. Longest Palindromic Substring
 
 
44 - 138. Copy List with Random Pointer
44 - 138. Copy List with Random Pointer
 
 
45 - 239. Sliding Window Maximum
45 - 239. Sliding Window Maximum
 
 
45 - 567. Permutation in String
45 - 567. Permutation in String
 
 
46 - 1514. Path with Maximum Probability
46 - 1514. Path with Maximum Probability
 
 
47 - 1135. Connecting Cities With Minimum Cost
47 - 1135. Connecting Cities With Minimum Cost
 
 
48 - 3043. Find the Length of the Longest Common Prefix
48 - 3043. Find the Length of the Longest Common Prefix
 
 
49 - 2530. Maximal Score After Applying K Operations
49 - 2530. Maximal Score After Applying K Operations
 
 
5- 3177. Find the Maximum Length of a Good Subsequence II
5- 3177. Find the Maximum Length of a Good Subsequence II
 
 
50 - 2422. Merge Operations to Turn Array Into a Palindrome
50 - 2422. Merge Operations to Turn Array Into a Palindrome
 
 
51 - 1802. Maximum Value at a Given Index in a Bounded Array
51 - 1802. Maximum Value at a Given Index in a Bounded Array
 
 
52 - 1584. Min Cost to Connect All Points
52 - 1584. Min Cost to Connect All Points
 
 
53 - 752. Open the Lock
53 - 752. Open the Lock
 
 
54 - 735. Asteroid Collision
54 - 735. Asteroid Collision
 
 
55 - 694. Number of Distinct Islands
55 - 694. Number of Distinct Islands
 
 
56 - 394. Decode String
56 - 394. Decode String
 
 
57 - 295. Find Median from Data Stream
57 - 295. Find Median from Data Stream
 
 
58 - 300. Longest Increasing Subsequence
58 - 300. Longest Increasing Subsequence
 
 
59 - 139. Word Break
59 - 139. Word Break
 
 
6 - 3155. Maximum Number of Upgradable Servers
6 - 3155. Maximum Number of Upgradable Servers
 
 
61 - 143. Reorder List
61 - 143. Reorder List
 
 
62 - 528. Random Pick with Weight
62 - 528. Random Pick with Weight
 
 
63 - 53. Maximum Subarray
63 - 53. Maximum Subarray
 
 
64 - 76. Minimum Window Substring
64 - 76. Minimum Window Substring
 
 
65 - 128. Longest Consecutive Sequence
65 - 128. Longest Consecutive Sequence
 
 
66 - 146. LRU Cache
66 - 146. LRU Cache
 
 
67 - 253. Meeting Rooms II
67 - 253. Meeting Rooms II
 
 
68 - 1530. Number of Good Leaf Nodes Pairs
68 - 1530. Number of Good Leaf Nodes Pairs
 
 
69 - 767. Reorganize String
69 - 767. Reorganize String
 
 
7 - 25. Reverse Nodes in k-Group
7 - 25. Reverse Nodes in k-Group
 
 
70 - 207. Course Schedule
70 - 207. Course Schedule
 
 
71 - 127. Word Ladder
71 - 127. Word Ladder
 
 
72 - 15. 3Sum
72 - 15. 3Sum
 
 
73 - 79. Word Search
73 - 79. Word Search
 
 
74 - 1650. Lowest Common Ancestor of a Binary Tree III
74 - 1650. Lowest Common Ancestor of a Binary Tree III
 
 
75 - 55. Jump Game
75 - 55. Jump Game
 
 
76 - 1233. Remove Sub-Folders from the Filesystem
76 - 1233. Remove Sub-Folders from the Filesystem
 
 
77 -17. Letter Combinations of a Phone Number
77 -17. Letter Combinations of a Phone Number
 
 
8 - 1235. Maximum Profit in Job Scheduling
8 - 1235. Maximum Profit in Job Scheduling
 
 
9 - 224. Basic Calculator
9 - 224. Basic Calculator
 
 
README.md
README.md
 
 

Repository files navigation

leetcode

Coding problem document

This is a record for my coding problem practice

....

About

Coding problem document

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages