8 January 2025. Python. 317 lines. It took me 15 hours during 5 days. Time: 1380 - 1771ms (it seems too quickly, but I do not know why...). Great kata!!!
The problem is not redability but it's not escalable if we decide to made a polyhedron of more than 3 different faces; also this could be considered hardcoding, IMHO. But I really don't care as I am the first one on hardcoding "sometimes".
How could Zldm be the liar ? There are four people. Azqedoigu and Vtviuvsae are next to each other, so they can be at 1-2, 2-3 or 3-4. Vzqe says that there are two people in front of him, it's only possible if he is at 3 and Vtviuvsae-Azqedoigu are at 1-2. This leaves Zldm at 4, so he is not lying.
Python. I have got 800+ 'green tests', performance is enough, but it seems to me that something is wrong...
For instance:
Conversation:
['Azqedoigu:The man in front of me is Vtviuvsae.',
"Zldm:I'm in 4th position.",
'Vtviuvsae:The man behind me is Azqedoigu.',
'Vzqe:There are 2 people in front of me.']
: None should equal 'Vzqe'
As far as I understand this queue looks like: "Vtviuvsae - Azqedoigu - Vzqe - Zldm"
ALL say the TRUTH.
If one of them is exactly a mr.Wrong, why Vzqe is better than Zldm
3 April 2025. 478 lines. Python. 3662.47ms - 4524.12ms
It took me 65 hours during 15 days.
Great and very challenging kata.
10 March 2025. Python. 140 lines. Completed in 4861.79 - 7543.36ms
Not hard. It took 6 hours during 4 days.
Overestimated, I would rank it as 3 kyu
6 March 2025. 200 lines. Python. 2417.44ms
It took me about 30 hours during 7 days.
This one is not simple. In comparison with other solutions my code is the mess, but it works.
8 January 2025. Python. 317 lines. It took me 15 hours during 5 days. Time: 1380 - 1771ms (it seems too quickly, but I do not know why...). Great kata!!!
31 December 2024.
Python. 226 lines. My time is 10940.49ms.
It took me about 8 hours (I have reused my solution from previous kata). Tests are hard.
10 November 2024
170 lines of code. Python. My time is 2142.13ms
This one is not hard, it took me only 8 hours.
15 October 2024
Python. 372 lines. 5561.15 ms. It took me 7 days of work.
21 August 2024
420 lines in Python, Completed in 7424.58ms
The third attempt took me more than a week. Great kata!
If my grandma had wheels, she would've been a bike.
The problem is not redability but it's not escalable if we decide to made a polyhedron of more than 3 different faces; also this could be considered hardcoding, IMHO. But I really don't care as I am the first one on hardcoding "sometimes".
I have understood, thanks.
If Zldm is a liar Vzqe is also a liar, so we have TWO liars, but if Vzqe is a liar - It is ONLY ONE liar.
How could Zldm be the liar ? There are four people. Azqedoigu and Vtviuvsae are next to each other, so they can be at 1-2, 2-3 or 3-4. Vzqe says that there are two people in front of him, it's only possible if he is at 3 and Vtviuvsae-Azqedoigu are at 1-2. This leaves Zldm at 4, so he is not lying.
Python. I have got 800+ 'green tests', performance is enough, but it seems to me that something is wrong...
For instance:
Conversation:
['Azqedoigu:The man in front of me is Vtviuvsae.',
"Zldm:I'm in 4th position.",
'Vtviuvsae:The man behind me is Azqedoigu.',
'Vzqe:There are 2 people in front of me.']
: None should equal 'Vzqe'
As far as I understand this queue looks like: "Vtviuvsae - Azqedoigu - Vzqe - Zldm"
ALL say the TRUTH.
If one of them is exactly a mr.Wrong, why Vzqe is better than Zldm
simple absolute value, multiplication and subtraction are not readable? lolz
Search in the youtube. There are several funny things about this one.
Loading more items...