Skip to content

Rakee/Leetcode

BranchesTags
 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

298 Commits
4-sum-ii.java
4-sum-ii.java
 
 
README.md
README.md
 
 
Roman-to-integer.java
Roman-to-integer.java
 
 
add-and-search-word-data-structure-design.java
add-and-search-word-data-structure-design.java
 
 
add-two-numbers.java
add-two-numbers.java
 
 
array-nesting.java
array-nesting.java
 
 
battleships-in-a-board.java
battleships-in-a-board.java
 
 
best-time-to-buy-and-sell-stocks-ii.java
best-time-to-buy-and-sell-stocks-ii.java
 
 
binary-numbers-with-alternating-bits.cpp
binary-numbers-with-alternating-bits.cpp
 
 
binary-tree-maximum-path-sum.java
binary-tree-maximum-path-sum.java
 
 
binary-tree-paths.java
binary-tree-paths.java
 
 
boundary-of-binary-tree.java
boundary-of-binary-tree.java
 
 
brick-wall.java
brick-wall.java
 
 
bulls-and-cows.java
bulls-and-cows.java
 
 
burst-balloons.
burst-balloons.
 
 
can-I-win.java
can-I-win.java
 
 
closest-binary-search-tree-value.java
closest-binary-search-tree-value.java
 
 
combination-sum.cpp
combination-sum.cpp
 
 
complex-number-multiplication.java
complex-number-multiplication.java
 
 
concatenated-words.java
concatenated-words.java
 
 
construct-binary-tree-from-inorder-and-postorder-traversal.java
construct-binary-tree-from-inorder-and-postorder-traversal.java
 
 
construct-the-rectangle.java
construct-the-rectangle.java
 
 
contains-duplicate-ii.java
contains-duplicate-ii.java
 
 
contains-duplicate.java
contains-duplicate.java
 
 
continuous-subarray-sum.java
continuous-subarray-sum.java
 
 
convert-BST-to-greater-tree.java
convert-BST-to-greater-tree.java
 
 
copy-node-with-random-pointers.java
copy-node-with-random-pointers.java
 
 
count-of-smaller-numbers-after-self.java
count-of-smaller-numbers-after-self.java
 
 
count-the-repetitions.java
count-the-repetitions.java
 
 
count-univalue-subtrees.java
count-univalue-subtrees.java
 
 
counting-bits.java
counting-bits.java
 
 
course-schedule.java
course-schedule.java
 
 
decode-string.java
decode-string.java
 
 
delete-and-earn.java
delete-and-earn.java
 
 
delete-node-in-a-BST.java
delete-node-in-a-BST.java
 
 
delete-node.java
delete-node.java
 
 
design-a-vending-machine.java
design-a-vending-machine.java
 
 
design-twitter.java
design-twitter.java
 
 
diagonal-traverse.java
diagonal-traverse.java
 
 
distribute-candies.java
distribute-candies.java
 
 
employee-importance.java
employee-importance.java
 
 
encode-and-decode-tinyurl.java
encode-and-decode-tinyurl.java
 
 
encode-string-with-shortest-length.java
encode-string-with-shortest-length.java
 
 
evaluate-division.java
evaluate-division.java
 
 
falling-squares.cpp
falling-squares.cpp
 
 
find-all-duplicates-in-an-array.java
find-all-duplicates-in-an-array.java
 
 
find-all-numbers-disappeared-in-an-array.java
find-all-numbers-disappeared-in-an-array.java
 
 
find-bottom-left-tree-value.java
find-bottom-left-tree-value.java
 
 
find-largest-smaller-key.java
find-largest-smaller-key.java
 
 
find-largest-value-in-each-tree-row.java
find-largest-value-in-each-tree-row.java
 
 
find-leaves-of-binary-tree.java
find-leaves-of-binary-tree.java
 
 
find-median-from-data-stream.java
find-median-from-data-stream.java
 
 
find-minimum-in-rotated-sorted-array.java
find-minimum-in-rotated-sorted-array.java
 
 
find-peak-element.java
find-peak-element.java
 
 
find-the-duplicate-number.java
find-the-duplicate-number.java
 
 
flatten-binary-tree-to-linked-list.java
flatten-binary-tree-to-linked-list.java
 
 
flip-game.java
flip-game.java
 
 
freedom-trail.java
freedom-trail.java
 
 
friend-circles.java
friend-circles.java
 
 
game-of-life.java
game-of-life.java
 
 
generate-parantheses.cpp
generate-parantheses.cpp
 
 
generating-parenthesis.java
generating-parenthesis.java
 
 
hamming-distance.java
hamming-distance.java
 
 
heaters.java
heaters.java
 
 
house-robber.java
house-robber.java
 
 
increasing-subsequences.java
increasing-subsequences.java
 
 
interleaving-strings.java
interleaving-strings.java
 
 
intersection-of-two-arrays-ii.java
intersection-of-two-arrays-ii.java
 
 
island-perimeter.java
island-perimeter.java
 
 
jump-game.cpp
jump-game.cpp
 
 
jump_game.java
jump_game.java
 
 
k-diff-pairs-in-an-array.java
k-diff-pairs-in-an-array.java
 
 
k-smallest-element-in-BST.java
k-smallest-element-in-BST.java
 
 
kill-process.java
kill-process.java
 
 
kth-smallest-element-in-a-bst.java
kth-smallest-element-in-a-bst.java
 
 
largest-number.java
largest-number.java
 
 
letter-combination-of-a-phone-number.cpp
letter-combination-of-a-phone-number.cpp
 
 
linked-list-cycle-ii.java
linked-list-cycle-ii.java
 
 
longest-consecutive-sequence.java
longest-consecutive-sequence.java
 
 
longest-palindromic-subsequence.java
longest-palindromic-subsequence.java
 
 
longest-substring-without-repeating-character.java
longest-substring-without-repeating-character.java
 
 
lowest-common-ancestor-of-a-binary-tree.java
lowest-common-ancestor-of-a-binary-tree.java
 
 
lowest-common-ancestor-of-binary-search-tree.java
lowest-common-ancestor-of-binary-search-tree.java
 
 
lowest-common-ancestor.java
lowest-common-ancestor.java
 
 
matchsticks-to-square.java
matchsticks-to-square.java
 
 
max-chunks-to-sort.java
max-chunks-to-sort.java
 
 
max-consecutive-ones-ii.java
max-consecutive-ones-ii.java
 
 
max-consecutive-ones.java
max-consecutive-ones.java
 
 
max-sub-array.java
max-sub-array.java
 
 
maximum-depth-of-binary-tree.java
maximum-depth-of-binary-tree.java
 
 
maximum-subarray.java
maximum-subarray.java
 
 
maximum-vacation-days.java
maximum-vacation-days.java
 
 
merge-intervals.java
merge-intervals.java
 
 
merge-k-sorted-lists.java
merge-k-sorted-lists.java
 
 
merge-sorted-array.cpp
merge-sorted-array.cpp
 
 
merge-two-sorted-lists.java
merge-two-sorted-lists.java
 
 
min-cost-climbing-stairs.cpp
min-cost-climbing-stairs.cpp
 
 
mini-parser.java
mini-parser.java
 
 
most-common-word.java
most-common-word.java
 
 
move-zeros.java
move-zeros.java
 
 

Repository files navigation

Leetcode

Problems on Leetcode

I made this repo after a failed technical interview with an easy programming question (Game of life). It reminded me of another technical interview with an easy question that I failed. I realized simply taking a class in Algorithms and Data Structures wasn't enough, and that I needed to practice more questions. A few weeks before Chrismast 2016, I set out a goal of doing one problem on Leetcode a day.

I've switched to a more structured way of learning algorithms (with topics and problems on the topic to familiarize myself using Competitive Programming by Steven and Felix Halim). I will still do problems on Leetcode once in a while.

Structure

This repo has a flat structure with no sub directories. For the problems, I tried solving them first, then if stuck I would look at the solution, then I tried to reimplement them.

Lessons learned

The journey in the past 8-9 months has been fun. It taught me discipline. I realized that if I want to be good at something I need to constantly practice it. Sitting down to my laptop everyday and tried to read and understand the problems and created a commit has shaped a habit in my mind. I'm no longer afraid of doing a technical programming question (I still suck at that, though). An author on Quora has said habitual everyday tasks are boring, but they bring me greater rewards in the future. At least, at the end of the day, when I reflect on what I've done today, I'm glad I did something to better myself

I also welcome contributions.

About

Problems solved on Leetcode

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages

  • Java 94.6%
  • C++ 5.4%