This is true, but performing a search operation on a list will change the time complexity of the operation from O(1) to O(n).

Dict approach (hex string -> integer) [current implementation]

  hex_dict = {'0': 0, '1': 1, ..., 'F': 15}
  - Lookup hex -> int: O(1) average
  - Reverse lookup int -> hex: O(n) (need to search through values)

List approach (index = integer, value = hex string)

  hex_list = ['0', '1', '2', ..., 'F']  # hex_list[15] = 'F'
  - Lookup int -> hex: O(1) (direct index access)
  - Reverse lookup hex -> int: O(n) (need to search through list)

Instead of creating "hexd" as a dict type, you can create a list,the items will be the keys and there index are the values.

actually very informative, thank you

I feel like every solution for this kata is crazier than previous...

Hello! Trying to understand, how it was made that dictionary with dots as values? I mean, I made an 'input().split() for _ in range(5)' cycle to copypast ABC\K symbols from Details window to my Solution code writing window (first I made a matrix filled with 0's). Was it good?

Approved!

Scala translation

Duplicate of any zip like kata. Here's a non-exhaustive list:

• https://www.codewars.com/kata/59778cb1b061e877c50000cc
• https://www.codewars.com/kata/56aaf25213edd3a88a000002
• https://www.codewars.com/kata/5825792ada030e9601000782
• https://www.codewars.com/kata/5826231422be6e7344000006

Done

Hi, could anyone check over and approve this kata?

Thanks!

.

The link at the end of the description links to a draft kata, and should be removed.

No problem! I'm glad it worked out :)

Thank you very much for your advice. There was indeed a trailing space.

hmm. Maybe your output has a trailing space. That could be an issue too. Check that. If it still doesn't work, show me your code.