1. You are given a partially written DoublyLinkedList class.
2. You are required to complete the body of getAt function. This function is supposed to return value of node at given index.
3. If size of list is zero then return "ListIsEmpty: -1".
4. If Inddex is Invalid then return "IndexIsInValid: -1".
5. You are required to update head, tail and size as required.
6. Input and Output is managed for you. Just update the code in incomplete function.
Note -> Use the code snippet and follow the algorithm discussed in question video. The judge can't
force you but the intention is to teach a concept. Play in spirit of the question.
Input Format
input in managed for you.
Output Format
output in managed for you.
Constraints
0 <= N <= 10^6
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
addFirst 10 addFirst 20 addFirst 30 addLast 40 addLast 50 removeLast removeFirst addFirst 90 getAt 2 stop
Output
50 30 10 [90, 20, 10, 40]