Round 1
Questions:
-
Given an array of integers, where you can move to left, right, or an index which has the same exact value, calculate the minimum number of moves in which you can move from 0 to the last index.
Input: [1, 3, 2, 3, 5], res = 3 -
Find the longest palindromic substring. Required space complexity is O(1).
Candidate's Approach
Couldn’t solve the first question. Used the expand from center approach for the second question.
Interviewer's Feedback
No feedback provided.