main
leetcode-modula
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0899.Orderly Queue\Solution.cpp
4 1 -
A
solution\2000-2099\2099.Find Subsequence of Length K With the Largest Sum\Solution.java
4 1 -
A
solution\2100-2199\2108.Find First Palindromic String in the Array\Solution.ts
4 1 -
A
solution\2100-2199\2107.Number of Unique Flavors After Sharing K Candies\Solution.cpp
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\2100-2199\2103.Rings and Rods\Solution.java
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.cpp
4 1 -
A
solution\2100-2199\2103.Rings and Rods\Solution.cpp
4 1 -
A
solution\0400-0499\0441.Arranging Coins\Solution.cpp
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\2400-2499\2419.Longest Subarray With Maximum Bitwise AND\Solution.cpp
4 1 -
A
solution\2400-2499\2412.Minimum Money Required Before Transactions\Solution.java
4 1 -
A
solution\2200-2299\2243.Calculate Digit Sum of a String\Solution.java
4 1 -
A
solution\2100-2199\2110.Number of Smooth Descent Periods of a Stock\Solution.cpp
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.cpp
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.java
4 1 -
A
solution\2400-2499\2408.Design SQL\Solution.java
4 1 1
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.py
4 1 -
A
solution\2400-2499\2408.Design SQL\Solution.cpp
4 1 -