main
leetcode-swift
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.java
7 1 -
A
solution\1000-1099\1004.Max Consecutive Ones III\Solution.go
 1 -
A
solution\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.java
6 1 -
A
solution\1000-1099\1004.Max Consecutive Ones III\Solution.java
5 1 -
A
solution\0400-0499\0496.Next Greater Element I\Solution.cpp
6 1 -
A
solution\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.py
6 1 -
A
solution\1000-1099\1005.Maximize Sum Of Array After K Negations\Solution.cpp
10 1 -
A
solution\0600-0699\0690.Employee Importance\Solution.java
4 1 -
A
solution\1000-1099\1005.Maximize Sum Of Array After K Negations\Solution.go
 1 -
A
solution\1000-1099\1005.Maximize Sum Of Array After K Negations\Solution.java
10 1 -
A
solution\0400-0499\0402.Remove K Digits\Solution.cpp
9 1 -
A
solution\0400-0499\0496.Next Greater Element I\Solution.go
 1 -
A
solution\0600-0699\0690.Employee Importance\Solution.js
2 1 -
A
solution\1000-1099\1005.Maximize Sum Of Array After K Negations\Solution.py
9 1 -
A
solution\0600-0699\0690.Employee Importance\Solution.py
2 1 -
A
solution\1000-1099\1006.Clumsy Factorial\Solution.java
6 1 -
A
solution\0400-0499\0496.Next Greater Element I\Solution.java
5 1 -
A
solution\0600-0699\0691.Stickers to Spell Word\Solution.cpp
10 1 -
A
solution\1000-1099\1006.Clumsy Factorial\Solution.py
5 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.cpp
7 1 -