cyclane/leet-code
cyclane
/
leet-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
My answers for leetcode questions
56 Commits 1 Branch 0 Tags 280 KiB
Rust 50.4%
Go 45.7%
Python 1.8%
Dockerfile 0.8%
Shell 0.6%
Other 0.7%
Go to file
Gleb Koval 14b51882bb
catch-up 		2022-06-09 15:45:14 +01:00
.devcontainer A few problems 2022-05-29 20:21:38 +01:00
arranging-coins arranging-coins 2021-11-05 15:40:01 +00:00
best-time-to-buy-and-sell-stock some more problems 2022-05-30 23:03:12 +01:00
best-time-to-buy-and-sell-stock-ii best-time-to-buy-and-sell-stock-ii 2021-11-10 14:44:37 +00:00
binary-search binary-search 2021-11-05 14:54:48 +00:00
binary-tree-inorder-traversal catch-up 2022-06-09 15:45:14 +01:00
binary-tree-level-order-traversal catch-up 2022-06-09 15:45:14 +01:00
binary-tree-postorder-traversal catch-up 2022-06-09 15:45:14 +01:00
binary-tree-preorder-traversal catch-up 2022-06-09 15:45:14 +01:00
check-if-a-string-contains-all-binary-codes-of-size-k check-if-a-string-contains-all-binary-codes-of-size-k 2022-05-31 20:04:54 +01:00
contains-duplicate contains duplicate in 3 more languages for some reason 2022-05-29 21:00:01 +01:00
count-vowel-substrings-of-a-string count-vowel-substrings-of-a-string 2021-11-09 16:40:44 +00:00
daily-temperatures A few problems 2022-05-29 20:21:38 +01:00
divide-two-integers some more problems 2022-05-30 23:03:12 +01:00
first-bad-version first-bad-version 2021-11-05 15:09:36 +00:00
first-missing-positive A few problems 2022-05-29 20:21:38 +01:00
first-unique-character-in-a-string first-unique-character-in-a-string 2022-06-02 23:43:47 +01:00
implement-queue-using-stacks catch-up 2022-06-09 15:45:14 +01:00
insert-into-a-binary-search-tree catch-up 2022-06-09 15:45:14 +01:00
intersection-of-two-arrays-ii some more problems 2022-05-30 23:03:12 +01:00
intersection-of-two-linked-lists intersection-of-two-linked-lists 2022-06-06 19:51:38 +01:00
invert-binary-tree catch-up 2022-06-09 15:45:14 +01:00
linked-list-cycle some more problems solved 2022-06-04 12:25:07 +01:00
longest-valid-parentheses A few problems 2022-05-29 20:21:38 +01:00
maximum-depth-of-binary-tree catch-up 2022-06-09 15:45:14 +01:00
maximum-path-quality-of-a-graph maximum-path-quality-of-a-graph 2021-11-10 14:32:05 +00:00
maximum-product-of-word-lengths A few problems 2022-05-29 20:21:38 +01:00
maximum-subarray A few problems 2022-05-29 20:21:38 +01:00
merge-sorted-array A few problems 2022-05-29 20:21:38 +01:00
merge-two-sorted-lists some more problems solved 2022-06-04 12:25:07 +01:00
middle-of-the-linked-list middle-of-the-linked-list 2021-11-09 15:56:54 +00:00
minimum-value-to-get-positive-step-by-step-sum minimum-value-to-get-positive-step-by-step-sum 2021-11-12 09:53:39 +00:00
missing-number A few problems 2022-05-29 20:21:38 +01:00
move-zeroes move-zeroes 2021-11-07 20:12:20 +00:00
multiply-strings removed main() from multiply-strings 2021-11-07 21:12:30 +00:00
n-queens n-queens 2022-06-04 23:47:01 +01:00
n-queens-ii n-queens-ii 2022-06-06 19:51:29 +01:00
number-of-1-bits A few problems 2022-05-29 20:21:38 +01:00
number-of-valid-words-for-each-puzzle number-of-valid-words-for-each-puzzle 2021-11-09 02:07:53 +00:00
pascals-triangle pascals-triangle 2022-05-31 23:24:52 +01:00
path-sum catch-up 2022-06-09 15:45:14 +01:00
product-of-array-except-self product-of-array-except-self 2021-11-05 12:53:13 +00:00
range-sum-query-2d-immutable some more problems solved 2022-06-04 12:25:07 +01:00
ransom-note ransom-note 2022-06-02 23:43:57 +01:00
remove-duplicates-from-sorted-list remove-duplicates-from-sorted-list 2022-06-04 23:46:52 +01:00
remove-linked-list-elements some more problems solved 2022-06-04 12:25:07 +01:00
remove-nth-node-from-end-of-list remove-nth-node-from-end-of-list 2021-11-09 16:10:49 +00:00
remove-palindromic-subsequences catch-up 2022-06-09 15:45:14 +01:00
reshape-the-matrix reshape-the-matrix 2022-05-31 22:54:52 +01:00
reverse-linked-list reverse-linked-list 2022-06-04 23:46:41 +01:00
reverse-string reverse-string 2021-11-08 13:00:57 +00:00
reverse-words-in-a-string-iii reverse-words-in-a-string-iii 2021-11-08 19:34:36 +00:00
rotate-array rotate-array 2021-11-07 20:06:26 +00:00
rotate-image A few problems 2022-05-29 20:21:38 +01:00
running-sum-of-1d-array running-sum-of-1d-array 2022-06-01 14:04:19 +01:00
search-a-2d-matrix search-a-2d-matrix 2022-06-02 23:44:07 +01:00
search-in-a-binary-search-tree catch-up 2022-06-09 15:45:14 +01:00
search-insert-position search-insert-position 2021-11-05 15:18:31 +00:00
single-number-iii single-number-iii 2021-11-10 15:12:32 +00:00
squares-of-a-sorted-array squares-of-a-sorted-array 2021-11-07 19:45:34 +00:00
string-to-integer-atoi string-to-integer-atoi 2021-11-09 11:42:53 +00:00
sum-of-left-leaves sum-of-left-leaves 2021-11-05 16:02:35 +00:00
symmetric-tree catch-up 2022-06-09 15:45:14 +01:00
tenth-line A few problems 2022-05-29 20:21:38 +01:00
transpose-file A few problems 2022-05-29 20:21:38 +01:00
transpose-matrix transpose-matrix 2022-06-02 23:44:15 +01:00
two-sum A few problems 2022-05-29 20:21:38 +01:00
two-sum-ii-input-array-is-sorted catch-up 2022-06-09 15:45:14 +01:00
unique-binary-search-trees unique-binary-search-trees 2021-11-08 12:56:51 +00:00
valid-anagram valid-anagram 2022-06-02 23:45:04 +01:00
valid-parentheses valid-parentheses 2022-06-06 19:51:18 +01:00
valid-sudoku some more problems solved 2022-06-04 12:25:07 +01:00
word-frequency A few problems 2022-05-29 20:21:38 +01:00
.gitignore A few problems 2022-05-29 20:21:38 +01:00
README.md multi solution README modification 2022-05-31 22:46:06 +01:00

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>/

All solutions for the various languages are named sol.<ext>, although generally I don't vary all that much.

If I have written multiple solutions in a language, they will be named sol_<description>.<ext>.