https://github.com/sreejeet/leetcode

My leetcode solutions. No PRs unless for improvement/corrections.
https://github.com/sreejeet/leetcode

algorithms competitive-programming data-structures exercises leetcode leetcode-solutions solutions

Last synced: 2 months ago
JSON representation

My leetcode solutions. No PRs unless for improvement/corrections.

• Host: GitHub
• URL: https://github.com/sreejeet/leetcode
• Owner: sreejeet
• Created: 2020-04-18T09:19:11.000Z (almost 6 years ago)
• Default Branch: master
• Last Pushed: 2020-09-16T19:54:44.000Z (over 5 years ago)
• Last Synced: 2024-06-19T05:18:19.547Z (almost 2 years ago)
• Topics: algorithms, competitive-programming, data-structures, exercises, leetcode, leetcode-solutions, solutions
• Language: Go
• Homepage: https://leetcode.com/sreejeet
• Size: 102 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
## LeetCode solutions

It's not much, but it's honest work.

├── algorithms


│   ├── largest-time-for-given-digits.py


│   ├── sliding-window-maximum.py


│   ├── minimum-depth-of-binary-tree.py


│   ├── binary-tree-level-order-traversal.py


│   ├── minimum-distance-between-bst-nodes.py


│   ├── binary-tree-inorder-traversal.py


│   ├── letter-combinations-of-a-phone-number.py


│   ├── 3sum-closest.py


│   ├── 3sum.py


│   ├── insert-into-a-binary-search-tree.py


│   ├── move-zeroes.go


│   ├── palindrome-linked-list.go


│   ├── invert-binary-tree.go


│   ├── sort-colors.go


│   ├── remove-nth-node-from-end-of-list.go


│   ├── reverse-linked-list.go


│   ├── house-robber.py


│   ├── house-robber.go


│   ├── average-of-levels-in-binary-tree.go


│   ├── binary-tree-level-order-traversal.go


│   ├── majority-element.go


│   ├── intersection-of-two-linked-lists.go


│   ├── binary-prefix-divisible-by-5.go


│   ├── median-of-two-sorted-arrays.go


│   ├── min-stack.go


│   ├── linked-list-cycle.go


│   ├── single-number.go


│   ├── best-time-to-buy-and-sell-stock.go


│   ├── fibonacci-number.go


│   ├── longest-substring-without-repeating-characters.go


│   ├── binary-tree-level-order-traversal-ii.go


│   ├── climbing-stairs.go


│   ├── maximum-depth-of-binary-tree.go


│   ├── symmetric-tree.go


│   ├── same-tree.go


│   ├── merge-sorted-array.go


│   ├── remove-duplicates-from-sorted-list-ii.go


│   ├── remove-duplicates-from-sorted-list.go


│   ├── add-two-numbers.go


│   ├── valid-perfect-square.go


│   ├── sqrtx.go


│   ├── add-binary.go


│   ├── valid-parentheses.go


│   ├── two-sum.go


│   ├── search-insert-position.go


│   ├── roman-to-integer.go


│   ├── reverse-integer.go


│   ├── remove-element.go


│   ├── remove-duplicates-from-sorted-array.go


│   ├── reformat-the-string.go


│   ├── plus-one.go


│   ├── palindrome-number.go


│   ├── merge-two-sorted-lists.go


│   ├── maximum-subarray.go


│   ├── longest-common-prefix.go


│   ├── length-of-last-word.go


│   ├── implement-strstr.go


│   └── count-and-say.go


├── database


│   ├── classes-more-than-5-students.sql


│   ├── big-countries.sql


│   ├── rising-temperature.sql


│   ├── customers-who-never-order.sql


│   ├── duplicate-emails.sql


│   ├── nth-highest-salary.sql


│   ├── delete-duplicate-emails.sql


│   ├── employees-earning-more-than-their-managers.sql


│   ├── second-highest-salary.sql


│   └── combine-two-tables.sql


├── shell


│   ├── valid-phone-numbers.sh


│   └── tenth-line.sh


├── concurrency


│   ├── print-foobar-alternately.py


│   └── print-in-order.py


└── README.md