johan--/Omega-2013-Codility-Programming-Certificate-Solution-
Public repository.
Public GitHub Catalog
Discovered Sep 28, 2026
johan-- / express
Sinatra inspired web development framework for node.js -- insanely fast, flexible, and simple
About this discovery
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
#11472811GitHub System ID
johan--Organization / User
PublicVisibility
ActiveCatalog Status
More from johan--
johan--/Codility-JS-Q1
I recently took a codility test and decided to make some repos based on the questions as an opportunity show some of my coding abilities in JS/Coffee Script. This solution shows how to get the height of a binary tree and has supporting Jasmine Unit tests.
johan--/Codility-JS-Q3
I recently took a codility test and decided to make some repos based on the questions as an opportunity show some of my coding abilities in JS/CoffeeScript. This solution shows how to programatically create the fibonacci function and has supporting Jasmine Unit tests. F(0) = 0. F(1) = 1. F(N) = F(N−1) + F(N−2) if N ≥ 2. F(0) = 0. F(1) = 1. F(8) = 21. F(36) = 930352.
johan--/Codility-JS-Q2
I recently took a codility test and decided to make some repos based on the questions as an opportunity show some of my coding abilities in JS/CoffeeScript. This solution shows how to programatically create the following function and has supporting Jasmine Unit tests. P(0) = 1. P(N) = (A * P(N−1)) mod B if N > 0. For example, if A = 4 and B = 9 then P(0) = 1, P(1) = 4, P(2) = 7, P(3) = 1, etc.