|
|
bc2ad07dbd
|
arduino/bluetooth
|
2022-11-17 23:20:57 +00:00 |
|
|
|
7fa822fc42
|
negabinary.cpp
|
2021-11-22 11:12:39 +00:00 |
|
|
|
3f447a25ab
|
Merge branch 'master' of github.com:vishap/test
|
2021-11-20 13:23:35 +00:00 |
|
Vahagn Khachatryan
|
29dca37612
|
interview questions facebook/google
|
2021-03-26 19:35:59 +00:00 |
|
Vahagn Khachatryan
|
721e183dc9
|
last changes from bloomberg.
|
2021-03-25 08:17:48 -04:00 |
|
|
|
d84fcbace8
|
interviews/training->training
|
2020-08-19 22:39:03 +01:00 |
|
Vahagn Khachatryan
|
0e4cbb799c
|
Some training puzzles.
|
2020-08-19 22:14:16 +01:00 |
|
Vahagn Khachatryan
|
28d25dff1c
|
distinct_integer_range.cpp
|
2020-03-01 19:18:01 +00:00 |
|
Vahagn Khachatryan
|
1c1a09ac3a
|
find_gaps.cpp
|
2020-03-01 19:18:01 +00:00 |
|
Vahagn Khachatryan
|
1fd2219777
|
subset_min_max_count.cpp
|
2020-03-01 19:18:01 +00:00 |
|
|
|
cdfa46e84c
|
preorder tree construction: much better algorithm. No need to keep root.
|
2019-08-01 20:57:59 +01:00 |
|
|
|
08e93603a9
|
preorder_tree_construction minor changes.
|
2019-08-01 20:56:11 +01:00 |
|
|
|
0d22446c1a
|
MAN AHL interview
|
2019-08-01 13:55:40 +01:00 |
|
Vahagn Khachatryan
|
d32fb7a220
|
Merge branch 'master' of https://bitbucket.org/vishap/test.git
|
2019-03-03 23:19:15 +00:00 |
|
Vahagn Khachatryan
|
cdb9ae83db
|
Humming Distance and Repeated Substring Pattern
|
2019-03-03 23:09:42 +00:00 |
|
|
|
6398bb5e4b
|
longest_chain_equal_K.cpp
|
2018-10-06 13:31:42 +01:00 |
|
Vahagn Khachatryan
|
db8b535047
|
compile_time_power_of_number.cpp
|
2018-06-05 09:53:58 -04:00 |
|
|
|
cc53adcb1f
|
Squarepoint Capital
|
2018-05-31 19:25:29 +01:00 |
|
|
|
6ab678a213
|
simple_wildcard_match.cpp
|
2018-05-15 23:02:22 +01:00 |
|
|
|
512299de0a
|
binary_tree_max_path.cpp
|
2018-05-13 23:29:06 +01:00 |
|
|
|
37466fecdc
|
unique_prefix.cpp
|
2018-05-13 23:27:51 +01:00 |
|
|
|
efd5d9ead2
|
stepping_number.cpp
|
2018-05-07 15:31:14 +01:00 |
|
|
|
7252e23f01
|
diagonal.cpp
|
2018-05-07 12:11:59 +01:00 |
|
|
|
dca27aadb4
|
power_ap.cpp
|
2018-05-07 10:44:53 +01:00 |
|
|
|
2385aec24a
|
Two solutions for Goldbach's conjecture and their complexity.
|
2018-04-29 09:27:03 +01:00 |
|
Vahagn Khachatryan
|
4d5dbca240
|
number_of_islands.cpp
|
2018-04-24 10:44:42 -04:00 |
|
|
|
2f9acbc4c8
|
preorder_tree_construction.cpp building with vc
|
2018-04-22 23:28:45 +01:00 |
|
|
|
97ae17f1cc
|
goldbachs_conjecture.cpp
|
2018-04-22 23:27:00 +01:00 |
|
|
|
940bb2653d
|
preorder tree construction
|
2018-02-03 23:47:07 +00:00 |
|
|
|
4ef81a080d
|
puzzle: Number of valid combinations of strings for given input.
|
2017-05-29 08:06:31 +01:00 |
|
|
|
8435003362
|
Print indices of max element of the array randomly+evenly.
|
2017-05-28 23:57:44 +01:00 |
|
|
|
eca7108922
|
interview training: permutations
|
2017-05-28 23:03:54 +01:00 |
|
|
|
0f638a71f4
|
Interviews are considered puzzles.
|
2015-02-14 12:45:32 +04:00 |
|
