main
leetcode-swift
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.java
5 1 -
A
solution\0700-0799\0706.Design HashMap\Solution.go
 1 -
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.c
4 1 -
A
solution\2000-2099\2031.Count Subarrays With More Ones Than Zeros\Solution.cpp
10 1 -
A
solution\0700-0799\0706.Design HashMap\Solution.ts
 1 -
A
solution\0400-0499\0407.Trapping Rain Water II\Solution.py
15 1 -
A
solution\2000-2099\2028.Find Missing Observations\Solution.java
5 1 -
A
solution\2000-2099\2042.Check if Numbers Are Ascending in a Sentence\Solution.go
 1 -
A
solution\2100-2199\2100.Find Good Days to Rob the Bank\Solution.cpp
8 1 -
A
solution\2000-2099\2099.Find Subsequence of Length K With the Largest Sum\Solution.java
4 1 -
A
solution\2000-2099\2071.Maximum Number of Tasks You Can Assign\Solution.cpp
11 1 -
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.go
 1 -
A
solution\2000-2099\2053.Kth Distinct String in an Array\Solution.cpp
5 1 -
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.py
3 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.py
2 1 -
A
solution\2000-2099\2042.Check if Numbers Are Ascending in a Sentence\Solution.java
4 1 -
A
solution\2000-2099\2042.Check if Numbers Are Ascending in a Sentence\Solution.cpp
4 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.py
9 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.go
 1 -