main
leetcode-modula
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0921.Minimum Add to Make Parentheses Valid\Solution.cpp
5 1 -
A
solution\2000-2099\2053.Kth Distinct String in an Array\Solution.java
5 1 -
A
solution\2400-2499\2410.Maximum Matching of Players With Trainers\Solution.java
5 1 -
A
solution\2300-2399\2310.Sum of Numbers With Units Digit K\Solution.java
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.ts
5 1 2
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.java
5 1 -
A
solution\0600-0699\0647.Palindromic Substrings\Solution.cpp
5 1 -
A
solution\0900-0999\0930.Binary Subarrays With Sum\Solution.js
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.cpp
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5 1 -
A
solution\0400-0499\0467.Unique Substrings in Wraparound String\Solution.java
5 1 -
A
solution\2200-2299\2290.Minimum Obstacle Removal to Reach Corner\Solution.ts
5 1 -
A
solution\2200-2299\2222.Number of Ways to Select Buildings\Solution.java
5 1 -
A
solution\0900-0999\0935.Knight Dialer\Solution.java
5 1 -
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.ts
5 1 -
A
solution\0900-0999\0938.Range Sum of BST\Solution.java
5 1 -
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.java
5 1 -
A
solution\2200-2299\2248.Intersection of Multiple Arrays\Solution.cpp
5 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.c
5 1 -
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.java
5 1 -