main
leetcode-assembly
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0347.Top K Frequent Elements\Solution.java
3 1 -
A
solution\0300-0399\0370.Range Addition\Solution.js
3 1 -
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.ts
3 1 -
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.ts
3 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
3 1 -
A
solution\0500-0599\0503.Next Greater Element II\Solution.js
3 1 -
A
solution\0500-0599\0503.Next Greater Element II\Solution.ts
3 1 -
A
solution\0300-0399\0347.Top K Frequent Elements\Solution.ts
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.py
3 1 -
A
solution\0700-0799\0701.Insert into a Binary Search Tree\Solution.java
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.java
3 1 -
A
solution\0400-0499\0413.Arithmetic Slices\Solution.java
3 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.py
3 1 -
A
solution\0400-0499\0413.Arithmetic Slices\Solution.ts
3 1 -
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.java
3 1 -
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.c
3 1 -
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.java
3 1 -
A
solution\2300-2399\2350.Shortest Impossible Sequence of Rolls\Solution.java
3 1 -
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.ts
3 1 -
A
solution\0500-0599\0508.Most Frequent Subtree Sum\Solution.py
3 1 -