Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-c-sharp
394
issues
2
pull requests
3,937
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0953.Verifying an Alien Dictionary\Solution.c
8
1
-
A
solution\2300-2399\2347.Best Poker Hand\Solution.c
8
1
-
A
solution\2000-2099\2086.Minimum Number of Food Buckets to Feed the Hamsters\Solution.cpp
8
1
-
A
solution\0600-0699\0673.Number of Longest Increasing Subsequence\Solution.java
8
1
-
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.cpp
8
1
-
A
solution\2300-2399\2347.Best Poker Hand\Solution.java
8
1
-
A
solution\0500-0599\0501.Find Mode in Binary Search Tree\Solution.java
8
1
-
A
solution\0900-0999\0937.Reorder Data in Log Files\Solution.java
8
1
-
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.java
8
1
-
A
solution\0900-0999\0937.Reorder Data in Log Files\Solution.ts
8
1
-
A
solution\0700-0799\0755.Pour Water\Solution.py
8
1
-
A
solution\0300-0399\0366.Find Leaves of Binary Tree\Solution.cpp
8
1
-
A
solution\0800-0899\0825.Friends Of Appropriate Ages\Solution.py
8
1
-
B
solution\2000-2099\2065.Maximum Path Quality of a Graph\Solution.ts
8
1
11
A
solution\0800-0899\0823.Binary Trees With Factors\Solutioin.java
7
1
1
A
solution\0500-0599\0514.Freedom Trail\Solution.cpp
7
1
-
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.py
7
1
-
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.cpp
7
1
-
A
solution\0800-0899\0822.Card Flipping Game\Solution.cpp
7
1
-
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.cpp
7
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!