Skip to content
/ leetcode Public

  • Sponsor GoogTech/leetcode

    External links
    https://goog.tech/leetcode/sponsor.png

    Learn more about funding links in repositories.

    Report abuse

  • Notifications You must be signed in to change notification settings
  • Fork 4
  • Star 11

☕ The learning note about data structures, algorithms, and leetcode problems, which are based on java、python、golang, and c++.

goog.tech/leetcode

License

GPL-3.0 license
11 stars 4 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

GoogTech/leetcode

2 Branches4 Tags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

GoogTechGoogTech
update book.json
Sep 15, 2021
f614341 · Sep 15, 2021

History

652 Commits
#1. Two Sum
#1. Two Sum
 
 
#100. Same Tree
#100. Same Tree
 
 
#101. Symmetric Tree
#101. Symmetric Tree
 
 
#102. Binary Tree Level Order Traversal
#102. Binary Tree Level Order Traversal
 
 
#1021. Remove Outermost Parentheses
#1021. Remove Outermost Parentheses
 
 
#104. Maximum Depth of Binary Tree
#104. Maximum Depth of Binary Tree
 
 
#1047. Remove All Adjacent Duplicates In String
#1047. Remove All Adjacent Duplicates In String
 
 
#108. Convert Sorted Array to Binary Search Tree
#108. Convert Sorted Array to Binary Search Tree
 
 
#109. Convert Sorted List to Binary Search Tree
#109. Convert Sorted List to Binary Search Tree
 
 
#11. Container With Most Water
#11. Container With Most Water
 
 
#110. Balanced Binary Tree
#110. Balanced Binary Tree
 
 
#1108. Defanging an IP Address
#1108. Defanging an IP Address
 
 
#111. Minimum Depth of Binary Tree
#111. Minimum Depth of Binary Tree
 
 
#1123. Lowest Common Ancestor of Deepest Leaves
#1123. Lowest Common Ancestor of Deepest Leaves
 
 
#114. Flatten Binary Tree to Linked List
#114. Flatten Binary Tree to Linked List
 
 
#1207. Unique Number of Occurrences
#1207. Unique Number of Occurrences
 
 
#121. Best Time to Buy and Sell Stock
#121. Best Time to Buy and Sell Stock
 
 
#1221. Split a String in Balanced Strings
#1221. Split a String in Balanced Strings
 
 
#124. Binary Tree Maximum Path Sum
#124. Binary Tree Maximum Path Sum
 
 
#125. Valid Palindrome
#125. Valid Palindrome
 
 
#1281. Subtract the Product and Sum of Digits of an Integer
#1281. Subtract the Product and Sum of Digits of an Integer
 
 
#129. Sum Root to Leaf Numbers
#129. Sum Root to Leaf Numbers
 
 
#1290. Convert Binary Number in a Linked List to Integer
#1290. Convert Binary Number in a Linked List to Integer
 
 
#1295. Find Numbers with Even Number of Digits
#1295. Find Numbers with Even Number of Digits
 
 
#1299. Replace Elements with Greatest Element on Right Side
#1299. Replace Elements with Greatest Element on Right Side
 
 
#1302. Deepest Leaves Sum
#1302. Deepest Leaves Sum
 
 
#1305. All Elements in Two Binary Search Trees
#1305. All Elements in Two Binary Search Trees
 
 
#1309. Decrypt String from Alphabet to Integer Mapping
#1309. Decrypt String from Alphabet to Integer Mapping
 
 
#1315. Sum of Nodes with Even-Valued Grandparent
#1315. Sum of Nodes with Even-Valued Grandparent
 
 
#1323. Maximum 69 Number
#1323. Maximum 69 Number
 
 
#1332. Remove Palindromic Subsequences
#1332. Remove Palindromic Subsequences
 
 
#1342. Number of Steps to Reduce a Number to Zero
#1342. Number of Steps to Reduce a Number to Zero
 
 
#136. Single Number
#136. Single Number
 
 
#137. Single Number II
#137. Single Number II
 
 
#1374. Generate a String With Characters That Have Odd Counts
#1374. Generate a String With Characters That Have Odd Counts
 
 
#1381. Design a Stack With Increment Operation
#1381. Design a Stack With Increment Operation
 
 
#14. Longest Common Prefix
#14. Longest Common Prefix
 
 
#141. Linked List Cycle
#141. Linked List Cycle
 
 
#1436. Destination City
#1436. Destination City
 
 
#144. Binary Tree Preorder Traversal
#144. Binary Tree Preorder Traversal
 
 
#1441. Build an Array With Stack Operations
#1441. Build an Array With Stack Operations
 
 
#1448. Count Good Nodes in Binary Tree
#1448. Count Good Nodes in Binary Tree
 
 
#145. Binary Tree Postorder Traversal
#145. Binary Tree Postorder Traversal
 
 
#1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence
#1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence
 
 
#1464. Maximum Product of Two Elements in an Array
#1464. Maximum Product of Two Elements in an Array
 
 
#1470. Shuffle the Array
#1470. Shuffle the Array
 
 
#1480. Running Sum of 1d Array
#1480. Running Sum of 1d Array
 
 
#1486. XOR Operation in an Array
#1486. XOR Operation in an Array
 
 
#1491. Average Salary Excluding the Minimum and Maximum Salary
#1491. Average Salary Excluding the Minimum and Maximum Salary
 
 
#1502. Can Make Arithmetic Progression From Sequence
#1502. Can Make Arithmetic Progression From Sequence
 
 
#151. Reverse Words in a String
#151. Reverse Words in a String
 
 
#1512. Number of Good Pairs
#1512. Number of Good Pairs
 
 
#1518. Water Bottles
#1518. Water Bottles
 
 
#1528. Shuffle String
#1528. Shuffle String
 
 
#1544. Make The String Great
#1544. Make The String Great
 
 
#155. Min Stack
#155. Min Stack
 
 
#1557. Minimum Number of Vertices to Reach All Nodes
#1557. Minimum Number of Vertices to Reach All Nodes
 
 
#160. Intersection of Two Linked Lists
#160. Intersection of Two Linked Lists
 
 
#165. Compare Version Numbers
#165. Compare Version Numbers
 
 
#167. Two Sum II - Input array is sorted
#167. Two Sum II - Input array is sorted
 
 
#169. Majority Element
#169. Majority Element
 
 
#173. Binary Search Tree Iterator
#173. Binary Search Tree Iterator
 
 
#182. Duplicate Emails
#182. Duplicate Emails
 
 
#183. Customers Who Never Order
#183. Customers Who Never Order
 
 
#19. Remove Nth Node From End of List
#19. Remove Nth Node From End of List
 
 
#191. Number of 1 Bits
#191. Number of 1 Bits
 
 
#196. Delete Duplicate Emails
#196. Delete Duplicate Emails
 
 
#198. House Robber
#198. House Robber
 
 
#199. Binary Tree Right Side View
#199. Binary Tree Right Side View
 
 
#2. Add Two Numbers
#2. Add Two Numbers
 
 
#20. Valid Parentheses
#20. Valid Parentheses
 
 
#203. Remove Linked List Elements
#203. Remove Linked List Elements
 
 
#206. Reverse Linked List
#206. Reverse Linked List
 
 
#21. Merge Two Sorted Lists
#21. Merge Two Sorted Lists
 
 
#217. Contains Duplicate
#217. Contains Duplicate
 
 
#22. Generate Parentheses
#22. Generate Parentheses
 
 
#222. Count Complete Tree Nodes
#222. Count Complete Tree Nodes
 
 
#225. Implement Stack using Queues
#225. Implement Stack using Queues
 
 
#226. Invert Binary Tree
#226. Invert Binary Tree
 
 
#230. Kth Smallest Element in a BST
#230. Kth Smallest Element in a BST
 
 
#232. Implement Queue using Stacks
#232. Implement Queue using Stacks
 
 
#234. Palindrome Linked List
#234. Palindrome Linked List
 
 
#235. Lowest Common Ancestor of a Binary Search Tree
#235. Lowest Common Ancestor of a Binary Search Tree
 
 
#236. Lowest Common Ancestor of a Binary Tree
#236. Lowest Common Ancestor of a Binary Tree
 
 
#237. Delete Node in a Linked List
#237. Delete Node in a Linked List
 
 
#242. Valid Anagram
#242. Valid Anagram
 
 
#257. Binary Tree Paths
#257. Binary Tree Paths
 
 
#258. Add Digits
#258. Add Digits
 
 
#26. Remove Duplicates from Sorted Array
#26. Remove Duplicates from Sorted Array
 
 
#260. Single Number III
#260. Single Number III
 
 
#27. Remove Element
#27. Remove Element
 
 
#28. Implement strStr()
#28. Implement strStr()
 
 
#283. Move Zeroes
#283. Move Zeroes
 
 
#303. Range Sum Query - Immutable
#303. Range Sum Query - Immutable
 
 
#344. Reverse String
#344. Reverse String
 
 
#345. Reverse Vowels of a String
#345. Reverse Vowels of a String
 
 
#349. Intersection of Two Arrays
#349. Intersection of Two Arrays
 
 
#35. Search Insert Position
#35. Search Insert Position
 
 
#350. Intersection of Two Arrays II
#350. Intersection of Two Arrays II
 
 
#383. Ransom Note
#383. Ransom Note
 
 
#387. First Unique Character in a String
#387. First Unique Character in a String
 
 
#389. Find the Difference
#389. Find the Difference
 
 
#392. Is Subsequence
#392. Is Subsequence
 
 
#41. First Missing Positive
#41. First Missing Positive
 
 
#414. Third Maximum Number
#414. Third Maximum Number
 
 
#415. Add Strings
#415. Add Strings
 
 
#429. N-ary Tree Level Order Traversal
#429. N-ary Tree Level Order Traversal
 
 
#434. Number of Segments in a String
#434. Number of Segments in a String
 
 
#442. Find All Duplicates in an Array
#442. Find All Duplicates in an Array
 
 
#448. Find All Numbers Disappeared in an Array
#448. Find All Numbers Disappeared in an Array
 
 
#453. Minimum Moves to Equal Array Elements
#453. Minimum Moves to Equal Array Elements
 
 
#459. Repeated Substring Pattern
#459. Repeated Substring Pattern
 
 
#46. Permutations
#46. Permutations
 
 
#461. Hamming Distance
#461. Hamming Distance
 
 
#485. Max Consecutive Ones
#485. Max Consecutive Ones
 
 
#492. Construct the Rectangle
#492. Construct the Rectangle
 
 
#496. Next Greater Element I
#496. Next Greater Element I
 
 
#503. Next Greater Element II
#503. Next Greater Element II
 
 
#513. Find Bottom Left Tree Value
#513. Find Bottom Left Tree Value
 
 
#515. Find Largest Value in Each Tree Row
#515. Find Largest Value in Each Tree Row
 
 
#520. Detect Capital
#520. Detect Capital
 
 
#521. Longest Uncommon Subsequence I
#521. Longest Uncommon Subsequence I
 
 
#53. Maximum Subarray
#53. Maximum Subarray
 
 
#530. Minimum Absolute Difference in BST
#530. Minimum Absolute Difference in BST
 
 
#532. K-diff Pairs in an Array
#532. K-diff Pairs in an Array
 
 
#538. Convert BST to Greater Tree
#538. Convert BST to Greater Tree
 
 
#543. Diameter of Binary Tree
#543. Diameter of Binary Tree
 
 
#557. Reverse Words in a String III
#557. Reverse Words in a String III
 
 
#559. Maximum Depth of N-ary Tree
#559. Maximum Depth of N-ary Tree
 
 
#561. Array Partition I
#561. Array Partition I
 
 
#58. Length of Last Word
#58. Length of Last Word
 
 
#589. N-ary Tree Preorder Traversal
#589. N-ary Tree Preorder Traversal
 
 
#590. N-ary Tree Postorder Traversal
#590. N-ary Tree Postorder Traversal
 
 
#595. Big Countries
#595. Big Countries
 
 
#596. Classes More Than 5 Students
#596. Classes More Than 5 Students
 
 
#617. Merge Two Binary Trees
#617. Merge Two Binary Trees
 
 
#620. Not Boring Movies
#620. Not Boring Movies
 
 
#622. Design Circular Queue
#622. Design Circular Queue
 
 
#627. Swap Salary
#627. Swap Salary
 
 
#628. Maximum Product of Three Numbers
#628. Maximum Product of Three Numbers
 
 
#641. Design Circular Deque
#641. Design Circular Deque
 
 
#645. Set Mismatch
#645. Set Mismatch
 
 
#657. Robot Return to Origin
#657. Robot Return to Origin
 
 
#66. Plus One
#66. Plus One
 
 
#680. Valid Palindrome II
#680. Valid Palindrome II
 
 
#682. Baseball Game
#682. Baseball Game
 
 
#690. Employee Importance
#690. Employee Importance
 
 
#70. Climbing Stairs
#70. Climbing Stairs
 
 
#700. Search in a Binary Search Tree
#700. Search in a Binary Search Tree
 
 
#709. To Lower Case
#709. To Lower Case
 
 
#746. Min Cost Climbing Stairs
#746. Min Cost Climbing Stairs
 
 
#78. Subsets
#78. Subsets
 
 
#783. Minimum Distance Between BST Nodes
#783. Minimum Distance Between BST Nodes
 
 
#804. Unique Morse Code Words
#804. Unique Morse Code Words
 
 
#82. Remove Duplicates from Sorted List II
#82. Remove Duplicates from Sorted List II
 
 
#83. Remove Duplicates from Sorted List
#83. Remove Duplicates from Sorted List
 
 
#844. Backspace String Compare
#844. Backspace String Compare
 
 
#872. Leaf-Similar Trees
#872. Leaf-Similar Trees
 
 
#876. Middle of the Linked List
#876. Middle of the Linked List
 
 
#88. Merge Sorted Array
#88. Merge Sorted Array
 
 
#897. Increasing Order Search Tree
#897. Increasing Order Search Tree
 
 
#9. Palindrome Number
#9. Palindrome Number
 
 
#905. Sort Array By Parity
#905. Sort Array By Parity
 
 
#917. Reverse Only Letters
#917. Reverse Only Letters
 
 
#921. Minimum Add to Make Parentheses Valid
#921. Minimum Add to Make Parentheses Valid
 
 
#922. Sort Array By Parity II
#922. Sort Array By Parity II
 
 
#925. Long Pressed Name
#925. Long Pressed Name
 
 
#929. Unique Email Addresses
#929. Unique Email Addresses
 
 
#933. Number of Recent Calls
#933. Number of Recent Calls
 
 
#938. Range Sum of BST
#938. Range Sum of BST
 
 
#94 #144 #145 Binary Tree Traversal Template
#94 #144 #145 Binary Tree Traversal Template
 
 
#94. Binary Tree Inorder Traversal
#94. Binary Tree Inorder Traversal
 
 
#977. Squares of a Sorted Array
#977. Squares of a Sorted Array
 
 
#993. Cousins in Binary Tree
#993. Cousins in Binary Tree
 
 
.github
.github
 
 
.vscode
.vscode
 
 
107. Binary Tree Level Order Traversal II
107. Binary Tree Level Order Traversal II
 
 
data-structures-and-algorithms
data-structures-and-algorithms
 
 
docs
docs
 
 
剑指 Offer
剑指 Offer
 
 
排序算法
排序算法
 
 
面试题01/#02. 判定是否互为字符重排
面试题01/#02. 判定是否互为字符重排
 
 
面试题02
面试题02
 
 
面试题03
面试题03
 
 
面试题04
面试题04
 
 
面试题10/#01. 合并排序的数组
面试题10/#01. 合并排序的数组
 
 
面试题17
面试题17
 
 
.gitignore
.gitignore
 
 
.travis.yml
.travis.yml
 
 
LICENSE
LICENSE
 
 
README.md
README.md
 
 

Repository files navigation





知识共享许可协议


😎 大三狗带你从零开始刷LeetCode !

Tags

tag tag tag

tag tag tag tag

tag tag tag tag tag

tag tag tag tag tag tag tag

Summary

About

☕ The learning note about data structures, algorithms, and leetcode problems, which are based on java、python、golang, and c++.

goog.tech/leetcode

Topics

python java golang c-plus-plus leetcode gitbook note algorithms-and-data-structures

Resources

Readme

License

GPL-3.0 license
Activity

Stars

11 stars

Watchers

4 watching

Forks

4 forks
Report repository

Releases 4

🎉 200 problems be resolved ! Latest
Sep 15, 2020
+ 3 releases

Sponsor this project

Languages