main
leetcode-ion
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2259.Remove Digit From Number to Maximize Result\Solution.ts
4 1 -
A
solution\0700-0799\0794.Valid Tic-Tac-Toe State\Solution.go
 1 -
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.go
 1 -
A
solution\0500-0599\0556.Next Greater Element III\Solution.go
 1 -
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.ts
3 1 -
A
solution\0700-0799\0794.Valid Tic-Tac-Toe State\Solution.js
15 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.go
 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.ts
2 1 -
A
solution\2300-2399\2317.Maximum XOR After Operations\Solution.go
 1 -
A
solution\2300-2399\2316.Count Unreachable Pairs of Nodes in an Undirected Graph\Solution.ts
5 1 -
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.go
 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.go
 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.go
 1 -
A
solution\2200-2299\2274.Maximum Consecutive Floors Without Special Floors\Solution.ts
1 1 -
A
solution\2200-2299\2267.Check if There Is a Valid Parentheses String Path\Solution.java
11 1 -
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.go
 1 -
A
solution\0300-0399\0314.Binary Tree Vertical Order Traversal\Solution.cpp
7 1 -
A
solution\0400-0499\0453.Minimum Moves to Equal Array Elements\Solution.ts
1 1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.go
 1 -
A
solution\0800-0899\0866.Prime Palindrome\Solution.cpp
0 1 -