Given an array, please check if we can remove at most one element to make it strictly increasing.\n\n**Example 1:**\n```\nInput: [1, 2, 3, 7, 5, 6]\nOutput: true\n```\n\n**Example 2:**\n```\nInput: [1, 2, 3, 7, 8, 4, 5]\nOutput: false\n```\n\n------------------------------------\n**Follow-up 1:**\nWhat if at most 2?\n\n--------------------------------\n**Follow-up 2:**\nwhat if at most `k`?\n\nfirstly see K = 1, I focus too much on remove element, **but it\'s just a longest increasing sequence problem.**\n\nreference : https://www.geeksforgeeks.org/convert-to-strictly-increasing-integer-array-with-minimum-changes/\n\n```\nreturn (arr.size() - longest_increasing_element_cnt) >= K;\n```\n\nBut I realize til now...

Given an array, please check if we can remove at most one element to make it strictly increasing.\n\nExample 1:\n\nInput: [1, 2, 3, 7, 5, 6]\nOutput: true\n\n\n