|
|
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 |
|
|
|
44344d9428
|
Merge branch 'master' of bitbucket.org:vishap/test
|
2018-04-22 23:27:22 +01:00 |
|
|
|
97ae17f1cc
|
goldbachs_conjecture.cpp
|
2018-04-22 23:27:00 +01:00 |
|
Vahagn Khachatryan
|
fc45279728
|
Probability Theory Problem 2.11
|
2018-02-22 18:05:11 +00: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 |
|
|
|
951f9f63c7
|
Google Code Jam 2017
|
2017-05-16 22:18:46 +01:00 |
|
|
|
cb73a91c91
|
Google Code Jam 2015, round 0.
|
2015-04-12 10:01:31 +04:00 |
|
|
|
dd4edc9bf5
|
Some old changes on Project Euler #009 that I belive needs to be submitted.
|
2015-03-01 23:07:26 +04:00 |
|
|
|
0f638a71f4
|
Interviews are considered puzzles.
|
2015-02-14 12:45:32 +04:00 |
|
|
|
7a53e5a3a1
|
Move Google Code Jam under puzzles.
|
2015-02-08 23:12:41 +04:00 |
|
|
|
e2841a251e
|
Move Project Euler under puzzles.
|
2015-02-08 23:11:37 +04:00 |
|
|
|
f24d1e5a07
|
roman_numerals from bluefruit competition. http://www.bluefruit.co.uk/careers/win/
|
2015-01-13 08:53:25 +04:00 |
|
