🐶
LeetCode Zichao
CtrlK
  • Introduction
    • 面经
      • Google
    • BQ
    • 编程小贴士
    • Git
  • References
    • System Design
  • CC189 不知道会不会补全
    • CC189 Part I
  • Java 小知识
    • Java 集合
    • Java 泛型
    • Java 类型转换
    • Java String 类 StringBuilder
    • java iterator comparator
    • java Random
    • Java Visualizer
      • LinkedList for Java Visualizer
  • Data Structure and Algorithm
    • 面试如何讲 Code
    • Stack 栈
    • Recursion 递归
    • Queue 队列 优先队列 单调队列
    • LinkedList 链表
    • Tree 二叉树
      • Tree Problems
    • HashSet/Map
    • Graph 图
      • Glossary 术语表
      • Undirected Graphs 无向图
        • UnionFind
      • Directed Graphs 有向图
        • Eulerian/Hamiltonian Cycle/Paths 欧拉/哈密顿 环/路径
        • Strongly Connected 强连通性
    • Binary Search 二分查找
    • Sort 排序
    • Sliding Window 滑窗
    • Backtracking 回溯
    • Bit Manipulation 位运算
    • Matrix 矩阵
    • Dynamic Programming 动态规划
    • Design 设计类 LC 问题
  • LeetCode 高频难题
  • 001 - 100
    • 001J?. Two Sum
    • 002J(2/2). Add Two Numbers
    • 003J. Longest Substring Without Repeating Characters
    • 004J. Median of Two Sorted Arrays
    • 005J. Longest Palindromic Substring
    • 006. ZigZag-Conversion
    • 007J. Reverse Integer
    • 008J. String to Integer (atoi)
    • 009J. Palindrome Number
    • 011J. Container With Most Water
    • 012J. Integer to Roman
    • 013J. Roman to Integer
    • 014J Longest Common Prefix
    • 015J. Three Sum
    • 016J. 3Sum Closest
    • 017J. Letter Combinations of a Phone Number
    • 018J. 4Sum
    • 019J. Remove Nth Node From End of List
    • 020J. Valid Parentheses
    • 021J(3/3). Merge Two Sorted Lists
    • 022J. Generate Parentheses
    • 023J. Merge k Sorted Lists
    • 024J?. Swap Nodes in Pairs
    • 025J. Reverse Nodes in k-Group
    • 026J. Remove Duplicates from Sorted Array
    • 027J. Remove Element
    • 028J. Implement strStr()
    • 029. Divide-Two-Integers
    • 031. Next-Permutation
    • 032J. Longest Valid Parentheses
    • 033J. Search in Rotated Sorted Array
    • 034J. Find First and Last Position of Element in Sorted Array
    • 035J. Search Insert Position
    • x036J. Valid Sudoku
    • 037J. Sudoku Solver
    • 038. Count-and-Say
    • 039J. Combination Sum
    • 040J. Combination Sum II
    • 041J. First Missing Positive
    • 042J. Trapping Rain Water
    • 044. Wildcard-Matching
    • 045. Jump-Game-II
    • 046J. Permutations
    • 047J. Permutations II
    • 048J. Rotate Image
    • 049. Group-Anagrams
    • 050J. Pow(x, n)
    • 051J. N-Queens
    • 052J. N-Queens II
    • 053J. Maximum Subarray
    • 054J. Spiral Matrix
    • 056J. Merge Intervals
    • 057. Insert-Interval
    • 058J. Length of Last Word
    • 059J. Spiral Matrix II
    • 061J(2/2). Rotate List
    • 062J. Unique Paths
    • 063J. Unique Paths II
    • 064J. Minimum Path Sum
    • 065
    • 066J. Plus One
    • 067J. Add Binary
    • 068
    • 070J. Climbing Stairs
    • 071J. Simplify Path
    • 072. Edit-Distance
    • 074J. Search a 2D Matrix
    • 075J. Sort Colors
    • 076J. Minimum Window Substring
    • 077J Combinations
    • 079J Word Search
    • 080J. Remove Duplicates from Sorted Array II
    • 081. Search-in-Rotated-Sorted-Array-II
    • 082J?(2/2). Remove Duplicates from Sorted List II
    • 083J?. Remove Duplicates from Sorted List
    • 084J?. Largest Rectangle in Histogram
    • 085J?. Maximal Rectangle
    • 086J. Partition List
    • 088J. Merge Sorted Array
    • 089. Gray-Code
    • 091. Decode-Ways
    • 092. Reverse Linked List II
    • 094J. Binary Tree Inorder Traversal
    • 095J. Unique Binary Search Trees II
    • 096J. Unique Binary Search Trees
    • 098J. Validate Binary Search Tree
    • 099J. Recover Binary Search Tree
    • 100J. Same Tree
  • 101 - 200
    • 101J. Symmetric Tree
    • 102J. Binary Tree Level Order Traversal
    • 103J. Binary Tree Zigzag Level Order Traversal
    • *104J. Maximum Depth of Binary Tree
    • 105J. Construct Binary Tree from Preorder and Inorder Traversal
    • 106J. Construct Binary Tree from Inorder and Postorder Traversal
    • 107J. Binary Tree Level Order Traversal II
    • 108J. Convert Sorted Array to Binary Search Tree
    • 109J. Convert Sorted List to Binary Search Tree
    • 110J. Balanced Binary Tree
    • 111J. Minimum Depth of Binary Tree
    • 112J. Path Sum
    • 113J. Path Sum II
    • *114J. Flatten Binary Tree to Linked List
    • 115. Distinct-Subsequences
    • 118J. Pascal's Triangle
    • 119J. Pascal's Triangle II
    • 121J. Best Time to Buy and Sell Stock
    • 122J. Best Time to Buy and Sell Stock II
    • 123J. Best Time to Buy and Sell Stock III
    • 124J. Binary Tree Maximum Path Sum
    • 125J. Valid Palindrome
    • 127. Word-Ladder
    • 128J. Longest Consecutive Sequence
    • 129. Sum-Root-to-Leaf-Numbers
    • 130J. Surrounded Regions
    • 133J. Clone Graph
    • 134J. Gas Station
    • 136J. Single Number
    • 137J. Single Number II
    • 138J. Copy List with Random Pointer
    • 139. Word-Break
    • 141J. Linked List Cycle
    • 142J. Linked List Cycle II
    • 143J. Reorder List
    • 144J. Binary Tree Preorder Traversal
    • 145J. Binary Tree Postorder Traversal
    • 146J. LRU Cache
    • 147J. Insertion Sort List
    • 148J. Sort List
    • 150J. Evaluate Reverse Polish Notation
    • 151. Reverse-Words-in-a-String
    • 152. Maximum-Product-Subarray
    • 153. Find-Minimum-in-Rotated-Sorted-Array
    • 155J. Min Stack
    • 160J. Intersection of Two Linked Lists
    • 161. One-Edit-Distance
    • 162J. Find Peak Element
    • 164
    • 165. Compare-Version-Numbers
    • 167J. Two Sum II
    • 169J. Majority Element
    • 170J. Two Sum III
    • 172J. Factorial Trailing Zeroes
    • *173J. Binary Search Tree Iterator
    • 174. Dungeon-Game
    • 186. Reverse-Words-in-a-String-II
    • 188J. Best Time to Buy and Sell Stock IV
    • 189J. Rotate Array
    • 190. Reverse-Bits
    • 198. House-Robber
    • 199J. Binary Tree Right Side View
    • *200. Number of Islands
  • 201 - 300
    • 202J. Happy Number
    • 203J. Remove Linked List Elements
    • 206J(2/2). Reverse Linked List
    • 207J Course Schedule
    • 209. Minimum-Size-Subarray-Sum
    • 212. Word-Search-II
    • 213. House-Robber-II
    • 215J. Kth Largest Element in an Array
    • 216J. Combination Sum III
    • 217J. Contains Duplicate
    • 218J. The Skyline Problem
    • 219J. Contains Duplicate II
    • 220J. Contains Duplicate III
    • 224. Basic-Calculator
    • 226J. Invert Binary Tree
    • 227J. Basic Calculator II
    • 229J. Majority Element II
    • 230J Kth Smallest Element in a BST
    • 232J. Implement Queue using Stacks
    • 234J. Palindrome Linked List
    • 235J. Lowest Common Ancestor of a Binary Search Tree
    • 236. Lowest-Common-Ancestor-of-a-Binary-Tree
    • 237J. Delete Node in a Linked List
    • 238J. Product of Array Except Self
    • 239J. Sliding Window Maximum
    • 240J. Search a 2D Matrix II
    • 242. Valid-Anagram
    • 243J. Shortest Word Distance
    • 244J. Shortest Word Distance II
    • 245J. Shortest Word Distance III
    • 252J. Meeting Rooms
    • *253J. Meeting Rooms II
    • 256. Paint-House
    • 259. 3Sum-Smaller
    • 260. Single Number III
    • 261J. Graph Valid Tree
    • 263. Ugly-Number
    • 264. Ugly-Number-II
    • 265: Paint-House-II
    • 268J. Missing Number
    • 270. Closest-Binary-Search-Tree-Value
    • 273
    • 274J. H-Index
    • 275J. H-Index II
    • 276. Paint-Fence
    • 277J. Find the Celebrity
    • 278. First-Bad-Version
    • 279. Perfect-Squares
    • 283J. Move Zeroes
    • 285. Inorder-Successor-in-BST
    • 286. Walls-and-Gates
    • 287. Find-the-Duplicate-Number
    • 295?J. Find Median from Data Stream
    • 297. Serialize-and-Deserialize-Binary-Tree
    • 299J. Bulls and Cows
    • 300. Longest-Increasing-Subsequence
  • 301 - 400
    • 301J. Remove Invalid Parentheses
    • 310. Minimum-Height-Trees
    • 311. Sparse-Matrix-Multiplication
    • 313. Super-Ugly-Number
    • 314. Binary-Tree-Vertical-Order-Traversal
    • 322. Coin-Change
    • 323J?. Number of Connected Components in an Undirected Graph
    • 328J. Odd Even Linked List
    • 334J. Increasing Triplet Subsequence
    • 337. House-Robber-III
    • 340. Longest-Substring-with-At-Most-K-Distinct-Characters
    • 343. Integer-Break
    • 347J. Top K Frequent Elements
    • 349J. Intersection of Two Arrays
    • 350J?. Intersection of Two Arrays II
    • 359. Logger-Rate-Limiter
    • 362. Design-Hit-Counter
    • 369J. Plus One Linked List
    • 371. Sum-of-Two-Integers
    • 374. Guess-Number-Higher-or-Lower
    • 380. Insert-Delete-GetRandom-O(1)
    • 381J. Insert Delete GetRandom O(1) - Duplicates allowed
    • 387J. First Unique Character in a String
    • 388. Longest-Absolute-File-Path
    • 394J. Decode String
    • 399. Evaluate-Division
    • 400. Nth-Digit
  • 401-600
    • 407J. Trapping Rain Water II
    • 409J. Longest Palindrome
    • 412J. Fizz Buzz
    • 414. Third-Maximum-Number
    • 415
    • 417. Pacific-Atlantic-Water-Flow
    • 421J?. Maximum XOR of Two Numbers in an Array
    • 426. Convert-Binary-Search-Tree-to-Sorted-Doubly-Linked-List
    • 435. Non-overlapping-Intervals
    • 442
    • 445J. Add Two Numbers II
    • 448J. Find All Numbers Disappeared in an Array
    • 450. Delete-Node-in-a-BST
    • 451J. Sort Characters By Frequency
    • 452. Minimum-Number-of-Arrows-to-Burst-Balloons
    • 460. LFU-Cache
    • 494. Target-Sum
    • 496J. Next Greater Element I
    • 503J. Next Greater Element II
    • 509. Fibonacci-Number
    • 516. Longest-Palindromic-Subsequence
    • 518. Coin-Change-2
    • 528. Random-Pick-with-Weight
    • 538J. Convert BST to Greater Tree
    • 543. Diameter-of-Binary-Tree
    • 547. Friend-Circles
    • 556J. Next Greater Element III
    • 560. Subarray-Sum-Equals-K
  • 601-800
    • 616. Add-Bold-Tag-in-String
    • 617J. Merge Two Binary Trees
    • *621J. Task Scheduler
    • 628. Maximum-Product-of-Three-Numbers
    • 647. Palindromic-Substrings
    • 653. Two-Sum-IV---Input-is-a-BST
    • 658J. Find K Closest Elements
    • 662. Maximum-Width-of-Binary-Tree
    • 680. Valid-Palindrome-II
    • 692. Top-K-Frequent-Words
    • 695. Max-Area-of-Island
    • 700J. Search in a Binary Search Tree
    • 704. Binary-Search
    • 706. Design-HashMap
    • 716J?. Max Stack
    • 722. Remove-Comments
    • 733J. Flood Fill amazon
    • 735. Asteroid-Collision
    • *743J Network Delay Time
    • 763. Partition-Labels
    • 772. Basic-Calculator-III
    • 791 Custom-Sort-String
    • 797. All-Paths-From-Source-to-Target
  • 801-1000
    • 823. Binary-Trees-With-Factors
    • 841J. Keys and Rooms
    • 844J. Backspace String Compare
    • 845. Longest-Mountain-in-Array
    • 852J. Peak Index in a Mountain Array
    • *862J Shortest Subarray with Sum at Least K
    • 876J. Middle of the Linked List
    • 897J. Increasing Order Search Tree
    • 900. RLE-Iterator
    • 905. Sort-Array-By-Parity
    • 937 Reorder-Data-in-Log-Files
    • 968J. Binary Tree Cameras
    • 973J. K Closest Points to Origin
    • 987. Vertical-Order-Traversal-of-a-Binary-Tree
    • 994. Rotting-Oranges
  • other leetCode problems
    • 1123. Lowest-Common-Ancestor-of-Deepest-Leaves
    • 1129. Shortest-Path-with-Alternating-Colors
    • 1143. Longest-Common-Subsequence
    • 1190J. Reverse Substrings Between Each Pair of Parentheses
    • 1209J. Remove All Adjacent Duplicates in String II
    • 1249
    • 1307J. Verbal Arithmetic Puzzle
    • 1311J. Get Watched Videos by Your Friends
    • 1312. Minimum-Insertion-Steps-to-Make-a-String-Palindrome
    • 1382. Balance-a-Binary-Search-Tree
    • 1451. Rearrange-Words-in-a-Sentence
  • LintCode 的一些
    • 129J ReHashing
    • 594J strStr II
Powered by GitBook
On this page
  • Amazon
  • Google

Was this helpful?

  1. Introduction

面经

Amazon

  • 综合型

    • 一亩三分地的一个还不错的帖子

    • Amazon Behavioral and leadership questions

    • 某人总结的 TimeLine

  • 个例

    • New Grads SDE I

    • SDE I

    • 面经 Optimal Utilization

Google

  • phone call

  • L3

  • L3

  • L4

  • 一道谷歌题

PreviousIntroductionNextGoogle

Last updated 5 years ago

Was this helpful?