I had a medium-level technical interview, which focused on data structures and algorithms. The questions involved flattening a BST into a linked list, wave-sort of a linked list, and rotation count of a sorted array. In the second round, I solved dynamic programming problems like the maximum sum of non-adjacent elements and re-arranged a linked list by alternating nodes. Both rounds tested my problem-solving skills efficiently.