Codility Challenge: Technetium 2019

MaxPathFromTheLeftTopCorner

• Difficulty: Hard
• Find a maximal value path in a matrix, starting in the top-left corner and ending in the bottom-right corner.
• https://app.codility.com/programmers/challenges/technetium2019/
• https://app.codility.com/programmers/task/max_path_from_the_left_top_corner/

Versions

• Result
  • Good: Correctness 100%, Performance 100%.
  • OK: Correctness 100%, Performance <100%.
  • Fail: Correctness <100%, Performance <100%.
• File naming convention
  • Code A: Technetium2019A.java
  • etc

Gold Award

File	Complexity	Result	Report
A	O(N*M) or O(N*M*log(N+M))	Good	H64K5X-Y96