Monday, March 23, 2015

Algorithms Books and Online Judges Tandems

Here are some of them:

1. UVa Online Judge + Skiena/Revilla, Halim





2. ACM-ICPC Live Archive + Revilla/Poucher





3. Rosalind Algorithmic Heights + Dasgupta/Papadimitriou





4. Rosalind Bioinformatics + Compeau/Pevzner





5. Programming Challenges + Skiena/Revilla





6. Codility + Codility

They do have their own learning materials.

Thursday, March 19, 2015

Academic Online Judges

1. UVa Online Judge
2. URI Online Judge 
3. Sphere Online Judge (SPOJ)
4. Aizu Online Judge
5. Timus Online Judge 
6. PKU JudgeOnline
7. Zhejiang University Online Judge
8. El Judge
9. Tsinghua Online Judge
10. Caribbean Online Judge
11. Don Mills Online Judge
12. National Tsing Hua University Online Judge
13.Tianjin University Online Judge
14. Programming Club IIT Kanpur
15. Saratov State University Online Contester
16. PEG Judge
17. IARCS Problems Archive
18. RACSO Online Judge
19. Baekjoon Online Judge
20. GEPWNAGE Online Judge
21. Shanghai Jiao Tong University Online Judge
22. JollyBee Online Judge - BINUS University
23. Herbert Online Judge
24. LightOJ
25. FAU Online Judge
26. National Taiwan University Online Judge
27. ZeroJudge
28. UESTC Online Judge
29. Programming Challenges
30. ZeroJudge.tw
31. Teddy Online Judge
32. Sicily Online Judge
33. Kattis
34. Assumption University Online Judge
35. RealOJ
36. Sichuan University Online Judge
37. Jobdu Online Judge
38. Wuhan Online Judge
39. ShareCode
40. NUC Online Judge
41. HIT Online Judge
42. TNFSH Online Judge
43. TIOJ INFOR Online Judge
44. JKKNIU
45. ACDream
46. HDU Online Judge
47. ICPC Live Archive
48. HUST OJ
49. Fuzhou University Online Judge
50. Lydsy
51. Central South University Online Judge
52. Lviv National University Online Judge
53. Colombian Collegiate Programming League



Wednesday, March 18, 2015

Codingame Puzzles



Single Player: 51

Tutorial
1. Onboarding -> finding a minimal value

Easy
1. Power of Thor -> condition statements (if...).
2. The Descent -> search in an array
3. Skynet: the Chasm -> conditional statements (if...)
4. Mars Lander - Level 1 -> Speed regulation.
5. Temperatures -> search in an array.
6. ASCII Art -> proper storage and retrieval in an array.
7. Chuck Norris -> encoding/decoding.
8. MIME Type -> maps, string parsing.
9. Defibrillators -> Distance calculation, Big data.
10. Horse-racing Duals -> sorting, finding a minimum.


Medium
1. Skynet: the Virus -> search in a graph.
2. Heat Detector -> Convergence.
3. Teads Sponsored Challenge -> Graph theory
4. Winamax Sponsored Challenge -> String manipulation
5. Mars Lander - Level 2 -> Position, speed and angle regulation.
6. The Paranoid Android -> greedy algorithm.
7. Indiana - Level 1 -> maps.
8. Stock Exchange Losses -> Search through a set of values. Dynamic Programming
9. Network Cabling -> Optimal distance.
10. Conway Sequence -> Conway sequence.
11. Telephone Numbers -> storage optimization. Tries
12. Dwarfs standing on the shoulder of giants -> Tree traversal.
13. Bender, a depressed robot -> Trajectory Calculation.
14. Scrabble -> Weighting.
15. The Gift -> Distribution.
16. Mayan Calculation -> Algebraic calculations.
17. APU - Init Phase -> Searching in a list


Hard
1. The Labyrinth -> Pathfinding, optimization.
2. Skynet strikes back -> Tree search and traversal.
3. The Paranoid Android - One step further -> pathfinding and optimisation.
4. Skynet: The Bridge -> Depth-first search or Backtracking
5. Indiana - Level 2 -> Pathfinding.
6. Vox Codei -> Brute-force.
7. Thor VS Giants -> Centroid computation.
8. Super Computer -> Scheduling.
9. Roller Coaster -> Calculation.
10. CGX Formatter -> Text formatting.
11. TAN Network -> Pathfinding in a graph.
12. Genome Sequencing -> Pattern recognition. Permutations
13. Surface -> Grid flooding.
14. Bender - The Money Machine -> Weighted Pathfinding
15. Bender - Algorithmic Complexity -> Complexity calculation.
16. APU - Improvement Phase -> Backtracking, Pruning, Brute-forcing

Very Hard
1. Nintendo Sponsored Challenge -> C++
2. Triangulation -> Triangulation.
3. The Resistance -> Decyphering.
4. Indiana - Level 3 -> Pathfinding in a grid.
5. Vox Codei - Redux -> brute-force, exploration.
6. Music Scores -> Image (as bit array) processing.
7. Mars Lander - Level 3 -> Position, speed and angle regulation.

Multiplayer
1. Tron Battle
2. Game of Drones
3. Poker Chip Race
4. Poker Chip Race
5. Platinum Rift
6. Platinum Rift 2
7. The Great Escape

Monday, January 19, 2015

Steve Yegge - Get that job at Google - Short Summary



Data Structures and Algorithms

- Algorithm Complexity/Big-O
- Sorting: Mergesort/Quicksort
- Hashtables
- Trees: binary trees, n-ary trees, tries, Red-Black/AVL/splay tree
- Traversal: BFS, DFS, inorder, preorder, postorder
- Graphs: objects-pointers/adjacency-list/matrix representation, traversal
- Dijkstra, A*
- NP-completeness, traveling salesman, knapsack




Others

- Discrete Math
- OS: processes, threads, concurrency, locks, mutexes, semaphores, monitors, deadlock, livelock, context switching, scheduling
- bring your own dry-erase marker