EasyForces
Index
1-100
101-200
201-300
301-400
401-500
501-600
601-700
701-800
801-900
901-1000
1001-1100
1101-1200
1201-1300
1301-1400
1701-1800
Tags
Array
String
Dynamic Programming
Tree
Graph
Math
Two Pointers
Greedy
Binary Search
Heap
Depth-first Search
Breadth-first Search
Search
EasyForces
The LeetCode Solution for Python.
Array
21
38
8
Minimum Number of Operations to Move All Balls to Each Box
Form Array by Concatenating Subarrays of Another Array
Minimum Changes To Make Alternating Binary String
Full List
String
11
15
5
Merge Strings Alternately
Longest Nice Substring
Count Number of Homogenous Substrings
Full List
Dynamic Programming
2
12
11
Maximum Number of Events That Can Be Attended II
Linked List in Binary Tree
Maximum Product of Splitted Binary Tree
Full List
Tree
33
82
11
Tree of Coprimes
Linked List in Binary Tree
Maximum Product of Splitted Binary Tree
Full List
Graph
0
5
4
Map of Highest Peak
Minimum Degree of a Connected Trio in a Graph
Find the City With the Smallest Number of Neighbors at a Threshold Distance
Full List
Math
5
8
2
Tree of Coprimes
Count Ways to Make Array With Product
Four Divisors
Full List
Two Pointers
4
9
2
Minimum Length of String After Deleting Similar Ends
Max Consecutive Ones III
Merge Sorted Array
Full List
Greedy
3
11
4
Minimum Number of Operations to Move All Balls to Each Box
Buildings With an Ocean View
Form Array by Concatenating Subarrays of Another Array
Full List
Binary Search
3
9
2
Minimum Limit of Balls in a Bag
Maximum Number of Events That Can Be Attended II
Count Negative Numbers in a Sorted Matrix
Full List
Heap
0
1
1
Minimum Limit of Balls in a Bag
Merge k Sorted Lists
Full List
Depth-first Search
10
28
9
Tree of Coprimes
Check if There is a Valid Path in a Grid
Frog Position After T Seconds
Full List
Breadth-first Search
3
14
5
Tree of Coprimes
Map of Highest Peak
Check if There is a Valid Path in a Grid
Full List