thanks

Is it a good thing?

B1ts - yeah, there was a subtle case I was missing in the control flow. Writing my own tests helped sort it out. Thanks again.

Agreed, that was part of my post. Thanks for marking this as "resolved".

Hi, yes. That's what it does in the IDE, as I try to explain in my post.

Hello, my code (in Python 3.7) passes all tests except one, where I get the following message:

After applying rank of 8 the progress was expected to be 0, but was actually 1: 1 should equal 0

However, if I run this in my IDE:

  user = User(rank=8) 
  user.inc_progress(8)
  print(user.progress)

The output, as expected, is 0.... Not sure whether to mark this as issue. Any suggestions?

Yes, sorry, my bad. I misinterpreted.

I stand corrected. :) Still...

Hy everyone, I am a little confused. Shouldn't the output in the case of a 1 x 1 array such as [[1,2,3,4,5]] be the inner list itself (hence [1,2,3,4,5]?

I also was stuck after trying a brute force permutations-based approach. But if you look closely there is a fairly easy approach along the lines @hobovsky suggested. My starting point so far is: is the N-1th digit is smaller than the Nth digit (with N = the number of digits in n), swap them. Iterating N times this will yield the solution for some cases, not all. After that you may want to think recursively. Hope this helps without giving away too much.

Fair enough. Hadn't thought about that!

I am a beginerr but this feels to easy for 6 kyu...