main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0391.Perfect Rectangle\Solution.py
9 1 -
A
solution\0300-0399\0393.UTF-8 Validation\Solution.cpp
9 1 -
A
solution\2400-2499\2402.Meeting Rooms III\Solution.cpp
9 1 -
A
solution\0700-0799\0785.Is Graph Bipartite\Solution.cpp
9 1 -
A
solution\0300-0399\0348.Design Tic-Tac-Toe\Solution.py
9 1 -
A
solution\2400-2499\2402.Meeting Rooms III\Solution.java
9 1 -
A
solution\0600-0699\0678.Valid Parenthesis String\Solution.cpp
9 1 -
A
solution\0700-0799\0785.Is Graph Bipartite\Solution.java
9 1 -
A
solution\2300-2399\2384.Largest Palindromic Number\Solution.java
9 1 -
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.cpp
9 1 -
A
solution\0600-0699\0677.Map Sum Pairs\Solution.java
9 1 2
A
solution\0700-0799\0778.Swim in Rising Water\Solution.py
9 1 -
A
solution\0500-0599\0536.Construct Binary Tree from String\Solution.java
9 1 -
A
solution\0400-0499\0402.Remove K Digits\Solution.cpp
9 1 -
A
solution\0400-0499\0402.Remove K Digits\Solution.java
9 1 -
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.ts
9 1 -
A
solution\2300-2399\2376.Count Special Integers\Solution.py
9 1 -
A
solution\0400-0499\0403.Frog Jump\Solution.py
9 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.cpp
9 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.ts
9 1 -