main
leetcode-odin
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.go
 1 -
A
solution\2500-2599\2542.Maximum Subsequence Score\Solution.java
4 1 -
A
solution\0900-0999\0934.Shortest Bridge\Solution.py
11 1 -
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.cpp
6 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.ts
2 1 -
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.java
7 1 -
A
solution\0900-0999\0935.Knight Dialer\Solution.go
 1 -
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.ts
5 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.c
5 1 -
A
solution\0600-0699\0692.Top K Frequent Words\Solution.java
6 1 -
A
solution\2000-2099\2024.Maximize the Confusion of an Exam\Solution.java
6 1 -
A
solution\0400-0499\0490.The Maze\Solution.go
 1 -
A
solution\0600-0699\0694.Number of Distinct Islands\Solution.cpp
11 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.cpp
5 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.go
 1 -
A
solution\0600-0699\0694.Number of Distinct Islands\Solution.go
 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.java
5 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.py
6 1 -
A
solution\0300-0399\0391.Perfect Rectangle\Solution.py
9 1 -
A
solution\0400-0499\0490.The Maze\Solution.java
11 1 -