main
leetcode-fortran
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0672.Bulb Switcher II\Solution.py
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.js
6 1 1
A
solution\0600-0699\0670.Maximum Swap\Solution.ts
6 1 -
A
solution\2400-2499\2415.Reverse Odd Levels of Binary Tree\Solution.ts
6 1 -
A
solution\2000-2099\2070.Most Beautiful Item for Each Query\Solution.java
6 1 -
A
solution\0600-0699\0670.Maximum Swap\Solution.java
6 1 -
A
solution\2300-2399\2349.Design a Number Container System\Solution.java
6 1 1
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6 1 -
A
solution\2100-2199\2105.Watering Plants II\Solution.py
6 1 -
A
solution\0300-0399\0379.Design Phone Directory\Solution.java
6 1 1
A
solution\2300-2399\2328.Number of Increasing Paths in a Grid\Solution.ts
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.py
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.java
6 1 -
A
solution\0600-0699\0666.Path Sum IV\Solution.java
6 1 -
A
solution\2300-2399\2325.Decode the Message\Solution.c
6 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.ts
6 1 -
A
solution\0900-0999\0941.Valid Mountain Array\Solution.py
6 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.py
6 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.java
6 1 -
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.py
6 1 -