GitHub - harshupadhyay-13/Solutions: Solving programming and DSA questions.

I am solving DSA problems in java and c++.

Name		Name	Last commit message	Last commit date
Latest commit History 87 Commits
0001-two-sum		0001-two-sum
0007-reverse-integer		0007-reverse-integer
0009-palindrome-number		0009-palindrome-number
0013-roman-to-integer		0013-roman-to-integer
0014-longest-common-prefix		0014-longest-common-prefix
0027-remove-element		0027-remove-element
0029-divide-two-integers		0029-divide-two-integers
0042-trapping-rain-water		0042-trapping-rain-water
0058-length-of-last-word		0058-length-of-last-word
0067-add-binary		0067-add-binary
0125-valid-palindrome		0125-valid-palindrome
0136-single-number		0136-single-number
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0189-rotate-array		0189-rotate-array
0217-contains-duplicate		0217-contains-duplicate
0260-single-number-iii		0260-single-number-iii
0268-missing-number		0268-missing-number
0344-reverse-string		0344-reverse-string
0345-reverse-vowels-of-a-string		0345-reverse-vowels-of-a-string
0541-reverse-string-ii		0541-reverse-string-ii
0623-add-one-row-to-tree		0623-add-one-row-to-tree
0633-sum-of-square-numbers		0633-sum-of-square-numbers
0917-reverse-only-letters		0917-reverse-only-letters
1207-unique-number-of-occurrences		1207-unique-number-of-occurrences
1442-count-triplets-that-can-form-two-arrays-of-equal-xor		1442-count-triplets-that-can-form-two-arrays-of-equal-xor
1909-remove-one-element-to-make-the-array-strictly-increasing		1909-remove-one-element-to-make-the-array-strictly-increasing
2810-faulty-keyboard		2810-faulty-keyboard
LICENSE		LICENSE
NumberOfOccurance.java		NumberOfOccurance.java
README.md		README.md

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

About

Languages

License

harshupadhyay-13/Solutions

Folders and files

Latest commit

History

Repository files navigation

About

Topics

Resources

License

Stars

Watchers

Forks

Languages