main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2243.Calculate Digit Sum of a String\Solution.cpp
4 1 -
A
solution\2200-2299\2243.Calculate Digit Sum of a String\Solution.java
4 1 -
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.ts
4 1 -
A
solution\2400-2499\2406.Divide Intervals Into Minimum Number of Groups\Solution.cpp
4 1 -
A
solution\0400-0499\0430.Flatten a Multilevel Doubly Linked List\Solution.java
4 1 -
A
solution\2200-2299\2244.Minimum Rounds to Complete All Tasks\Solution.cpp
4 1 -
A
solution\0800-0899\0860.Lemonade Change\Solution.ts
4 1 -
A
solution\2100-2199\2134.Minimum Swaps to Group All 1's Together II\Solution.py
4 1 -
A
solution\0800-0899\0898.Bitwise ORs of Subarrays\Solution.java
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.cpp
4 1 -
A
solution\0800-0899\0899.Orderly Queue\Solutioin.java
4 1 1
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.java
4 1 1
A
solution\2400-2499\2406.Divide Intervals Into Minimum Number of Groups\Solution.java
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.java
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.py
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.cpp
4 1 -
A
solution\0900-0999\0900.RLE Iterator\Solution.java
4 1 1
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.java
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.py
4 1 -