🌃
Limited Algorithm
CtrlK
  • Summary
    • Check List
    • Be still
    • Miscellaneous
    • Cheating Sheet
    • Problem Solving
  • Hash & TreeMap
    • HashMap & HashSet
      • HashMap API
      • HashSet API
    • TreeMap(Balanced Binary Search Tree)
      • TreeSet API
      • TreeMap API
    • Hash 底层
    • Practice 1 HashMap Design
    • Practice 2 TreeMap & TreeSet
      • TreeMap& TreeSet Basic Implement
      • Question 1 Find closest value
      • Question 2: Find two elements distance
      • Question 3 Maximum value of each size k subarray
      • Question 4 Find Median in array
  • Queue &Stack & PQ
    • Cheat Sheet
    • Queue & Stack Concept & API
      • Interface Queue
        • Queue API
      • Interface Deque
        • Deque API
        • Stack API
        • Queue API
    • Interface Comparable& Cimparator
      • Summary
      • Interface Comparable<T>
      • Interface Comparator<T>
    • Priority Queue Concept & API
      • API Summary
      • PriorityQueue Constructor
      • Jungle: Stack&Queue&PQ&BST
      • Deep Dive: PriorityQueue需要如何比较两个item(自己定义的/原本就有的)
    • Practice 3 Stack & Queue & Deque Design
      • Implement Stack by LinkedList
      • Implement Stack by Array
      • Implement Queue by LinkedList
      • Implement Queue by Array
      • Design Circular Queue
      • Design Circular Deque
      • Implement Deque by Two Stacks
      • Implement Deque by Three Stacks
    • Practice 4 PriorityQueue
      • Question 0 Compartor小练习
      • Question 0 Design Heap
      • Question 0s Implement MaxHeap
      • Question 0s Implement MinHeap
      • Question 1 Determine if it is a heap
      • Question 2 Determine given Binary Tree is minHeap
    • Practice 5 Top K and Kth Problem
      • Problem 1 K smallest In Unsorted Array
      • Problem 2 Kth Largest Element in an Array
      • Problem 3 K Cloest Value to Target in Unsorted Array
      • Problem 4 Top K Frequent Words
      • Problem 4 Top K Frequent Words面试版本
  • Hybrid Data Structure
    • Thought and Tools
      • Tool: Quick Select
      • Why DLL?
      • Handle update/remove value more efficient
      • Swap- Swap
      • Handling Randomness & Cache
    • Practice 6: Common Hybrid Data Structure Design
      • Problem 1 LRU cache
      • Problem 2 First Non-Repeating Characters
      • Problem 3 Implementation All O(1) data structure
      • Problem 4 Design Underground System
    • Advance 1: Find the Median from Data Stream/Sliding Window
      • Method 0 Sorted?
      • Method 1 Two Heap
      • Method 1.1 Two Heap with Lazy Deletion
      • Method 1.2 Two TreeSets
      • Method 2 One TreeSet
      • Method 2(not recommend) Two TreeMaps/ One TreeMap
    • Advance 2: Top K set 1 value
      • Kth largest element in an array
      • Merge K sorted lists
    • Advance 3: Top K set 2 freq
      • Top K Frequent Elements
      • LFU cache
      • LRU cache
  • Graph
    • Summary
    • 基本功&母体 skip
      • All reachable problem ---island
      • Topological Order--- course schedule
      • Shortest Path - rotting oranges
      • Greedy?Best Solution - Trapping Rain Water
      • All paths - IP address
      • 综合训练—— Flights within K stops
    • Graph Theory II& III Problem of Connectivity and Reachable
      • Question 0 Traversal & Reachable模版
      • Question 1 Island 母体二刷
      • Question 2 Number of connected Components in an Undirected Graph
      • Question 3 Bipartite
      • Question 1 Graph Valid Tree
      • Question 2 Keys and Rooms
      • Question 3 Evaluate Division
      • Question 4 Account Merge
      • Question 5 Check for Ccontradictions in Equations
      • Question 6 Similar String Groups
    • Graph Theory IV& V:  Shortest Path: BFS
      • Series I & II & III
      • Question 1 Jump Game
      • Question 2 Word Ladder I
      • Question 3 Seven Puzzle
      • Question 4 Shortest Path to Get Food
      • Question 1 Minimum Moves to Spread Stones Over Grid
      • Question 2 Word Ladder kBFS version
      • Series V & VI
      • Question 3 0-1 Matrix
      • Question 4 Rotten Orange
      • Question 5 Walls and gates
    • Graph Theory VI: Shortest Path III Dijkstra Algorithm
      • Dijkstra Algorithm基本过程与理解
      • Question 1 Shortest Time to Office Mr Gao
      • Question 2: Maximum Cost of Trip With K HighWays
      • Question 3 Kth Smallest with Only 3, 5, 7 As Factors
      • Question 4 K th Clostest Point to <0,0,0>
      • Question 5 Kth Smallest Number in Sorted Matrix
      • Problem 6 Trapping Rain Water II
      • Question 7 Trapping Rain Water 1
      • Question Extra Minimum cost to reach city with discounts
    • Graph Theory VIII Topological Order
      • Intro
      • Question 1 Course Schedule
      • Question 2 Course Schedule II
      • Question 3 Parallel Course
      • Question 3+ Parallel Course III
      • Question 4 Find All Possible Recipes from given Supplies
      • Question 5 Alien Dictionary
      • Question 5s Alien Dictionary
    • Graph Theory IX Introduction to Disjoint Set(Union Find)
      • 基础
      • Question 1: Graph Valid Tree
      • Question 2 Number of Island II
    • Graph Theory X: Union Find More Ractcce on UF
      • Question 3 Similar String Groups
      • Question 4 Satisfiability of Equality Equations
      • Side Topic: 如何在图中判断是否有环
      • Question 5 Redundant Connection
      • Question 6 Redundant Connection II
      • Question 7 Sentence Similarity
      • Question 8 Graph coneectivity With Threshold
      • Question 9 POJ1182食物链
    • Graph Theory XI: UF 拓展 && Minimum Spanning Tree I & II
      • Intro Minimum Spanning Tree
      • Compare Prims and Kruskal's Algorithm
      • Implement of Prim's Algorithm
      • Implement of Kruskal's Algorithm
      • Compare Prims and Dijkstra
      • Problem 1 Connecting Cities With Minimum cost
      • Problem 2: Min Cost to Connect All Points
      • Problem 3: Optimize Water Distribution in a Village
  • Graph Backtracking and Others
    • Graph Theory XIII-XIV DFS Backtracking I
      • Basic
      • Problem 1 All Path From Source to Target
      • Problem 2 Word Search
      • Problem 3 Unique Path III
    • Graph Theory XIV DFS3 Backtracking II Combination and Permutation
      • Problem 1 Subset I (combination)母题
      • Problem 2 Subset II with duplication
      • Problem 3 Permutation I母题
      • Problem 4 Permutation II with duplication
      • Problem 5 Combination of coins
      • Problem 6 Two Subsets With Min Difference
      • Problem 7 All Subset of Size K
      • Problem 8 All Subset II of Size K
    • Graph Theory XV DFS Backtracking III Iterator
      • Side Topic: Iterator in Java
      • Iterator for Combination and Permutation
      • Question 2 Iterator for Combination
      • Question 3 Iterator for Permutation
      • Question 4 Next Greater Element III
      • Question Combinations & Iterator for Combination
    • Graph Theory XVI BackTracking IV
      • Question 0 Get Roman Number
      • Question 1: All Valid Permutations Of Parentheses I
      • Question 1s Check if a Parenthesis String Can be Valid
      • Question 2 Generate All Valid Parentheses III
      • Question 4 N Queens
    • Graph Theory XVII Backtracking V
      • Part I 马甲题
      • Question 1 Problem Beautiful Arrangement
      • Problem 2 Infinite Loop Around the Dinner Table
      • Question 3 Letter Case Permutation
      • Part II: Pad/Board/Gamming(N Queens 母题)
      • Question 1 Letter Combination of a Phone Number
      • Problem 2 Grid Illumination
      • Problem 3 Minimum time to finish all jobs
    • Trie
      • Intro
      • Question 1 Intro Trie: How to design a dictionary
      • Question 2 World Search I& II
  • Tree
    • Tree Representation
    • Tree Concept
    • Tree with Pure Recursion and Backtracking Summary
    • Tree and Recursion 1
      • Question1 Find Height
      • Question 2 IsBalanced
      • Question 4 Symmetric Binary Tree
      • Question 5 Tweeked Binary Tree
      • Question 6 Flatten Binary Tree to Linked List
      • Question 7 Binary Tree Upside Down
      • Problem 8 Count Univalue Subtree
      • Problem 9
    • Tree Backtracking I: Intro and Compare to Pure Recursion
      • Problem 1 Maximum Path Sum Binary Tree I
      • Problem 2 Maximum Path Sum Binary Tree II 标准recursion模版
      • Problem 3 Maximum PAth Sum Binary Tree III
      • Problem 4 Is Binary Search Tree or Not
      • Problem 5 Binary Tree Path
      • Problem 6 Longest Univalue Path
    • Tree Backtracking II: Compare to Tree Pure Recursion
      • Problem 1 Longest ZigZag Path in a Binary Tree
      • Problem 2: Longest Ascending Path Binary Tree
      • Problem 3 Sum Root to Leaf Numbers
      • Problem 4 Binary Tree Longest Consecutive Sequence
      • Problem 5 Binary Tree Longest Consecutive Sequence II
    • Binary Tree Traversal I Depth First Search
  • Pure Recursion & Backtracking
    • Question 1 Power Function
    • Question 2
  • Dynamic Programming
    • Summary
    • Dynamic Programming I
    • Dynamic Programming II From Bactracking to Dynamic Programming
      • Review
      • Question 1: Range Sum query 1D
      • Question 2 Range Sum Query 2D
      • Question 3
      • Question 4 Array Hopper I
      • Question 5 Array Hopper II
      • Part II: From Backtracking to Dynamic Programming
      • Question 6 Longest Increasing Subsequence母体
    • Dynamic Programming III
      • Question 6 Longest Increasing Subsequece 优化
      • Question 1 Find the longest Valid Obstacle Course at Each Position
      • Question 2 Russian Doll Envelopes
      • Question 3 Longest Ascending Subsequence II
      • Question 4 Longest Consecutive 1
      • Question 5 Longest Cross of 1s
    • Dynamic Programming IV双序列匹配问题
      • Problem 1: Longest Common Substring 母体
      • Side Topic: 空间优化的一般技巧
      • Problem 2: Largest Square Of 1s 母体
      • Problem 3: Edit Distance母体
    • Dynamic Programming V: 双序列匹配问题
      • Problem 1: Delete Operation for Two Strings
      • Problem 2: Minimum ASCII Delete Sum for Two Strings
      • Problem 3: Minimum-Window-SubString
      • Problem 4: Longest Common Subsequence母体
      • Problem 5 Minimum-Window-Subsequence
    • Dynamic Programming 切割问题
      • Introduction
      • Perfect Square
    • Dynamic Programming切割问题2
      • Introduction 2
      • Maximum Profit in Job Scheduling Review
      • Problem 2 Largest Sum of Averages
      • Problem 3 Split Array Largest Sum
    • Dynamic Programming区间型DP
      • Problem 1: Palindrome Partitioning
      • Problem 2 Palindrome Partitioning II可以当母体练
      • Problem 3 Pizza
      • Problem 4 Valid Palindrome III
  • Others
    • Bit Operation
      • Bit Basic Operation
      • Question 1 determine wheter a number x is a power of 2
      • Question 2 Determine the number of bits that are different between two integers
      • Question3 What happens if we assign a negative number to an unsigned integer
      • Question4 determine wheter a string contain unique characters
      • Question 5 How to reverse all bits of a number?
      • Question 6 Decimal to Hexadecimal
    • Binary Search Practice
      • Question 1 Classical Binary Search
      • Question 2 Search in Sorted Matrix
      • Question 3 First Occurrence
      • Question 4 Last Occurrence
      • Question 5 Closest Element to target
      • Question 6 K Closest Element to Target
      • Question 7 Smallest Element Larger than Target
      • Question 8 Search in Bitonic Array
      • Question 9 Search Unknown Value
    • Random
      • Class Random
      • Reservoir Sampling
      • Shuffle Algorithm
      • Extra Practice
    • MonoStack
      • Intro
      • Question 0 Daily Temperature母体
      • Question 1 Next Greater Element I
      • Question 2 Next Greater Element II
      • Question 3 Next Greater Element III
  • Array& LinkedList & String
    • String & Character& StringBuilder
      • String常量池
      • String API
      • Character API
      • StringBuilder API
    • Array/List & LinkedList
      • Array/ List Concept
      • Array/ List API
    • Integer Class
    • Practice 0 Basic Operation & Implement
      • LinkedList 遍历
      • LinkedList Design
    • Practice 1 String & LinkedList
      • Problem 1 Add Binary
      • Problem 2 Plus One
      • Problem 3 Add Strings
      • Problem 4 Add Two Numbers
      • Problem 5 Add Two Numbers
      • Problem 6 Plus One Linked List
      • Problem 7 Add two Polynomial
      • Problem 8 Remove Linked List
      • Problem 9 Delete Linked List
      • Problem 10
      • Problem 11
    • Practice 2 LinkedList & String
      • Question1 Reverse Linked List
      • Question2 Swap Nodes in Pairs
      • Question3 Reverse LinkedList II
      • Question4 Reverse Vowels of a String
      • Question 5 Reverse Words in a String
      • Question 6 Reverse String
      • Question 7 Reverse String II
      • Question 8 Valid Palindrome
      • Question 9 Valid Palindrome II
      • Question 10 Valid Paretheses
      • Question 11 Valid Paretheses II
    • Practice 3 LinkedList & Array
      • Question1: Implement Stack with Linkedlist
      • Question2: Implement Queue with Linkedlist
      • Question3: Merge Two Sorted LinkedList
      • Question 4: Intersection of Two Arrays
      • Question 5 Intersection of Three Sorted Arrays
      • Question 6 Partition Linked List
      • Question 7 ReOrder Linked List
      • Question 8 Check if Linked List is Palindrome
    • Practice 4 Integer, String and Pointers Practice
      • Problem 1 String to Integer
      • Problem 2 Reverse Words in a String
      • Problem 3 Remove COmments
    • Practice 5 Advance String Practice I
      • Problem 1 Valid Parentheses
      • Problem 2 Asteroid Collision
      • Problem 3 Valid Parenthesis String
      • Problem 4 Text Justification
    • KMP
    • Practice X Matrix Rotation
      • Rotate Matrix
  • Adavance Two Pointer
    • Two Points WWJW
    • Question 1 2 Sum Sorted
    • Question 1b 2 Sum II
    • Question 2* Sum from two array
    • Question 3 Valid Triangle Number
    • Question 4 3 Sum
    • Question 4 3Sum Cloest
    • Question 4 3Sum Smaller
    • Question The Latest Time to Catch a Bus
    • Subtopic: 2-diff
    • Subtopic: k pointers
    • Subtopic: 谁小移谁
  • Advance Sliding Window
    • Sliding Window 3 Non fix size longest
    • Sliding Window 4
  • Advance Binary Search
    • Problem 1 Classical Binary Search
    • Enhance Version 2: Given a Sorted Collection(List, Matrix)
    • Problem 8 Classical Binary Search in 2D matrix
    • Enhanced Version 3: Search for what模拟两可missing number
    • Problem 9 Find Missing Number
    • Problem 10 Find Missing Number 2
    • Problem 11 Missing Element in Sorted Array
    • Enhance Version 4 Dont know the search range
    • Problem 12: Search in a Sorted Array of Unknown Size/ First Bad Version
  • Advance Young's Matrix
    • Basic
    • Foundamental operation
  • Java Knowledge
    • Parameter passing
    • Classes, objects and references
    • The objected-oriented paradigm in java
    • Exception
Powered by GitBook
On this page
  1. Array& LinkedList & String

Practice 1 String & LinkedList

5 LinkedList & String& Array I

Add Binary

Plus One

Add Strings

Add Two Numbers

Add Two Numbers II

Plus One Linked List

Add Two Polynomials Represented as Linked Lists

Remove Linked List Elements

Delete Node in a Linked List

Delete the Middle Node of a Linked List

Remove Nth Node From End of List

PreviousLinkedList DesignNextProblem 1 Add Binary

Last updated 1 year ago