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

String

11

15

5

Merge Strings Alternately Longest Nice Substring Count Number of Homogenous Substrings

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

Tree

33

82

11

Tree of Coprimes Linked List in Binary Tree Maximum Product of Splitted Binary Tree

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

Math

5

8

2

Tree of Coprimes Count Ways to Make Array With Product Four Divisors

Two Pointers

4

9

2

Minimum Length of String After Deleting Similar Ends Max Consecutive Ones III Merge Sorted Array

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

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

Heap

0

1

1

Minimum Limit of Balls in a Bag Merge k Sorted Lists

Depth-first Search

10

28

9

Tree of Coprimes Check if There is a Valid Path in a Grid Frog Position After T Seconds

Breadth-first Search

3

14

5

Tree of Coprimes Map of Highest Peak Check if There is a Valid Path in a Grid