Project

General

Profile

Codemonkeys Solutions

Technical documentation
2017-06-01

Autor: Fabian Damken


This document contains (self-made!) solutions for Codemonkeys.

Disclaimer: We do not guarantee that any of the solutions work properly!


Changes

  • Version 7
    • Added solution for "AStern: Break Condition/Variant"
    • Added solution for "AStern: Functionality"
    • Added solution for "Bellman-Ford: Functionality"
    • Added solution for "Dijkstra: Break Condition/Variant"
    • Added solution for "Floyd-Warshall: Break Condition/Variant"
    • Added solution for "Floyd-Warshall: functionality"
    • Added solution for "Graph: Add Subgraph"
    • Added solution for "Graph: Count Nodes"
    • Added solution for "Kruskal: Invariant"
    • Added solution for "Kruskal: Union Find"
    • Added solution for "Prim: Functonality"
    • Added solution for "Prim: Invariant"
    • Added solution for "Array: Selectionsort Iterative"
    • Fixed "String Operations: Prefix Check"
    • Code Cleanup
  • Version 6
    • "Array/Selection-Sort" does not pass all Tests in the current version of Codemonkeys.
    • Added correct solution for "Array/Rotate successive Triples".
    • Error handling of "Array/Shift Elements Left" changed.
      • Previously Codemonkeys expected the function to return null in case of invalid parameters. Now it expects an IllegalArgumentException.
    • Added dummy method call on "Single Linked List/Get".
      • Added invocation of isEmpty() just to make Codemonkeys happy (the solution works without it).
    • Changed method call in "String Operations/Prefix Check".
      • Previously it was okay to invoke String.toLowerCase(). Now StringHelper.toLowerCase(String) has to be invoked.
  • Version 5
    • Added text-only version to easy copying of code.
  • Version 4
    • Added solution for "Binary Search Tree: traverse"
    • Added solution for "Graph: addEdge"
    • Added solution for "Graph: countEdges"
    • Added solution for "Graph: removeEdge"
    • Added solution for "Graph: removeNode"
    • Included small explanation about how Codemonkeys works with multiple methods.
  • Version 3
    • Added solution for "Graph: addNode"
    • Added solution for "Graph: findNode"
    • Enabled syntax highlighting for solution code.
  • Version 2
    • Added solution for "Singly Linked List: merge linked lists"
  • Version 1
    • First release.

Sharing

Files

codemonkeys_v01.pdf (164 KB) codemonkeys_v01.pdf Codemonkeys Solutions - Version 1 Fabian Damken, 2017-06-01 14:13
codemonkeys_v02.pdf (167 KB) codemonkeys_v02.pdf Codemonkeys Solutions - Version 2 Fabian Damken, 2017-06-01 14:14
codemonkeys_v03.pdf (224 KB) codemonkeys_v03.pdf Codemonkeys Solutions - Version 3 Fabian Damken, 2017-06-04 20:49
codemonkeys_v04.pdf (240 KB) codemonkeys_v04.pdf Codemonkeys Solutions - Version 4 Fabian Damken, 2017-06-05 11:46
codemonkeys_v05.pdf (233 KB) codemonkeys_v05.pdf Codemonkeys Solutions - Version 5 Fabian Damken, 2017-06-06 23:47
codemonkeys_v05.txt (23.3 KB) codemonkeys_v05.txt Codemonkeys Solutions - Version 5 (Text only) Fabian Damken, 2017-06-06 23:47
codemonkeys_v06.pdf (233 KB) codemonkeys_v06.pdf Codemonkeys Solutions - Version 6 Fabian Damken, 2017-06-07 23:57
codemonkeys_v06.txt (23.3 KB) codemonkeys_v06.txt Codemonkeys Solutions - Version 6 (Text only) Fabian Damken, 2017-06-07 23:57
codemonkeys_v07.pdf (250 KB) codemonkeys_v07.pdf Codemonkeys Solutions - Version 7 Fabian Damken, 2017-06-29 09:39
codemonkeys_v07.txt (29.7 KB) codemonkeys_v07.txt Codemonkeys Solutions - Version 7 (Text only) Fabian Damken, 2017-06-29 09:40
Go to top