main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0490.The Maze\Solution.py
8 1 -
A
solution\2300-2399\2360.Longest Cycle in a Graph\Solution.py
8 1 -
A
solution\0900-0999\0962.Maximum Width Ramp\Solution.py
8 1 -
A
solution\2300-2399\2397.Maximum Rows Covered by Columns\Solution.java
8 1 -
A
solution\0300-0399\0393.UTF-8 Validation\Solution.java
8 1 -
A
solution\0900-0999\0937.Reorder Data in Log Files\Solution.ts
8 1 -
A
solution\0300-0399\0393.UTF-8 Validation\Solution.py
8 1 -
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.cpp
8 1 -
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.java
8 1 -
B
solution\2000-2099\2065.Maximum Path Quality of a Graph\Solution.ts
8 1 11
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.py
8 1 -
A
solution\2300-2399\2347.Best Poker Hand\Solution.java
8 1 -
A
solution\2300-2399\2347.Best Poker Hand\Solution.c
8 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.cpp
8 1 -
A
solution\2000-2099\2061.Number of Spaces Cleaning Robot Cleaned\Solution.cpp
8 1 -
A
solution\0900-0999\0929.Unique Email Addresses\Solution.js
8 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.cpp
8 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.java
8 1 -
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.java
8 1 -
A
solution\0300-0399\0348.Design Tic-Tac-Toe\Solution.java
8 1 1