Gleb Koval
dbe344221b
|
||
|---|---|---|
| arranging-coins | ||
| best-time-to-buy-and-sell-stock | ||
| best-time-to-buy-and-sell-stock-ii | ||
| binary-search | ||
| contains-duplicate | ||
| count-vowel-substrings-of-a-string | ||
| first-bad-version | ||
| maximum-path-quality-of-a-graph | ||
| maximum-subarray | ||
| middle-of-the-linked-list | ||
| move-zeroes | ||
| multiply-strings | ||
| number-of-valid-words-for-each-puzzle | ||
| product-of-array-except-self | ||
| remove-nth-node-from-end-of-list | ||
| reverse-string | ||
| reverse-words-in-a-string-iii | ||
| rotate-array | ||
| search-insert-position | ||
| single-number-iii | ||
| squares-of-a-sorted-array | ||
| string-to-integer-atoi | ||
| sum-of-left-leaves | ||
| tenth-line | ||
| transpose-file | ||
| two-sum | ||
| two-sum-ii-input-array-is-sorted | ||
| unique-binary-search-trees | ||
| word-frequency | ||
| README.md | ||
README.md
Gleb's leetcode solutions
These are most of my solutions to various leetcode problems.
They are by no means the best solutions, rather what I could come up with by myself.
In each solution I always aim for the lowest possible time complexity first; however, there may be multiple solutions for some problems to try to minimise space complexity instead.
Naming
Each folder is the name of the problem from its URL, so the problem can be accessed at:
https://leetcode.com/problems/<folder-name>/