give triangle array return minimum path sum bottomFor step adjacent number row more formally index current row index index 1 row Example 1input triangle 2346574183output 11explanation the triangle look like 2 3 4 6 5 74 1 8 3the minimum path sum 2 3 5 1 11 underline aboveexample 2input triangle 10output 10 constraints1 trianglelength 200triangle0length 1triangleilength trianglei 1length 1104 triangleij 104 Follow could on extra space n total number row triangle