Algorithm to partition an array such that zeros are on the left side and other numbers are on the right side. Use an in-place optimal solution.
Initially, I had two phone screens, featuring medium LeetCode questions. After passing those, I was invited for the onsite interview. The onsite consisted of four technical LeetCode questions and one lunch session. Most of the LeetCode questions in
I applied through the university career website and received an interview invitation two weeks after that. The first interview was an HR phone screening, and the second interview was a technical interview with online real-time coding.
Algorithm to partition an array such that zeros are on the left side and other numbers are on the right side. Use an in-place optimal solution.
Initially, I had two phone screens, featuring medium LeetCode questions. After passing those, I was invited for the onsite interview. The onsite consisted of four technical LeetCode questions and one lunch session. Most of the LeetCode questions in
I applied through the university career website and received an interview invitation two weeks after that. The first interview was an HR phone screening, and the second interview was a technical interview with online real-time coding.