main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.py
5 1 -
A
solution\2500-2599\2554.Maximum Number of Integers to Choose From a Range I\Solution.java
5 1 -
A
solution\0800-0899\0817.Linked List Components\Solution.js
5 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.ts
5 1 -
A
solution\0300-0399\0347.Top K Frequent Elements\Solution.cpp
5 1 -
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.java
5 1 1
A
solution\0800-0899\0861.Score After Flipping Matrix\Solution.ts
5 1 -
A
solution\2300-2399\2363.Merge Similar Items\Solution.c
5 1 -
A
solution\0400-0499\0454.4Sum II\Solution.java
5 1 -
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.java
5 1 -
A
solution\2500-2599\2553.Separate the Digits in an Array\Solution.c
5 1 -
A
solution\0400-0499\0455.Assign Cookies\Solution.java
5 1 -
A
solution\0800-0899\0866.Prime Palindrome\Solution.py
5 1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.java
5 1 -
A
solution\0800-0899\0869.Reordered Power of 2\Solution.java
5 1 -
A
solution\0600-0699\0606.Construct String from Binary Tree\Solution.java
5 1 -
A
solution\0600-0699\0606.Construct String from Binary Tree\Solution.ts
5 1 -
A
solution\0400-0499\0456.132 Pattern\Solution.java
5 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.py
5 1 -
A
solution\2400-2499\2447.Number of Subarrays With GCD Equal to K\Solution.ts
5 1 -