main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2492.Minimum Score of a Path Between Two Cities\Solution.py
2 1 -
A
solution\2500-2599\2510.Check if There is a Path With Equal Number of 0's And 1's\Solution.py
2 1 -
A
solution\2400-2499\2491.Divide Players Into Teams of Equal Skill\Solution.ts
2 1 -
A
solution\0300-0399\0384.Shuffle an Array\Solution.js
2 1 -
A
solution\0800-0899\0808.Soup Servings\Solution.py
2 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.ts
2 1 -
A
solution\2400-2499\2489.Number of Substrings With Fixed Ratio\Solution.cpp
2 1 -
A
solution\0700-0799\0790.Domino and Tromino Tiling\Solution.cpp
2 1 -
A
solution\2400-2499\2490.Circular Sentence\Solution.js
2 1 -
A
solution\2400-2499\2477.Minimum Fuel Cost to Report to the Capital\Solution.py
2 1 -
A
solution\0600-0699\0655.Print Binary Tree\Solution.py
2 1 -
A
solution\0600-0699\0655.Print Binary Tree\Solution.ts
2 1 -
A
solution\2200-2299\2224.Minimum Number of Operations to Convert Time\Solution.java
2 1 -
A
solution\2400-2499\2491.Divide Players Into Teams of Equal Skill\Solution.js
2 1 -
A
solution\2200-2299\2224.Minimum Number of Operations to Convert Time\Solution.cpp
2 1 -
A
solution\0600-0699\0657.Robot Return to Origin\Solution.ts
2 1 -
A
solution\2400-2499\2467.Most Profitable Path in a Tree\Solution.py
2 1 -
A
solution\0900-0999\0974.Subarray Sums Divisible by K\Solution.java
2 1 -
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.py
2 1 -
A
solution\2400-2499\2458.Height of Binary Tree After Subtree Removal Queries\Solution.py
2 1 -