Merge branch 'main' of https://github.com/pano9000/entwicklerheld

pano9000 · May 9, 2024 · 36fef46 · 36fef46
2 parents 35fdaf9 + dfb83ad
commit 36fef46
Show file tree

Hide file tree

Showing 69 changed files with 159 additions and 159 deletions.
diff --git a/README.md b/README.md
diff --git a/advent-bakery/README.md b/advent-bakery/README.md
@@ -6,7 +6,7 @@ My solution for the ['Advent Bakery' Challenge](https://platform.entwicklerheld.
 Goal was to return a list of all different (unique) possibilites on how a given amount of cookies can be placed on a given amount of plates.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | ████░░░░░░ 40% | 116 / 289 | 2022-06-16 | JavaScript

diff --git a/airport-runway-direction/README.md b/airport-runway-direction/README.md
@@ -6,9 +6,9 @@ My solution for the ['Airport Runway Direction' Challenge](https://platform.entw
 Calculate which runway is closest to the path of an incoming airplane
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▮▯▯ | ███░░░░░░░ 33% | 540 / 1650 | 2024-03-17 | Python
+▮▮▯▯ | ███░░░░░░░ 33% | 540 / 1651 | 2024-03-17 | Python
 
 ## Comment
diff --git a/anagram/README.md b/anagram/README.md
@@ -6,7 +6,7 @@ My solution for the ['Anagram' Challenge](https://platform.entwicklerheld.de/cha
 Goal is to create a function that checks, if two given words are anagrams, i.e. if they consist of the identical letter set, but are differently arranged (e.g. `car` and `arc`)
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | ████████░░ 84% | 1059 / 1263 | 2022-04-24 | JavaScript

diff --git a/ancient-encryption/README.md b/ancient-encryption/README.md
@@ -6,7 +6,7 @@ My solution for the ['Ancient Encryption' Challenge](https://platform.entwickler
 Implement a class the can encode and decode Vigenère cipher
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | ███████░░░ 74% | 409 / 555 | 2024-03-28 | Python

diff --git a/binary-search-js/README.md b/binary-search-js/README.md
@@ -6,10 +6,10 @@ My solution for the ['Binary Search' Challenge](https://platform.entwicklerheld.
 Challenge consisted of writing a binary search function that also keeps track of how many 'steps' (or 'iterations') it took to get to the result.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ██████░░░░ 59% | 105 / 178 | 2024-02-29 | JavaScript
+▮▯▯▯ | ██████░░░░ 59% | 109 / 184 | 2024-02-29 | JavaScript
 
 ## Comment
 I opted to go with an iterative solution, that works 'in place' and without copying any array data, but instead works with index ranges for the 'divide and conquer' part :-)
diff --git a/binary-tree/README.md b/binary-tree/README.md
@@ -12,7 +12,7 @@ Challenge consisted of working with binary trees and three scenarios:
 3) Reverse/Mirror a given binary tree
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | ███████░░░ 65% | 607 / 934 | 2023-07-28 | JavaScript

diff --git a/bowling/README.md b/bowling/README.md
@@ -6,7 +6,7 @@ My solution for the ['Bowling' Challenge](https://platform.entwicklerheld.de/cha
 Challenge consisted basically of creating a Bowling Score Counter, that keeps track of the knocked off pins and returns a total score at the end.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | █████░░░░░ 54% | 133 / 246 | 2023-09-15 | JavaScript

diff --git a/bricks-and-water/README.md b/bricks-and-water/README.md
@@ -6,7 +6,7 @@ My solution for the ['Bricks and Water' Challenge](https://platform.entwicklerhe
 
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | ████░░░░░░ 44% | 727 / 1665 | 2022-05-01 | JavaScript

diff --git a/build-a-clock/README.md b/build-a-clock/README.md
@@ -6,9 +6,9 @@ My solution for the ['Build a Clock' Challenge](https://platform.entwicklerheld.
 In this challenge you will built a simple clock. Your clock can show the time, add and subtract minutes and it can decide if it is equal to another one.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ███████░░░ 66% | 328 / 495 | 2023-05-07 | JavaScript
+▮▯▯▯ | ███████░░░ 66% | 329 / 496 | 2023-05-07 | JavaScript
 
 ## Comment
diff --git a/candidates/README.md b/candidates/README.md
@@ -6,9 +6,9 @@ My solution for the ['Candidates' Challenge](https://platform.entwicklerheld.de/
 Efficiently pair list of job offers with a list of possible candidates and select the best matching candidates.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▮▯▯ | ███░░░░░░░ 31% | 23 / 74 | 2024-04-15 | JavaScript
+▮▮▯▯ | ███░░░░░░░ 30% | 25 / 82 | 2024-04-15 | JavaScript
 
 ## Comment
diff --git a/change-calculator/README.md b/change-calculator/README.md
@@ -6,7 +6,7 @@ My solution for the ['Change Calculator' Challenge](https://platform.entwicklerh
 Goal was to calculate the minimum number of coins required to give out a certain amount of change.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | ████░░░░░░ 36% | 128 / 353 | 2023-07-11 | Java

diff --git a/cinema-seat-reservation/README.md b/cinema-seat-reservation/README.md
@@ -6,7 +6,7 @@ My solution for the ['Cinema Seat Reservation' Challenge](https://platform.entwi
 
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▮▮ | █░░░░░░░░░ 12% | 57 / 462 | 2022-10-08 | JavaScript

diff --git a/circuit-breaker/README.md b/circuit-breaker/README.md
@@ -6,10 +6,10 @@ My solution for the ['Circuit Breaker' Challenge](https://platform.entwicklerhel
 Implement a circuit breaker pattern, that prevents function executions, via timeouts, if previous attempts failed
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▮▯▯ | ████░░░░░░ 44% | 70 / 160 | 2024-04-05 | JavaScript
+▮▮▯▯ | ████░░░░░░ 43% | 70 / 161 | 2024-04-05 | JavaScript
 
 ## Comment
 Initially attempted to solve this by using some timers that self-reset, whenever the timeouts are over. It would've worked, and that solution would've been a bit more elegant, but unfortunately the way the EH tests were constructed, this was not possible: The tests do not *actually* wait x seconds before re-trying to call the function in the circuit-breaker, *but* they are 'faking' the passed time, by passing modified currentDates as parameter. :-(
diff --git a/client-number-validation/README.md b/client-number-validation/README.md
@@ -6,9 +6,9 @@ My solution for the ['Client number validation' Challenge](https://platform.entw
 Write a function that validates a 10 digit client number with a parity bit
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ████████░░ 77% | 121 / 157 | 2024-03-13 | JavaScript
+▮▯▯▯ | ████████░░ 77% | 122 / 158 | 2024-03-13 | JavaScript
 
 ## Comment
diff --git a/climbing-stairs/README.md b/climbing-stairs/README.md
@@ -6,10 +6,10 @@ My solution for the ['Climbing Stairs' Challenge](https://platform.entwicklerhel
 Goal is to return all different ways are there to get up a given amount of steps, when you can take either 1 or 2 steps at a time.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ███████░░░ 69% | 592 / 860 | 2022-06-06 | JavaScript
+▮▯▯▯ | ███████░░░ 69% | 592 / 861 | 2022-06-06 | JavaScript
 
 ## Comment
 Originally tried to solve it with an iterative approach, but failed back then for some reason, so then instead went for a recursive solution finally.
diff --git a/document-scan/README.md b/document-scan/README.md
@@ -8,7 +8,7 @@ Challenge consisted of extracting an Address from a scanned document. The scanne
 The first scenario was the 'easy' mode, which only contained perfectly aligned scans. The challenge allowed for a 'hard' mode, which also included scans, that were not correctly aligned, e.g. the letters were skewed slightly, either going up or down.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | ███░░░░░░░ 31% | 68 / 220 | 2023-09-03 | Java

diff --git a/easter-challenge-2022/README.md b/easter-challenge-2022/README.md
@@ -6,7 +6,7 @@ My solution for the ['Easter Challenge 2022' Challenge](https://platform.entwick
 Goal is to create a function that can calculate the Easter holidays for any given year
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | ██████░░░░ 64% | 141 / 220 | 2022-06-02 | PHP

diff --git a/easy-storage/README.md b/easy-storage/README.md
@@ -6,10 +6,10 @@ My solution for the ['Easy Storage' Challenge](https://platform.entwicklerheld.d
 Implement a program that helps 'store' items in repositories.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ██████░░░░ 63% | 1244 / 1976 | 2024-04-15 | Java
+▮▯▯▯ | ██████░░░░ 63% | 1245 / 1977 | 2024-04-15 | Java
 
 ## Comment
 Just required some very basic HashMap related methods
diff --git a/emoji-bot/README.md b/emoji-bot/README.md
@@ -6,7 +6,7 @@ My solution for the ['Emoji Bot' Challenge](https://platform.entwicklerheld.de/c
 Process messages that may or may not contain emojis, and store them in a Redis instance
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | ████░░░░░░ 39% | 459 / 1187 | 2024-04-27 | Java

diff --git a/entwicklerheld-celebration/README.md b/entwicklerheld-celebration/README.md
@@ -6,7 +6,7 @@ My solution for the ['EntwicklerHeld Celebration' Challenge](https://platform.en
 Calculate how many times 'glasses' have clinked at a party
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | ███████░░░ 70% | 1232 / 1765 | 2024-03-18 | Python

diff --git a/fibonacci-numbers/README.md b/fibonacci-numbers/README.md
@@ -6,10 +6,10 @@ My solution for the ['Fibonacci Numbers' Challenge](https://platform.entwicklerh
 Implement an algorithm that return the n-th Fibonacci number
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ████████░░ 77% | 835 / 1085 | 2024-03-26 | Python
+▮▯▯▯ | ████████░░ 77% | 837 / 1087 | 2024-03-26 | Python
 
 ## Comment
 I went with a recursive solution, and utilized a memo dictionary for memoization purposed, to avoid recalculating the same values again and again
diff --git a/filling-area-hard-mode/README.md b/filling-area-hard-mode/README.md
@@ -6,10 +6,10 @@ My solution for the ['Filling Area (Hard Mode)' Challenge](https://platform.entw
 Implement an algorithm that detects 'connected' areas of 0s with 1s and fills these area with 1s
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▮▮▯ | ██████░░░░ 60% | 360 / 599 | 2024-04-07 | Python
+▮▮▮▯ | ██████░░░░ 60% | 361 / 600 | 2024-04-07 | Python
 
 ## Comment
 I have added some additional difficulty here for myself, by also requiring 'multiple' boxes to be filled, if they are in the area. The original EH task only was testing for single boxes.
diff --git a/filling-area/README.md b/filling-area/README.md
@@ -6,9 +6,9 @@ My solution for the ['Filling Area' Challenge](https://platform.entwicklerheld.d
 Implement an algorithm that 'fills' an area of 0s with 1s
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▮▯▯ | █████░░░░░ 49% | 547 / 1109 | 2024-03-26 | Python
+▮▮▯▯ | █████░░░░░ 49% | 548 / 1110 | 2024-03-26 | Python
 
 ## Comment
diff --git a/fizzbuzz-without-if/README.md b/fizzbuzz-without-if/README.md
@@ -6,9 +6,9 @@ My solution for the ['Fizz Buzz without 'if'' Challenge](https://platform.entwic
 Well known FizzBuzz challenge, but with a slight constraint of not using 'if' statements :-)
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ████████░░ 81% | 878 / 1090 | 2023-08-07 | Python
+▮▯▯▯ | ████████░░ 80% | 880 / 1094 | 2023-08-07 | Python
 
 ## Comment
diff --git a/fizzbuzz/README.md b/fizzbuzz/README.md
@@ -12,9 +12,9 @@ Goal is to create a function that:\
 * returns \'fizzbuzz\', when given number is divisble be 3 AND 5
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ███████░░░ 69% | 3284 / 4744 | 2022-04-24 | JavaScript
+▮▯▯▯ | ███████░░░ 69% | 3286 / 4744 | 2022-04-24 | JavaScript
 
 ## Comment
diff --git a/flatten-arrays/README.md b/flatten-arrays/README.md
@@ -6,9 +6,9 @@ My solution for the ['Flatten Arrays' Challenge](https://platform.entwicklerheld
 Given a nested list, flatten it to a single-level list by removing any nesting.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ████████░░ 76% | 713 / 936 | 2023-06-26 | Python
+▮▯▯▯ | ████████░░ 76% | 716 / 940 | 2023-06-26 | Python
 
 ## Comment
diff --git a/gdv-extraction/README.md b/gdv-extraction/README.md
@@ -6,7 +6,7 @@ My solution for the ['GDV Extraction' Challenge](https://platform.entwicklerheld
 Build a simple parser for some of the fields in the GDV format, a file format used by 'Gesamtverband der Deutschen Versicherungswirtschaft' for exchanging information in Germany's insurance industry.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | ████░░░░░░ 39% | 71 / 184 | 2023-07-02 | JavaScript

diff --git a/gps-navigation/README.md b/gps-navigation/README.md
@@ -6,7 +6,7 @@ My solution for the ['GPS Navigation' Challenge](https://platform.entwicklerheld
 Implement a trilateration method, which uses satellites to calculate the position of the car.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | ███░░░░░░░ 32% | 101 / 315 | 2024-04-28 | Python

diff --git a/grains/README.md b/grains/README.md
@@ -6,9 +6,9 @@ My solution for the ['Grains' Challenge](https://platform.entwicklerheld.de/chal
 Count the grains of rice on a chessboard at a given field, where the rice grains double with each field.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | █████████░ 85% | 473 / 558 | 2024-03-06 | Java
+▮▯▯▯ | █████████░ 85% | 476 / 560 | 2024-03-06 | Java
 
 ## Comment
diff --git a/hacking-a-slot-machine/README.md b/hacking-a-slot-machine/README.md
@@ -6,7 +6,7 @@ My solution for the ['Hacking a Slot Machine' Challenge](https://platform.entwic
 Change the behaviour of a slot machine to become a bit more 'unfair' after a few special cases
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | ████░░░░░░ 37% | 330 / 893 | 2024-03-17 | Python

diff --git a/happy-subnetting/README.md b/happy-subnetting/README.md
@@ -6,7 +6,7 @@ My solution for the ['Happy Subnetting' Challenge](https://platform.entwicklerhe
 
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▮▯ | ██░░░░░░░░ 24% | 55 / 228 | 2022-09-19 | JavaScript

diff --git a/insurance-matcher/README.md b/insurance-matcher/README.md
@@ -6,7 +6,7 @@ My solution for the ['Insurance Matching' Challenge](https://platform.entwickler
 Find the best match insurance based on user's preferences
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | ████░░░░░░ 40% | 256 / 638 | 2024-04-27 | Java

diff --git a/iot-office-sensors/README.md b/iot-office-sensors/README.md
@@ -6,7 +6,7 @@ My solution for the ['IoT Office Sensors' Challenge](https://platform.entwickler
 Goal was to work with byte data and converting these to integer values, taking care of unsigned/signed differences and different byte lengths
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | ██████░░░░ 56% | 176 / 312 | 2023-07-07 | Java

diff --git a/ip-location-powershell/README.md b/ip-location-powershell/README.md
@@ -6,9 +6,9 @@ My solution for the ['Tracking Cyber Threats: The IP Location Task' Challenge](h
 Challenge consisted of creatign a Powershell script that reads IP addresses from a file, sends these to an external IP Lookup service and then output that information as a CSV.
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▮▯▯ | █████░░░░░ 46% | 76 / 165 | 2023-10-09 | PowerShell
+▮▮▯▯ | █████░░░░░ 46% | 76 / 166 | 2023-10-09 | PowerShell
 
 ## Comment
diff --git a/isbn-verifier/README.md b/isbn-verifier/README.md
@@ -6,10 +6,10 @@ My solution for the ['ISBN Verifier' Challenge](https://platform.entwicklerheld.
 Write a function that checks if a supplied string is a valid ISBN number
 
 ## Challenge Info
-Data last updated: 2024-04-30
+Data last updated: 2024-05-03
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ███████░░░ 74% | 104 / 141 | 2024-03-11 | Kotlin
+▮▯▯▯ | ███████░░░ 74% | 110 / 148 | 2024-03-11 | Kotlin
 
 ## Comment
 First time meddling with Kotlin, did not feel too weird as a language :-)