Skip to content

Latest commit

 

History

History
66 lines (40 loc) · 1.07 KB

README.md

File metadata and controls

66 lines (40 loc) · 1.07 KB

Python Challenges

Sample Python coding challenges


  • nested_arrays.py

  • nested_arrays_test.py

  • invite_customers.py

  • invite_customers_test.py

  • customers.json

    The report about a challenge of my last job interview.


  • walking-robot.py

    A robot which can move down and right is traversing some terrain that can be represented as a hex grid. Find the least cost path from top left to bottom right through such a grid. Return the path for the robot to follow.

Sample input

46B E59 EA C1F 45E 63

899 FFF 926 7AD C4E FFF

E2E 323 6D2 976 83F C96

9E9 A8B 9C1 461 F74 D05

EDD E94 5F4 D1D D03 DE3

89 925 CF9 CA0 F18 4D2

Sample output

r,r,d,d,r,d,d,r,r,d

Bonus: Consider allowing the robot to move up and left.


Sample Input

010079010+010079= 106010+010= BYE

Sample Output

010079010+010079=010106106 106010+010=106093