Linked Lists Interview Questions

Round 1: Written Round Total Number of Questions \u2013 60 Questions Total Time \u2013 90 mins Quantitative Aptitude Questions Questions \u2013 20 Ques Time \u2013 30 mins Programming MCQ Questions Questions 20 Ques Time \u2013 30 mins Technical Section...

https://leetcode.com/problems/reverse-linked-list-ii/solutions/7494415/leetcode-92-reverse-linked-list-ii-simpl-7ovq https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/solutions/74944

**Round 1** 1. [Versioned stack](https://enginebogie.com/public/question/implement-a-versioned-stack/835?srsltid=AfmBOoobx_riYfhef2oDaaKCgxgIjZCvfOxzV9n4lMEf4syOydIQLmXl) 2. https://algo.monster/l

Amadeus Labs visited the Vellore Institute of Technology (VIT) on 9th August 2020. The hiring process took place virtually considering the COVID-19 pandemic. The recruitme...

Round 1:Interviewer was very cool guy, he started with general discussion about work and company. Later on he started with Technical Skills.1. Operator Program output (i.e...

LeetCode #23: Merge k Sorted Lists. Difficulty: Hard. Topics: Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort. Asked at Nvidia in the last 6 months.

LeetCode #138: Copy List with Random Pointer. Difficulty: Medium. Topics: Hash Table, Linked List. Asked at Walmart Labs in the last 6 months.

LeetCode #92: Reverse Linked List II. Difficulty: Medium. Topics: Linked List. Asked at Infosys in the last 6 months.

LeetCode #25: Reverse Nodes in k-Group. Difficulty: Hard. Topics: Linked List, Recursion. Asked at Infosys in the last 6 months.

LeetCode #2: Add Two Numbers. Difficulty: Medium. Topics: Linked List, Math, Recursion. Asked at Infosys in the last 6 months.

LeetCode #1290: Convert Binary Number in a Linked List to Integer. Difficulty: Easy. Topics: Linked List, Math. Asked at Nutanix in the last 6 months.

LeetCode #2: Add Two Numbers. Difficulty: Medium. Topics: Linked List, Math, Recursion. Asked at Zoho in the last 6 months.

LeetCode #141: Linked List Cycle. Difficulty: Easy. Topics: Hash Table, Linked List, Two Pointers. Asked at Palo Alto Networks in the last 6 months.

LeetCode #146: LRU Cache. Difficulty: Medium. Topics: Hash Table, Linked List, Design, Doubly-Linked List. Asked at ServiceNow in the last 6 months.

LeetCode #21: Merge Two Sorted Lists. Difficulty: Easy. Topics: Linked List, Recursion. Asked at ServiceNow in the last 6 months.

LeetCode #1206: Design Skiplist. Difficulty: Hard. Topics: Linked List, Design. Asked at Optiver in the last 6 months.

LeetCode #82: Remove Duplicates from Sorted List II. Difficulty: Medium. Topics: Linked List, Two Pointers. Asked at Arista Networks in the last 6 months.

LeetCode #234: Palindrome Linked List. Difficulty: Easy. Topics: Linked List, Two Pointers, Stack, Recursion. Asked at AMD in the last 6 months.

LeetCode #19: Remove Nth Node From End of List. Difficulty: Medium. Topics: Linked List, Two Pointers. Asked at Symantec in the last 6 months.

LeetCode #21: Merge Two Sorted Lists. Difficulty: Easy. Topics: Linked List, Recursion. Asked at Udemy in the last 6 months.

College : Tier 3 Batch : 2021 Experience : NA OA Participated in Paypal Hiring challenge on Hackerearth although it was for SE 2 & 3 positions. 2 questions \u2013 2hrs Solved...

Problem : A non-empty zero-indexed array A consisting of N integers is given. Array A represents a linked list. A list is constructed from this array as follows: \u2022 the first node (the...

Years of experience : 1yr [Service Based] Leetcode has been a great source for all these preparation , thus giving it back to the community by sharing my interview experiences. PayPal There were...

Status: 1.5 yrs exp @ Browserstack Position: ex-SDE at Browserstack (already resigned) Location: Mumbai, India Got the interview via referral from a close friend. Got referrals at other companies as well (Groww, Github...

Experience ~ 3 years (1.5 years in Product based startup + 1.4 year in Service based MNC) Position : Software Engineer Total rounds : 4 Round 1 : Online Assesment 10 MCQ + 2...