Description
This contest is designed to sharpen your skills in two of the most essential techniques for solving array and string-based problems efficiently. If you've ever struggled with optimizing brute-force solutions, this is your chance to master these techniques!
TOPICS Fixed-size Sliding Window Dynamic Sliding Window Two Pointers
Start & End Times
| Flexible Start Time |
2025-03-25 16:00
- 2025-04-04 17:00 CEST |
| End time | 2025-04-04 17:00 CEST |
Problems
| Label | Problem |
|---|---|
| A | FizzBuzz |
| B | Pivot |
| C | A Prize No One Can Win |
| D | Martian DNA |
| E | Bus Numbers |
| F | Slide Count |
| G | Find my Family |
| H | Tree Shopping |
Scoring
Partial Credit — Ranked
Explanation:
Standard scoreboard type for problems with partial credit. Participants are ranked by the sum of the score of each problem. There is no tiebreaker.
Standings
- Standings are shown without limitation.
Languages
Ada Algol 68 APL Bash C C# C++ COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Go Haskell Java JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP Prolog Python 2 Python 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig