Pinned Repositories
OkCupid_Algorithm_Challenge
The implementation of OKCupid's algoritm with JSON input an output
500pxSearch
Android search app for 500px
android-hiring
aaa Projekt für Bewerber - Team Android
ArcheApplication
Sample application
ArrayAbsurdity
astronChallenge
challenge for Astron
blackswanchallenge
example-mvp
Example Android app with simple MVP architecture
Flickr
An Android demo app for a Flickr client
KfaDemoBeta
My Demo Android App
adamkis's Repositories
adamkis/example-mvp
Example Android app with simple MVP architecture
adamkis/TravelCam
Travel Cam App for Android
adamkis/android-hiring
aaa Projekt für Bewerber - Team Android
adamkis/Sky
adamkis/Pizza
adamkis/Flickr
An Android demo app for a Flickr client
adamkis/MyVocabularyNotebook
adamkis/blackswanchallenge
adamkis/astronChallenge
challenge for Astron
adamkis/ArcheApplication
Sample application
adamkis/MindCandyChallenge
Challenge for MindCandy
adamkis/UbimetChallenge
Challenge for Ubimet
adamkis/500pxSearch
Android search app for 500px
adamkis/randomgen2
list of random numbers with play 1.2.3
adamkis/randomgen
Random generator API with Play
adamkis/my_hello_python
adamkis/OkCupid_Algorithm_Challenge
The implementation of OKCupid's algoritm with JSON input an output
adamkis/ArrayAbsurdity
adamkis/SpiralPrintChallenge
Challenge Description Write a program to print a 2D array (n x m) in spiral order (clockwise) Input Your program should accept as its first argument a path to a filename.The input file contains several lines. Each line is one test case. Each line contains three items (semicolon delimited). The first is 'n'(rows), the second is 'm'(columns) and the third is a single space separated list of characters/numbers in row major order. eg. 3;3;1 2 3 4 5 6 7 8 9 Output Print out the matrix in clockwise fashion, one per line, space delimited. eg. 1 2 3 6 9 8 7 4 5
adamkis/MonkeyGrid
There is a monkey which can walk around on a planar grid. The monkey can move one space at a time left, right, up or down. That is, from (x, y) the monkey can go to (x+1, y), (x-1, y), (x, y+1), and (x, y-1). Points where the sum of the digits of the absolute value of the x coordinate plus the sum of the digits of the absolute value of the y coordinate are lesser than or equal to 19 are accessible to the monkey. For example, the point (59, 79) is inaccessible because 5 + 9 + 7 + 9 = 30, which is greater than 19. Another example: the point (-5, -7) is accessible because abs(-5) + abs(-7) = 5 + 7 = 12, which is less than 19. How many points can the monkey access if it starts at (0, 0), including (0, 0) itself?
adamkis/KfaDemoBeta
My Demo Android App