Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
LeetHubv2
2
issues
0
pull requests
122
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
3912-hexadecimal-and-hexatrigesimal-conversion\3912-hexadecimal-and-hexatrigesimal-conversion.cpp
3
2
-
A
3830-find-closest-person\3830-find-closest-person.cpp
3
1
-
A
3778-transform-array-by-parity\3778-transform-array-by-parity.cpp
2
2
-
A
3636-check-balanced-string\3636-check-balanced-string.cpp
4
1
-
A
3606-minimum-element-after-replacement-with-digit-sum\3606-minimum-element-after-replacement-with-digit-sum.cpp
4
1
-
A
3581-the-two-sneaky-numbers-of-digitville\3581-the-two-sneaky-numbers-of-digitville.cpp
4
4
-
A
3555-final-array-state-after-k-multiplication-operations-i\3555-final-array-state-after-k-multiplication-operations-i.cpp
4
8
-
A
3533-snake-in-matrix\3533-snake-in-matrix.cpp
6
2
-
A
3476-find-minimum-operations-to-make-all-elements-divisible-by-three\3476-find-minimum-operations-to-make-all-elements-divisible-by-three.cpp
3
4
-
A
3471-minimum-average-of-smallest-and-largest-elements\3471-minimum-average-of-smallest-and-largest-elements.cpp
2
6
-
A
3429-special-array-i\3429-special-array-i.cpp
6
1
-
A
3426-minimum-number-of-chairs-in-a-waiting-room\3426-minimum-number-of-chairs-in-a-waiting-room.cpp
5
1
-
A
3412-permutation-difference-between-two-strings\3412-permutation-difference-between-two-strings.cpp
4
5
-
A
3397-find-the-integer-added-to-array-i\3397-find-the-integer-added-to-array-i.cpp
2
1
-
A
3379-score-of-a-string\3379-score-of-a-string.cpp
4
11
-
A
3371-harshad-number\3371-harshad-number.cpp
3
1
-
A
3312-number-of-changing-keys\3312-number-of-changing-keys.cpp
3
1
-
A
3226-minimum-number-game\3226-minimum-number-game.cpp
4
4
-
A
3206-find-common-elements-between-two-arrays\3206-find-common-elements-between-two-arrays.cpp
7
1
-
A
3194-find-words-containing-character\3194-find-words-containing-character.cpp
5
11
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!