Description
These are exercises about classical textbook algorithm problems. Some of these are prerequisites for the present course, other are the canonical version of a fundamental algorithms presented in the course. All are extremely useful for engaging with core course material and a good use of your time. Enjoy!
Start & End Times
Start Time | 2023-10-06 08:00 CEST |
End time | 2023-10-13 08:00 CEST |
Problems
Scoring
Pass/Fail — Unranked
Explanation:
Each problem is pass/fail. Participants are not ranked
Results
- Results are shown without limitation.
Languages
Ada Algol 68 APL Bash C C# C++ COBOL Common Lisp Crystal C with GMP C++ with GMP C with Memory Check C++ with Memory Check D Dart Elixir Erlang F# Forth Fortran Go Haskell Java JavaScript (Node.js) JavaScript (SpiderMonkey) Java with Algs4 Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP Prolog Python 2 Python 3 Python 3 with NumPy Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig