4 Rounds of Interview. 1st round: OA. 2nd Round: Technical + Low-level DSA. 3rd round: High-level. 4th Round: HR. Interviewer was friendly. Questions asked from resume and DSA Leetcoding type - Easy and Medium type.
Faced three medium to hard coding challenges involving Graphs, Dynamic Programming, and Arrays. Each problem required effective problem-solving strategies and algorithmic thinking to implement optimized solutions across distinct data structures.
Reverse the kth group in a linked list. Language can be user-preferred programming language. Find Minimum in Rotated Sorted Array. Input: nums = [3,4,5,1,2] Output: 1 Minimum Add to Make Parentheses Valid. Input: s = "())" Output: 1 Merge Sort
4 Rounds of Interview. 1st round: OA. 2nd Round: Technical + Low-level DSA. 3rd round: High-level. 4th Round: HR. Interviewer was friendly. Questions asked from resume and DSA Leetcoding type - Easy and Medium type.
Faced three medium to hard coding challenges involving Graphs, Dynamic Programming, and Arrays. Each problem required effective problem-solving strategies and algorithmic thinking to implement optimized solutions across distinct data structures.
Reverse the kth group in a linked list. Language can be user-preferred programming language. Find Minimum in Rotated Sorted Array. Input: nums = [3,4,5,1,2] Output: 1 Minimum Add to Make Parentheses Valid. Input: s = "())" Output: 1 Merge Sort