main
leetcode-haxe
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0690.Employee Importance\Solution.java
4 1 -
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.cpp
4 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.ts
4 1 -
A
solution\2100-2199\2195.Append K Integers With Minimal Sum\Solution.py
4 1 -
A
solution\0400-0499\0456.132 Pattern\Solution.ts
4 1 -
A
solution\0600-0699\0692.Top K Frequent Words\Solution.cpp
4 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.py
4 1 -
A
solution\0600-0699\0694.Number of Distinct Islands\Solution.py
4 1 -
A
solution\2100-2199\2195.Append K Integers With Minimal Sum\Solution.cpp
4 1 -
A
solution\0300-0399\0350.Intersection of Two Arrays II\Solution.cpp
4 1 -
A
solution\0600-0699\0695.Max Area of Island\Solution.py
4 1 -
A
solution\2000-2099\2067.Number of Equal Count Substrings\Solution.js
4 1 -
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.java
4 1 -
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.py
4 1 -
A
solution\2000-2099\2064.Minimized Maximum of Products Distributed to Any Store\Solution.ts
4 1 -
A
solution\0700-0799\0700.Search in a Binary Search Tree\Solution.java
4 1 -
A
solution\0700-0799\0700.Search in a Binary Search Tree\Solution.py
4 1 -
A
solution\0300-0399\0350.Intersection of Two Arrays II\Solution.js
4 1 -
A
solution\0700-0799\0701.Insert into a Binary Search Tree\Solution.cpp
4 1 -
A
solution\0400-0499\0496.Next Greater Element I\Solution.js
4 1 -