DSA and Language Questions: 1. Difference between Arrays and ArrayList in Java. 2. Queue Implementation using Linked List. 3. BST- How would you fill a BST with a sorted array. 4. Random pointer linked-list clone. 5. Fibonacci number generation using recursion. 6. What is the fastest sorting algorithm? 7. Clone a linked list with a random pointer. 8. Print Fibonacci numbers until the nth term using only recursion (no loop allowed) 9. Reflection in java. 10. Random pointer ques. 11. Print pair with given sum. 12. Array Rotation 13. Binary search method 14. How would binary search be done in a rotated array? 15. During Binary Search, what if negative elements were there in an array as well how would you search a specific element and time complexity for the same.

Question

Accepted Answer

A list of technical questions related to data structures and algorithms in Java.

Arrays are fixed in size while ArrayLists can dynamically grow and shrink.
Queue can be implemented using a linked list by adding elements to the end and removing from the front.
To fill a BST with a sorted array, we can recursively divide the array in half and add the middle element as the root.
Random pointer linked-list clone can be done by creating a new node for each node in the original list and mapping the random pointers accordingly.
Fibonacci number generation using recursion can be done by recursively calling the function with the previous two numbers.
The fastest sorting algorithm is QuickSort with an average time complexity of O(nlogn).
To clone a linked list with a random pointer, we can create a new node for each node in the original list and map the random pointers accordingly.
Printing Fibonacci numbers until the nth term using only recursion can be done by recursively calling the function with the previous two numbers and stopping at the nth term.
Reflection in Java is a feature that allows a program to examine or modify the runtime behavior of objects.
Binary search can be done in a rotated array by finding the pivot point and then performing binary search on the two subarrays.
To print pairs with a given sum, we can use a hash set to store the difference between the sum and each element and check if the difference exists in the set.
Array rotation can be done by reversing the first part of the array, reversing the second part of the array, and then reversing the entire array.
Binary search can be done by dividing the array in half and checking if the middle element is the target. If not, repeat on the appropriate subarray.
Binary search in a rotated array can be done by finding the pivot point and then performing binary search on the two subarrays.
During binary search, negative elements do not affect the search algorithm as it only checks for equality with the target element. Time complexity remains O(logn).

Top RaRa Delivery Sde1 interview questions & answers

Popular interview questions of Sde1

Top HR questions asked in RaRa Delivery Sde1