Coding

A series of Jupyter notebooks for coding learning

Those ones are the solutions for leetcode problems.

It is highly recommended to try to solve the problems firstly by your own before seeing those solutions.

Plagiarism is an unethical practice.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Coding

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 173 Commits
assets		assets
practices		practices
!! 1102. Path With Maximum Minimum Value.ipynb		!! 1102. Path With Maximum Minimum Value.ipynb
!! 114. Flatten Binary Tree to Linked List.ipynb		!! 114. Flatten Binary Tree to Linked List.ipynb
!! 1371. Find the Longest Substring Containing Vowels in Even Counts.ipynb		!! 1371. Find the Longest Substring Containing Vowels in Even Counts.ipynb
!! 187. Repeated DNA Sequences.ipynb		!! 187. Repeated DNA Sequences.ipynb
!! 199. Binary Tree Right Side View.ipynb		!! 199. Binary Tree Right Side View.ipynb
!! 210. Course Schedule II.ipynb		!! 210. Course Schedule II.ipynb
!! 286. Walls and Gates.ipynb		!! 286. Walls and Gates.ipynb
!! 62. Unique Paths (2D Grid).ipynb		!! 62. Unique Paths (2D Grid).ipynb
!! 776. Split BST.ipynb		!! 776. Split BST.ipynb
!!! 114. Flatten Binary Tree to Linked List.ipynb		!!! 114. Flatten Binary Tree to Linked List.ipynb
!!! 187. Repeated DNA Sequences.ipynb		!!! 187. Repeated DNA Sequences.ipynb
.gitignore		.gitignore
0-resources.ipynb		0-resources.ipynb
1008. Construct Binary Search Tree from Preorder Traversal.ipynb		1008. Construct Binary Search Tree from Preorder Traversal.ipynb
1010. Pairs of Songs With Total Durations Divisible by 60.ipynb		1010. Pairs of Songs With Total Durations Divisible by 60.ipynb
1029. Two City Scheduling.ipynb		1029. Two City Scheduling.ipynb
103. Binary Tree Zigzag Level Order Traversal.ipynb		103. Binary Tree Zigzag Level Order Traversal.ipynb
1035. Uncrossed Lines.ipynb		1035. Uncrossed Lines.ipynb
1062. Longest Repeating Substring ⭐️.ipynb		1062. Longest Repeating Substring ⭐️.ipynb
1062. Longest Repeating Substring.ipynb		1062. Longest Repeating Substring.ipynb
108. Convert Sorted Array to Binary Search Tree.ipynb		108. Convert Sorted Array to Binary Search Tree.ipynb
1094. Car Pooling.ipynb		1094. Car Pooling.ipynb
110. Balanced Binary Tree.ipynb		110. Balanced Binary Tree.ipynb
1102. Path With Maximum Minimum Value.ipynb		1102. Path With Maximum Minimum Value.ipynb
114. Flatten Binary Tree to Linked List.ipynb		114. Flatten Binary Tree to Linked List.ipynb
119. Pascal's Triangle II.ipynb		119. Pascal's Triangle II.ipynb
1192. Critical Connections in a Network (finding bridges).ipynb		1192. Critical Connections in a Network (finding bridges).ipynb
121. Best Time to Buy and Sell Stock.ipynb		121. Best Time to Buy and Sell Stock.ipynb
122. Best Time to Buy and Sell Stock II.ipynb		122. Best Time to Buy and Sell Stock II.ipynb
123. Best Time to Buy and Sell Stock III.ipynb		123. Best Time to Buy and Sell Stock III.ipynb
1232. Check If It Is a Straight Line.ipynb		1232. Check If It Is a Straight Line.ipynb
1277. Count Square Submatrices with All Ones.ipynb		1277. Count Square Submatrices with All Ones.ipynb
1283. Find the Smallest Divisor Given a Threshold.ipynb		1283. Find the Smallest Divisor Given a Threshold.ipynb
1344. Angle Between Hands of a Clock.ipynb		1344. Angle Between Hands of a Clock.ipynb
136,137,260-231. Single Number, Power of two.ipynb		136,137,260-231. Single Number, Power of two.ipynb
1368. Minimum Cost to Make at Least One Valid Path in a Grid.ipynb		1368. Minimum Cost to Make at Least One Valid Path in a Grid.ipynb
137. Single Number II.ipynb		137. Single Number II.ipynb
139. Word Break.ipynb		139. Word Break.ipynb
14. Longest Common Prefix.ipynb		14. Longest Common Prefix.ipynb
146. LRU Cache.ipynb		146. LRU Cache.ipynb
1463. Cherry Pickup II.ipynb		1463. Cherry Pickup II.ipynb
1492. The kth Factor of n.ipynb		1492. The kth Factor of n.ipynb
15. 3Sum.ipynb		15. 3Sum.ipynb
154. Find Minimum in Rotated Sorted Array II.ipynb		154. Find Minimum in Rotated Sorted Array II.ipynb
1547. Minimum Cost to Cut a Stick.ipynb		1547. Minimum Cost to Cut a Stick.ipynb
16. 3Sum Closest.ipynb		16. 3Sum Closest.ipynb
167. Two Sum II - Input array is sorted.ipynb		167. Two Sum II - Input array is sorted.ipynb
170. Two Sum III - Data structure design.ipynb		170. Two Sum III - Data structure design.ipynb
171. Excel Sheet Column Number.ipynb		171. Excel Sheet Column Number.ipynb
174. Dungeon Game.ipynb		174. Dungeon Game.ipynb
190. Reverse Bits.ipynb		190. Reverse Bits.ipynb
20. Valid Parentheses.ipynb		20. Valid Parentheses.ipynb
203. Remove Linked List Elements.ipynb		203. Remove Linked List Elements.ipynb
204. Count Primes (and sum).ipynb		204. Count Primes (and sum).ipynb
204. Count Primes.ipynb		204. Count Primes.ipynb
207. Course Schedule.ipynb		207. Course Schedule.ipynb
208. Implement Trie (Prefix Tree).ipynb		208. Implement Trie (Prefix Tree).ipynb
212. Word Search II.ipynb		212. Word Search II.ipynb
22. Generate Parentheses.ipynb		22. Generate Parentheses.ipynb
222. Count Complete Tree Nodes.ipynb		222. Count Complete Tree Nodes.ipynb
23. Merge k Sorted Lists.ipynb		23. Merge k Sorted Lists.ipynb
230. Kth Smallest Element in a BST.ipynb		230. Kth Smallest Element in a BST.ipynb
236. Lowest Common Ancestor of a Binary Tree.ipynb		236. Lowest Common Ancestor of a Binary Tree.ipynb
237. Delete Node in a Linked List.ipynb		237. Delete Node in a Linked List.ipynb
238. Product of Array Except Self.ipynb		238. Product of Array Except Self.ipynb
239. Sliding Window Maximum.ipynb		239. Sliding Window Maximum.ipynb
243. Shortest Word Distance.ipynb		243. Shortest Word Distance.ipynb
253. Meeting Rooms II.ipynb		253. Meeting Rooms II.ipynb
258. Add Digits.ipynb		258. Add Digits.ipynb
259. 3Sum Smaller.ipynb		259. 3Sum Smaller.ipynb
270. Closest Binary Search Tree Value.ipynb		270. Closest Binary Search Tree Value.ipynb
274. H-Index.ipynb		274. H-Index.ipynb
276. Paint Fence.ipynb		276. Paint Fence.ipynb
278. First Bad Version.ipynb		278. First Bad Version.ipynb
279. Perfect Squares.ipynb		279. Perfect Squares.ipynb
29. Divide Two Integers.ipynb		29. Divide Two Integers.ipynb
299. Bulls and Cows.ipynb		299. Bulls and Cows.ipynb
3. Longest Substring Without Repeating Characters.ipynb		3. Longest Substring Without Repeating Characters.ipynb
307. Range Sum Query - Mutable.ipynb		307. Range Sum Query - Mutable.ipynb
309. Best Time to Buy and Sell Stock with Cooldown.ipynb		309. Best Time to Buy and Sell Stock with Cooldown.ipynb
312. Burst Balloons.ipynb		312. Burst Balloons.ipynb
325. Maximum Size Subarray Sum Equals k.ipynb		325. Maximum Size Subarray Sum Equals k.ipynb
328. Odd Even Linked List.ipynb		328. Odd Even Linked List.ipynb
33. Search in Rotated Sorted Array.ipynb		33. Search in Rotated Sorted Array.ipynb
332. Reconstruct Itinerary.ipynb		332. Reconstruct Itinerary.ipynb
334. Increasing Triplet Subsequence.ipynb		334. Increasing Triplet Subsequence.ipynb
338. Counting Bits.ipynb		338. Counting Bits.ipynb
34. Find First and Last Position of Element in Sorted Array.ipynb		34. Find First and Last Position of Element in Sorted Array.ipynb
347. Top K Frequent Elements.ipynb		347. Top K Frequent Elements.ipynb
347. Top k Frequent Elements.ipynb		347. Top k Frequent Elements.ipynb
350. Intersection of Two Arrays II.ipynb		350. Intersection of Two Arrays II.ipynb
367. Valid Perfect Square + Square Root with Newton Method.ipynb		367. Valid Perfect Square + Square Root with Newton Method.ipynb
367. Valid Perfect Square.ipynb		367. Valid Perfect Square.ipynb
368. Largest Divisible Subset.ipynb		368. Largest Divisible Subset.ipynb
369. Plus One Linked List.ipynb		369. Plus One Linked List.ipynb
380. Insert Delete GetRandom O(1).ipynb		380. Insert Delete GetRandom O(1).ipynb
392. Is Subsequence.ipynb		392. Is Subsequence.ipynb
402. Remove K Digits.ipynb		402. Remove K Digits.ipynb

Folders and files

Latest commit

History

Repository files navigation

Coding

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages