Toggle navigation
Leetcode Solution
Home
About
Tags
Tags
leetcode
Python
string
array
tree
list
linklist
recursion
design
dp
DFS
linkedlist
leetcode
Two City Scheduling
Delete Node in a Linked List
Edit Distance
Compare Version Numbers
Invert Binary Tree
K Closest Points to Origin
Course Schedule
Counting Bits
Min Stack
Possible Bipartition
Contiguous Array
Uncrossed Lines
Construct Binary Search Tree from Preorder Traversal
Interval List Intersections
Sort Characters By Frequency
Count Square Submatrices with All Ones
Kth Smallest Element in a BST
Online Stock Span
Permutation in String
Find All Anagrams in a String
Odd Even Linked List
Maximum Sum Circular Subarray
Implement Trie (Prefix Tree)
Construct Binary Tree from Preorder and Inorder Traversal
Remove K Digits
Single Element in a Sorted Array
Count Triplets That Can Form Two Arrays of Equal XOR
Build an Array With Stack Operations
Flood Fill
Find the Town Judge
Pascal's Triangle II
Search in a Binary Tree
Swap Nodes In Pairs
Reverse a singly linked list
Valid Perfect Square
Check If It Is a Straight Line
Ransom Note
Number Complement
First Bad Version
Cousins in Binary Tree
Search in Rotated Sorted Array
Majority Element
First Unique Character in a String
Jewels and Stones
Python
Two City Scheduling
Delete Node in a Linked List
Edit Distance
Compare Version Numbers
Invert Binary Tree
K Closest Points to Origin
Course Schedule
Counting Bits
Min Stack
Possible Bipartition
Contiguous Array
Uncrossed Lines
Construct Binary Search Tree from Preorder Traversal
Interval List Intersections
Sort Characters By Frequency
Count Square Submatrices with All Ones
Kth Smallest Element in a BST
Online Stock Span
Permutation in String
Find All Anagrams in a String
Odd Even Linked List
Maximum Sum Circular Subarray
Implement Trie (Prefix Tree)
Construct Binary Tree from Preorder and Inorder Traversal
Remove K Digits
Single Element in a Sorted Array
Count Triplets That Can Form Two Arrays of Equal XOR
Build an Array With Stack Operations
Flood Fill
Find the Town Judge
Pascal's Triangle II
Search in a Binary Tree
Swap Nodes In Pairs
Reverse a singly linked list
Valid Perfect Square
Check If It Is a Straight Line
Ransom Note
Number Complement
First Bad Version
Cousins in Binary Tree
Search in Rotated Sorted Array
Majority Element
First Unique Character in a String
Jewels and Stones
string
Compare Version Numbers
Sort Characters By Frequency
Permutation in String
Find All Anagrams in a String
Ransom Note
First Unique Character in a String
Jewels and Stones
array
Two City Scheduling
K Closest Points to Origin
Counting Bits
Min Stack
Possible Bipartition
Contiguous Array
Uncrossed Lines
Interval List Intersections
Maximum Sum Circular Subarray
First Bad Version
Search in Rotated Sorted Array
Majority Element
tree
Invert Binary Tree
Construct Binary Search Tree from Preorder Traversal
Kth Smallest Element in a BST
Implement Trie (Prefix Tree)
Construct Binary Tree from Preorder and Inorder Traversal
Search in a Binary Tree
Cousins in Binary Tree
list
Odd Even Linked List
Remove K Digits
Single Element in a Sorted Array
Count Triplets That Can Form Two Arrays of Equal XOR
Build an Array With Stack Operations
Flood Fill
Find the Town Judge
Check If It Is a Straight Line
linklist
Swap Nodes In Pairs
Reverse a singly linked list
recursion
Search in a Binary Tree
Swap Nodes In Pairs
Reverse a singly linked list
design
Online Stock Span
dp
Edit Distance
Uncrossed Lines
Count Square Submatrices with All Ones
DFS
Course Schedule
Min Stack
Possible Bipartition
linkedlist
Delete Node in a Linked List