Nagarro Interview Question

1. Introduction 2. polimorphism and types 3. Inheritance and types 4. Final finally finalize 5. Given: linked list arr & int d Shift linkedlist d times 6. Data structures & algorithm 7. Given: linked list grade return LL with grace mark of 3 if applicable 8. Time complexity and notations 9. Time complexity of i) binary search ii) leanear search iii) for loop iv) for loop inside for loop