main
leetcode-nushell
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2429.Minimize XOR\Solution.cpp
3 1 -
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.java
5 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.java
3 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.cpp
4 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.ts
2 1 -
A
solution\0800-0899\0866.Prime Palindrome\Solution.cpp
12 1 -
A
solution\2400-2499\2430.Maximum Deletions on a String\Solution.go
 1 -
A
solution\0400-0499\0435.Non-overlapping Intervals\Solution.ts
3 1 -
A
solution\2400-2499\2492.Minimum Score of a Path Between Two Cities\Solution.go
 1 -
A
solution\2400-2499\2492.Minimum Score of a Path Between Two Cities\Solution.cpp
4 1 -
A
solution\2400-2499\2461.Maximum Sum of Distinct Subarrays With Length K\Solution.go
 1 -
A
solution\2400-2499\2453.Destroy Sequential Targets\Solution.cpp
6 1 -
A
solution\2400-2499\2447.Number of Subarrays With GCD Equal to K\Solution.java
6 1 -
A
solution\2400-2499\2444.Count Subarrays With Fixed Bounds\Solution.go
 1 -
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.go
 1 -
A
solution\0300-0399\0337.House Robber III\Solution.go
 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.ts
2 1 -
A
solution\0400-0499\0460.LFU Cache\Solution.go
 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.py
1 1 -
A
solution\0900-0999\0959.Regions Cut By Slashes\Solution.py
7 1 -