Coding
1 sections, 4 questions
Write a program to implement insertion (enqueue) and deletion (dequeue) operations in a Queue.
Example:
Operations: enqueue(10), enqueue(20), enqueue(30), dequeue()
Output after dequeue: Front element removed is 10, Queue now: [20, 30]
The EY-GDS technical interview covered DSA basics including linked lists. Write a program to reverse a singly linked list.
Example:
Input: 1 -> 2 -> 3 -> 4 -> 5
Output: 5 -> 4 -> 3 -> 2 -> 1
The interviewer asked basic questions on stack data structure. Implement push and pop operations on a stack.
Example:
Operations: push(10), push(20), push(30), pop()
Output: Popped element: 30, Stack now: [10, 20]
The interviewer asked about the Graph data structure basics. Implement a breadth-first search (BFS) traversal of a graph.
Example:
Input: graph = {0: [1, 2], 1: [0, 3], 2: [0], 3: [1]}, start = 0
Output: 0 1 2 3