In DSA part, 1. Code for merge sort 2. Check if two trees are mirror 3. Find element in rotated sorted array 4. Check if linked list is palindrome 5. Detect a loop in linked list 6. Remove loop in linked list

Question

Accepted Answer

List of DSA questions including merge sort, tree mirror check, rotated sorted array search, linked list palindrome and loop detection and removal.

Merge sort is a divide and conquer algorithm that sorts an array in O(nlogn) time complexity.
To check if two trees are mirror, we need to compare their left and right subtrees recursively.
To find an element in a rotated sorted array, we can use binary search algorithm.
To check if a linked list is palindrome, we can use stack or recursion to compare the first half with the reversed second half.
To detect a loop in a linked list, we can use Floyd's cycle-finding algorithm.
To remove a loop in a linked list, we can use Floyd's cycle-finding algorithm to find the loop and then remove it by breaking the loop.

In DSA part, 1. Code for merge sort 2. Check if two trees are mirror 3. Find element in rotated sorted array 4. Check if linked list is palindrome 5. Detect a loop in linked list 6. Remove loop in linked list

Top Western Digital Firmware Engineer interview questions & answers

Popular interview questions of Firmware Engineer

Top HR questions asked in Western Digital Firmware Engineer