(docs): Update README.md

pano9000 · Oct 11, 2024 · e90db50 · e90db50
1 parent 79a3258
commit e90db50
Show file tree

Hide file tree

Showing 93 changed files with 289 additions and 289 deletions.
diff --git a/README.md b/README.md
diff --git a/a-small-dumb-chatbot/README.md b/a-small-dumb-chatbot/README.md
@@ -6,7 +6,7 @@ My solution for the ['A small dumb Chatbot' Challenge](https://platform.entwickl
 Create a a small dumb chatbot
 
 ## Challenge Info
-Data last updated: 2024-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | █████░░░░░ 46% | 312 / 683 | 2024-07-09 | PHP

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-10-04
+Data last updated: 2024-10-11
 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,7 +6,7 @@ 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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | ███░░░░░░░ 33% | 543 / 1656 | 2024-03-17 | Python

diff --git a/allergies/README.md b/allergies/README.md
@@ -6,10 +6,10 @@ My solution for the ['Allergies' Challenge](https://platform.entwicklerheld.de/c
 Determine if a given allergen is present in a person's allergy score.
 
 ## Challenge Info
-Data last updated: 2024-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ██████░░░░ 60% | 160 / 267 | 2024-05-19 | CSharp
+▮▯▯▯ | ██████░░░░ 60% | 163 / 270 | 2024-05-19 | CSharp
 
 ## Comment
 After reading up on Bitmasks and how to use them, this was easily solvable :-)
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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | ████████░░ 84% | 1068 / 1278 | 2022-04-24 | JavaScript

diff --git a/analyse-the-plant/README.md b/analyse-the-plant/README.md
@@ -10,9 +10,9 @@ Challenge that dives into the world of workcenters, jobs, tasks. Consisting of t
 2) Required the implementation of an optimized job/task schedule across the two workcenters, by using the Johnson's Rules method.
 
 ## Challenge Info
-Data last updated: 2024-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▮▯▯ | ███░░░░░░░ 34% | 125 / 371 | 2024-07-05 | Java
+▮▮▯▯ | ███░░░░░░░ 34% | 126 / 372 | 2024-07-05 | Java
 
 ## Comment
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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | ███████░░░ 74% | 412 / 557 | 2024-03-28 | Python

diff --git a/armstrong-numbers-csharp/README.md b/armstrong-numbers-csharp/README.md
@@ -6,7 +6,7 @@ My solution for the ['Armstrong Numbers' Challenge](https://platform.entwicklerh
 Check if the provided number is an 'Armstrong Number'
 
 ## Challenge Info
-Data last updated: 2024-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | ████████░░ 81% | 96 / 119 | 2024-05-17 | CSharp

diff --git a/armstrong-numbers-java/README.md b/armstrong-numbers-java/README.md
@@ -6,9 +6,9 @@ My solution for the ['Armstrong Numbers' Challenge](https://platform.entwicklerh
 Check if the provided number is an 'Armstrong Number'
 
 ## Challenge Info
-Data last updated: 2024-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ████████░░ 80% | 109 / 136 | 2024-05-17 | Java
+▮▯▯▯ | ████████░░ 81% | 112 / 139 | 2024-05-17 | Java
 
 ## Comment
diff --git a/armstrong-numbers-python/README.md b/armstrong-numbers-python/README.md
@@ -6,9 +6,9 @@ My solution for the ['Armstrong Numbers' Challenge](https://platform.entwicklerh
 Check if the provided number is an 'Armstrong Number'
 
 ## Challenge Info
-Data last updated: 2024-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | █████████░ 89% | 166 / 187 | 2024-05-17 | Python
+▮▯▯▯ | █████████░ 88% | 167 / 189 | 2024-05-17 | Python
 
 ## Comment
diff --git a/armstrong-numbers/README.md b/armstrong-numbers/README.md
@@ -6,7 +6,7 @@ My solution for the ['Armstrong Numbers' Challenge](https://platform.entwicklerh
 Check if the provided number is an 'Armstrong Number'
 
 ## Challenge Info
-Data last updated: 2024-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | ████████░░ 77% | 60 / 78 | 2024-05-17 | Kotlin

diff --git a/binary-search-js/README.md b/binary-search-js/README.md
@@ -6,7 +6,7 @@ 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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | ██████░░░░ 58% | 136 / 234 | 2024-02-29 | JavaScript

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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | ███████░░░ 65% | 607 / 935 | 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-10-04
+Data last updated: 2024-10-11
 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,9 +6,9 @@ My solution for the ['Bricks and Water' Challenge](https://platform.entwicklerhe
 
 
 ## Challenge Info
-Data last updated: 2024-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ████░░░░░░ 44% | 732 / 1677 | 2022-05-01 | JavaScript
+▮▯▯▯ | ████░░░░░░ 44% | 733 / 1677 | 2022-05-01 | JavaScript
 
 ## Comment
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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ███████░░░ 66% | 347 / 524 | 2023-05-07 | JavaScript
+▮▯▯▯ | ███████░░░ 66% | 347 / 525 | 2023-05-07 | JavaScript
 
 ## Comment
diff --git a/camelcase-to-snakecase/README.md b/camelcase-to-snakecase/README.md
@@ -6,9 +6,9 @@ My solution for the ['CamelCase to snake_case' Challenge](https://platform.entwi
 Rename all keys of a given map from camelCase to snake_case
 
 ## Challenge Info
-Data last updated: 2024-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | █████░░░░░ 52% | 160 / 305 | 2024-06-06 | Kotlin
+▮▯▯▯ | █████░░░░░ 53% | 162 / 307 | 2024-06-06 | Kotlin
 
 ## 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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▮▯▯ | ███░░░░░░░ 34% | 37 / 109 | 2024-04-15 | JavaScript
+▮▮▯▯ | ████░░░░░░ 35% | 38 / 109 | 2024-04-15 | JavaScript
 
 ## Comment
diff --git a/change-calculator/README.md b/change-calculator/README.md
@@ -6,10 +6,10 @@ 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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▮▯▯ | ████░░░░░░ 36% | 129 / 357 | 2023-07-11 | Java
+▮▮▯▯ | ████░░░░░░ 36% | 130 / 358 | 2023-07-11 | Java
 
 ## Comment
 Quickly recognized the problem to be solveable by a "best sum" dynamic programming approach, which I then implemented and also included memoization, to improve performance
diff --git a/chatgpt-whatsapp-bot/README.md b/chatgpt-whatsapp-bot/README.md
@@ -6,7 +6,7 @@ My solution for the ['ChatGPT WhatsApp Bot' Challenge](https://platform.entwickl
 Create a simple 'WhatsApp Bot' using Twilio to get replies from ChatGPT'
 
 ## Challenge Info
-Data last updated: 2024-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | ████░░░░░░ 37% | 84 / 224 | 2024-06-13 | Python

diff --git a/christmas-tree-of-hanoi/README.md b/christmas-tree-of-hanoi/README.md
@@ -6,7 +6,7 @@ My solution for the ['Christmas Tree of Hanoi' Challenge](https://platform.entwi
 Write a function that captures all needed moves to solve the 'Christmas Trees of Hanoi' (better know as 'Towers of Hanoi') problem.
 
 ## Challenge Info
-Data last updated: 2024-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | ██████░░░░ 63% | 184 / 292 | 2024-05-22 | JavaScript

diff --git a/cinema-seat-reservation/README.md b/cinema-seat-reservation/README.md
@@ -6,10 +6,10 @@ My solution for the ['Cinema Seat Reservation' Challenge](https://platform.entwi
 
 
 ## Challenge Info
-Data last updated: 2024-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▮▮▮ | █░░░░░░░░░ 12% | 58 / 474 | 2022-10-08 | JavaScript
+▮▮▮▮ | █░░░░░░░░░ 12% | 58 / 475 | 2022-10-08 | JavaScript
 
 ## Comment
 Difficult challenge because of some "special" requirements, when the seats needed to be moved, which felt a bit arbitrary at times.
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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▮▯▯ | ████░░░░░░ 42% | 71 / 168 | 2024-04-05 | JavaScript
+▮▮▯▯ | ████░░░░░░ 43% | 72 / 169 | 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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ████████░░ 76% | 147 / 194 | 2024-03-13 | JavaScript
+▮▯▯▯ | ████████░░ 76% | 148 / 195 | 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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ███████░░░ 69% | 597 / 866 | 2022-06-06 | JavaScript
+▮▯▯▯ | ███████░░░ 69% | 598 / 867 | 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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | ███░░░░░░░ 30% | 70 / 232 | 2023-09-03 | Java

diff --git a/doubly-linked-list/README.md b/doubly-linked-list/README.md
@@ -6,9 +6,9 @@ My solution for the ['Doubly Linked List' Challenge](https://platform.entwickler
 Implement the pop, push, shift and unshift methods of a doubly linked list
 
 ## Challenge Info
-Data last updated: 2024-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ██████░░░░ 59% | 97 / 165 | 2024-06-06 | Java
+▮▯▯▯ | ██████░░░░ 59% | 98 / 166 | 2024-06-06 | Java
 
 ## Comment
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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▯▯▯ | ██████░░░░ 64% | 143 / 222 | 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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ██████░░░░ 63% | 1249 / 1979 | 2024-04-15 | Java
+▮▯▯▯ | ██████░░░░ 63% | 1252 / 1981 | 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,9 +6,9 @@ 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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ████░░░░░░ 39% | 464 / 1194 | 2024-04-27 | Java
+▮▯▯▯ | ████░░░░░░ 39% | 465 / 1195 | 2024-04-27 | Java
 
 ## Comment
diff --git a/entwicklerheld-celebration/README.md b/entwicklerheld-celebration/README.md
@@ -6,9 +6,9 @@ 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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ███████░░░ 70% | 1238 / 1771 | 2024-03-18 | Python
+▮▯▯▯ | ███████░░░ 70% | 1239 / 1772 | 2024-03-18 | Python
 
 ## Comment
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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ████████░░ 77% | 868 / 1122 | 2024-03-26 | Python
+▮▯▯▯ | ████████░░ 77% | 871 / 1125 | 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,7 +6,7 @@ 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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▮▯ | ██████░░░░ 60% | 364 / 603 | 2024-04-07 | Python

diff --git a/filling-area/README.md b/filling-area/README.md
@@ -6,7 +6,7 @@ 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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
 ▮▮▯▯ | █████░░░░░ 50% | 552 / 1114 | 2024-03-26 | Python

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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ████████░░ 81% | 907 / 1123 | 2023-08-07 | Python
+▮▯▯▯ | ████████░░ 81% | 909 / 1125 | 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-10-04
+Data last updated: 2024-10-11
 Difficulty | Overall Success Rate @EH | Overall Solved/Accepted @EH | Date Solved | Language
 ---|---|---|---|---|
-▮▯▯▯ | ███████░░░ 69% | 3339 / 4816 | 2022-04-24 | JavaScript
+▮▯▯▯ | ███████░░░ 69% | 3343 / 4819 | 2022-04-24 | JavaScript
 
 ## Comment