Notes

[] - Find minimum element in a sorted array rotated at a non given point eg, 4 5 0 1 2 3
[] - Given a binary tree and two nodes, find if the two nodes are cousins or not
[] - char frequency in string
[] - Add 1 Linked List
[] - Implement getElementById
[] - Find unique pairs of sum in array of unsorted array. Eg [4,3,1,2,5] Sum = 5 o/p (1,4)(2,3)
[] - linked list as 1 -> 2 -> 3 -> 4 -> 5 -> null. Node head reference is at 3, not at first element, delete 3 from the list.
[] - Difference in array elements (can contain duplicates) when rotated.
[] - Find maximum element from huge number of elements which can be solved using max heap.
[] - Recursive method to reverse a string
[] - Find kth largest element in a stream of numbers
[] - implement timeout mechanism for async calls
[] - Reject the async call once the request has reached a certain timeout.
[] - Find the loop in linked list
[] - How to find the node starting the loop.
[] - Find the first duplicate in the array having numbers. Eg [1,4,2,4,5,2] o/p: 4
[] - Generate all substrings from a string
[] - Write code for merge sort
[] - Maximum product of two numbers in an array.
[] - Flatten deep nested object :
const nestedData = {
name: 'Abc',
age: '29',
address: {
pincode: '110011',
area: 'bangalore',
state: 'karnataka',
location: {
lat: '122.21',
long: '11.21'
},
phone: '1212121'
}
}

o/p:
const op = {
"nestedData_name": "Abc",
"nestedData_age": "29",
"nestedData_address_pincode": "110011",
"nestedData_address_area": "bangalore",
"nestedData_address_state": "karnataka",
"nestedData_address_location_lat": "122.21",
"nestedData_address_phone": "1212121"
}