main
leetcode-haxe
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0443.String Compression\Solution.java
6 1 -
A
solution\0400-0499\0443.String Compression\Solution.py
6 1 -
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.ts
6 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.cpp
6 1 -
A
solution\0700-0799\0720.Longest Word in Dictionary\Solution.ts
6 1 -
A
solution\0500-0599\0599.Minimum Index Sum of Two Lists\Solution.cpp
6 1 -
A
solution\0500-0599\0599.Minimum Index Sum of Two Lists\Solution.java
6 1 -
A
solution\0500-0599\0599.Minimum Index Sum of Two Lists\Solution.py
6 1 -
A
solution\2300-2399\2345.Finding the Number of Visible Mountains\Solution.java
6 1 -
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.cpp
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.ts
6 1 1
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6 1 -
A
solution\0700-0799\0719.Find K-th Smallest Pair Distance\Solution.cpp
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.cpp
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.java
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.js
6 1 1
A
solution\1000-1099\1013.Partition Array Into Three Parts With Equal Sum\Solution.py
6 1 -
A
solution\0300-0399\0379.Design Phone Directory\Solution.java
6 1 1
A
solution\0300-0399\0379.Design Phone Directory\Solution.py
6 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.cpp
6 1 2