• ###### ovhaagcommented on "Two Sum" python solution

Great. Performs for big arrays. And readybility is good too, whenever I prefer a variable like 'offset' for 'i+1'.

• ###### Furrane2commented on "Detect Pangram" python solution

That's what I did, except I didn't know you could call ascii_lowercase so I used 'abcdefghijklmnopqrstuvwxyz' xD

• ###### hobovskycommented on "Help decide thief what to take." kata

Unpublishing due to being a duplicate, missing random tests, and a bunch of long-standing, not fixed issues.

• ###### ejini战神resolved an issue on "Valid Phone Number" kata

done by B4B ~~

yes

• ###### MDabrowski1990created a question for "Sum of all numbers with the same digits (performance edition)" kata

Are numbers starting with '0' are also consider valid, e.g.:
90 ---> 90 or 90 + 09

• ###### eqkwizardcommented on "Expressing Integers as Sum of Powers of Three" python solution

Very clever, clearly understand the number math of power of 3

• ###### user6793616commented on "We are Family" kata

Thank you for your nice comment. I appreciate it!

• ###### MDabrowski1990commented on "We are Family" kata

This Kata xD
It sounds easy at the beginning, but then number of exceptions to be taken into consideration is damn high.

Good job on preparing such Kata, there are not many problems (on Codewars) like this one.

• ###### akar-0commented on "Friends" kata

It's not ambiguous but merely logical. To take the example from the second example from the description: he eats pills A and B, his friend eats B and C. If both eventually glow, the glowing pill is B. If only his friend glows the pill is C. If he glows and his friend does not, the pill is A. If none of both glows, it is pill D.

• ###### MDabrowski1990commented on "Count Squares In the Chess Board" kata

I see it now, 100 random tests :)

• ###### MDabrowski1990commented on "Count Squares In the Chess Board" kata

I know this feeling bro :)
Do you know how many 120x120 tests are out there?

My current solution passes around 40-60. I want to know whether I should look for better algorithm or just optimize it?

• ###### jipikajyehcommented on "Two Sum" python solution

Hi! I am still new to this so be gentle xD
@Blind4Basics I was just looking over your solution and was wondering about it. Is that O(n)? because in worst senerio does 'if something in dict' not have O(n) complexity? In that case that solution too would be O(n^2) would it not?
It is no doubt faster than the most upvoted, but i think the complexity is the same even though yours is more like : O((n^2 + n)/2) which just translate to O(n^2).
I might be wrong and i would love it if you could explain where my knowlegde is flawed, because it 95 % of the time is xD.