Location: USA, Position: SWE Internship 2021 (Summer)\nGave an OA a few days ago, passed the round, and moving on to the phone interview round. Got 2 questions.\n\nQ1. Variation of https://leetcode.com/discuss/interview-question/396769/\nProblem setting was same with the link above, but the required output was the number of valid times given the input such as "??:??".\nTest cases:\n``` \nInput: "??:??"\nOutput: 1440\n\nInput: "0?:14"\nOutput: 10\n``` \n\nQ2. Variation of https://leetcode.com/problems/longest-repeating-character-replacement/\nGiven an array consists of integers (ex. [1,2,3,1,2,3,3,3]), the required returning value is the length of longest substring that consists of repeating integer value you can get with maximum 3 replacements (and you can replace any item with any value).\nTest cases:\n``` \nInput: A = [1,2,3,1,2,3,3,3]\nOutput: 6\nReplace A[1], A[3], A[4] with 3 (3 moves)\n\nInput: A = [1,2,7,8,3,45]\nOutput: 4\nPick any item and replace 3 items adjacent to that item with the value of the picked item.\n``` \n\nI think I gave the correct answer for Q1, but for Q2, I was running out of time and couldn\'t give the finalized solution.\nAny thoughts on Q2?

Location: USA, Position: SWE Internship 2021 (Summer)\nGave an OA a few days ago, passed the round, and moving on to the phone interview round. Got 2 questions.