anebz
|
44805d8516
|
16.8. maximum subarray problem
O(n) time, O(1) space
|
2019-04-10 20:32:45 +02:00 |
|
anebz
|
8da990843f
|
16.8. int to english
moderate problems chapter
|
2019-04-10 19:07:01 +02:00 |
|
anebz
|
fa7655d5aa
|
folder renaming 3
|
2019-04-10 12:40:32 +02:00 |
|
anebz
|
f8131efa06
|
folder renaming 2
|
2019-04-10 12:37:11 +02:00 |
|
anebz
|
fa5f16901e
|
folder renaming
|
2019-04-10 12:36:12 +02:00 |
|
anebz
|
8b972f304c
|
chapter 1 sorted matrix search
|
2019-04-09 23:51:12 +02:00 |
|
anebz
|
d520f7c64d
|
chapter 1 sorted matrix search v1
|
2019-04-08 22:38:16 +02:00 |
|
anebz
|
f04e89c4f8
|
chapter 1 recursion magic index
|
2019-04-07 21:35:52 +02:00 |
|
anebz
|
5ae0374120
|
Updated READMEs
general readme and chapter 11's algorithm
|
2019-04-07 21:35:26 +02:00 |
|
anebz
|
4458c8e3fd
|
chapter 1 hash table collision
explanation from chapter 11, exercise from chapter 7
|
2019-04-05 23:52:11 +02:00 |
|
anebz
|
dc287b1cef
|
chapter 1 renaming
|
2019-04-05 23:23:06 +02:00 |
|
anebz
|
4a195e9658
|
1.9. string rotation
|
2019-04-05 23:19:07 +02:00 |
|
anebz
|
cd0523bb80
|
hackerrank string exercise
|
2019-04-04 16:41:32 +02:00 |
|
anebz
|
4725533380
|
string exercise minor improvements
|
2019-04-04 14:49:46 +02:00 |
|
anebz
|
4520a81ce3
|
hackerrank string exercise
|
2019-04-03 23:39:41 +02:00 |
|
anebz
|
9794fef144
|
1.8. zero matrix
|
2019-04-03 19:05:41 +02:00 |
|
anebz
|
2e9b3f244f
|
1.7. matrix rotation
I had to look at the hints for this
|
2019-04-01 15:37:59 +02:00 |
|
anebz
|
d667782f5c
|
1.6. character length compression
python and java solutions
|
2019-03-30 23:34:31 +01:00 |
|
anebz
|
3c638942ec
|
1.5. small fix
|
2019-03-30 23:33:55 +01:00 |
|
anebz
|
ec9303b790
|
1.5. levenshtein distance
officially called 'One Away'
|
2019-03-30 14:36:09 +01:00 |
|
anebz
|
1394f09d27
|
Revert "Revert "1.5. levenshtein distance""
This reverts commit 295fb6c179.
|
2019-03-30 14:35:37 +01:00 |
|
anebz
|
295fb6c179
|
Revert "1.5. levenshtein distance"
This reverts commit 285bce837a.
|
2019-03-30 14:34:56 +01:00 |
|
anebz
|
285bce837a
|
1.5. levenshtein distance
officially called 'One Away'
|
2019-03-30 14:34:46 +01:00 |
|
anebz
|
c00f785f39
|
chapter 1 main md renaming
|
2019-03-30 14:28:57 +01:00 |
|
anebz
|
766d118785
|
counter exercise
|
2019-03-29 23:42:31 +01:00 |
|
anebz
|
31b9f177d7
|
chapter 1 github solution links
java, c++ and python
|
2019-03-29 14:24:45 +01:00 |
|
anebz
|
5fd11241b5
|
1.4. palindrome permutation
java, c++ and python solutions. use of bitvector
|
2019-03-29 14:24:19 +01:00 |
|
anebz
|
ff70f806fb
|
1.3. replace character in string
|
2019-03-29 13:06:25 +01:00 |
|
anebz
|
e19eb712f1
|
1.2. check permutation pythonic changes
use of counter and *strings for tuples
|
2019-03-28 19:00:52 +01:00 |
|
anebz
|
78c1fd4eef
|
check permutation v1
my implementation and solution
|
2019-03-28 18:40:30 +01:00 |
|
anebz
|
e306c3ac9e
|
hackerrank exercises link
|
2019-03-28 18:39:30 +01:00 |
|
anebz
|
573db0cb29
|
1.1 is unique
|
2019-03-28 17:28:38 +01:00 |
|
anebz
|
df7b053449
|
chapter1: arrays and strings
notes on hashtable, arraylist and stringbuilder
|
2019-03-27 20:37:55 +01:00 |
|
anebz
|
c140b3ff5b
|
renaming and reordering
(again)
|
2019-03-27 16:45:11 +01:00 |
|
anebz
|
7e7da1ff88
|
intro xyntax fixes
|
2019-03-27 16:33:52 +01:00 |
|
anebz
|
8c92dfb386
|
introduction done
|
2019-03-27 16:27:40 +01:00 |
|
anebz
|
3e046f61a4
|
move into folder
|
2019-03-26 20:04:23 +01:00 |
|
anebz
|
9e3bf7f71e
|
technical questions
optimization techniques
|
2019-03-26 20:03:26 +01:00 |
|
anebz
|
ecaeff1d12
|
updated readme, intro
|
2019-03-26 18:57:10 +01:00 |
|
anebz
|
3bd7aa8312
|
big O exercises
|
2019-03-25 23:46:21 +01:00 |
|
anebz
|
2ed13e736e
|
big O some examples
|
2019-03-23 14:08:10 +01:00 |
|
anebz
|
e039cc3f02
|
big O initial commit
* time complexity
* space complexity
* constants, non-dominant terms
* multi-part algorithms
* amortized time
|
2019-03-23 00:56:32 +01:00 |
|
Ane
|
6d6c8d7fc4
|
Initial commit
|
2019-03-23 00:17:38 +01:00 |