main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2316.Count Unreachable Pairs of Nodes in an Undirected Graph\Solution.ts
5 1 -
A
solution\0400-0499\0455.Assign Cookies\Solution.java
5 1 -
A
solution\0900-0999\0954.Array of Doubled Pairs\Solution.java
5 1 -
A
solution\2400-2499\2411.Smallest Subarrays With Maximum Bitwise OR\Solution.java
5 1 -
A
solution\0300-0399\0324.Wiggle Sort II\Solution.js
5 1 -
A
solution\2300-2399\2311.Longest Binary Subsequence Less Than or Equal to K\Solution.java
5 1 -
A
solution\0200-0299\0295.Find Median from Data Stream\Solution.py
5 1 -
A
solution\2300-2399\2305.Fair Distribution of Cookies\Solution.ts
5 1 -
A
solution\2300-2399\2304.Minimum Path Cost in a Grid\Solution.ts
5 1 -
A
solution\0400-0499\0456.132 Pattern\Solution.cpp
5 1 -
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.java
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.c
5 1 -
A
solution\0300-0399\0377.Combination Sum IV\Solution.cpp
5 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.cpp
5 1 -
A
solution\2400-2499\2409.Count Days Spent Together\Solution.cpp
5 1 -
A
solution\2300-2399\2304.Minimum Path Cost in a Grid\Solution.java
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.ts
5 1 2
A
solution\0400-0499\0456.132 Pattern\Solution.java
5 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.java
5 1 -