Zeel Infotech Interview Questions and Answers

Round duration - 120 Minutes
Round difficulty - Medium

Round duration - 60 Minutes
Round difficulty - Easy

Q1. 
Insertion Sort in a Linked List
Given a singly linked list with 'N' nodes containing integer values, your task is to sort the list using insertion sort and output the sorted list.
Insertion Sort is an al...read more
Ans. 
Implement insertion sort algorithm on a singly linked list with integer values.
• Traverse the linked list and for each node, find its correct position in the sorted list.

• Remove the node from the original list and insert it at the correct position in the sorted list.

• Repeat this process until all nodes are sorted.

• Ensure the implementation is in-place, without using extra space.

• Handle edge cases like empty list or single no...read more
Answered by AI
Add your answer
Q2. 
Implement Stack with Linked List
Your task is to implement a Stack data structure using a Singly Linked List.
Explanation:
Create a class named Stack which supports the following operations, each in O(1...read more
Ans. 
Implement a Stack data structure using a Singly Linked List with operations in O(1) time.
• Create a class named Stack with getSize, isEmpty, push, pop, and getTop methods.

• Use a Singly Linked List to store the elements of the stack.

• Ensure each operation runs in O(1) time complexity.

• Handle cases where the stack is empty appropriately.

• Implement the logic for each query type as specified in the input and output sections.
Answered by AI
Add your answer
Q3. 
Prime Numbers within a Range
Given an integer N, determine and print all the prime numbers between 2 and N, inclusive.
Input:
Integer N
Output:
Prime numbers printed on separate lines
Example:
Input...read more
Ans. 
Generate and print all prime numbers between 2 and N, inclusive.
• Iterate from 2 to N and check if each number is prime

• Use a helper function to determine if a number is prime

• Print each prime number on a new line
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This round was based on oops concepts and their applications and about STLs.

Q1. 
Rectangular Numbers Pattern
Given a number N, generate a pattern where the outer rectangle is filled with the number N, and the inner rectangles contain decreasing numbers down to 1.
Input:
The input be...read more
Ans. 
Generate a rectangular pattern with outer rectangle filled with N and inner rectangles containing decreasing numbers.
• Create a 2-D array with dimensions based on input N

• Fill the outer rectangle with N and inner rectangles with decreasing numbers down to 1

• Adjust the values in the inner rectangles based on the layer number

• Return the generated pattern as a 2-D list/array
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This around was basically to judge my communication and behavioral skills.