main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.ts
3 1 -
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.ts
3 1 -
A
solution\2200-2299\2246.Longest Path With Different Adjacent Characters\Solution.ts
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.java
3 1 -
A
solution\2200-2299\2264.Largest 3-Same-Digit Number in String\Solution.py
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.js
3 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.py
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.ts
3 1 -
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.ts
3 1 -
A
solution\0600-0699\0658.Find K Closest Elements\Solution.py
3 1 -
A
solution\0600-0699\0658.Find K Closest Elements\Solution.ts
3 1 -
A
solution\2200-2299\2237.Count Positions on Street With Required Brightness\Solution.py
3 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.java
3 1 -
A
solution\2200-2299\2233.Maximum Product After K Increments\Solution.py
3 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.py
3 1 -
A
solution\2200-2299\2233.Maximum Product After K Increments\Solution.js
3 1 -
A
solution\0300-0399\0396.Rotate Function\Solution.cpp
3 1 -
A
solution\2200-2299\2229.Check if an Array Is Consecutive\Solution.java
3 1 -
A
solution\0300-0399\0396.Rotate Function\Solution.java
3 1 -
A
solution\2200-2299\2222.Number of Ways to Select Buildings\Solution.py
3 1 -