Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-c--
312
issues
2
pull requests
4,754
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0379.Design Phone Directory\Solution.py
6
1
-
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.cpp
6
1
2
A
solution\2300-2399\2328.Number of Increasing Paths in a Grid\Solution.ts
6
1
-
A
solution\2000-2099\2085.Count Common Words With One Occurrence\Solution.java
6
1
-
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.java
6
1
-
A
solution\0600-0699\0697.Degree of an Array\Solution.py
6
1
-
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.java
6
1
1
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.py
6
1
-
A
solution\0600-0699\0666.Path Sum IV\Solution.java
6
1
-
A
solution\2300-2399\2325.Decode the Message\Solution.c
6
1
-
A
solution\2000-2099\2075.Decode the Slanted Ciphertext\Solution.java
6
1
-
A
solution\0600-0699\0695.Max Area of Island\Solution.ts
6
1
-
A
solution\0600-0699\0692.Top K Frequent Words\Solution.java
6
1
-
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.ts
6
1
-
A
solution\0500-0599\0592.Fraction Addition and Subtraction\Solution.py
6
1
-
A
solution\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.java
6
1
-
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6
1
-
A
solution\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.py
6
1
-
A
solution\2000-2099\2070.Most Beautiful Item for Each Query\Solution.java
6
1
-
A
solution\0600-0699\0697.Degree of an Array\Solution.java
6
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!