ConsultAdd Interview Questions, Process, and Tips

Questions related to rfp and procurement law

Q1. Regarding indian contract act
Add your answer
Q2. Regarding indian competition law
Add your answer

Q1. Question related to oops
Add your answer
Q2. Question related to coding
Add your answer
Q3. I was rejected after 2nd round
Add your answer

Q1. Question related to advanced topic in oops
Add your answer
Q2. Question related to coding
Add your answer

In the coding test, there were 2 problems based on arrays and hashing (easy to medium level leetcode)

Q1. Several OOP questions were asked.... like, Can we have a class inside an interface? Can we have a static constructor? Can we have multiple main methods?
Add your answer
Q2. DBMS question: Normalization questions and keys concepts.
Add your answer

Q1. DSA question (stack based) You have a stack full of numbers, you have to arrange them in ascending order in the same stack without using any other data structure.
Add your answer
Q2. OS and DBMS questions(sharding, semaphores, etc.)
Add your answer

Q1. Questions based on Consultadd principles.
Add your answer

2 coding questions medium to hard level

Q1. Doubly Linkeded List
Add your answer
Q2. How to find if the Singly Linked List is cyclic or not in optimal way
Ans. 
Use Floyd's cycle detection algorithm to find if a Singly Linked List is cyclic or not.
• Use two pointers, slow and fast, where slow moves one step at a time and fast moves two steps at a time.

• If there is a cycle, the two pointers will eventually meet at some point.

• If the fast pointer reaches the end of the list (null), then there is no cycle.
Answered by AI
Add your answer
Q3. DBMS Normalisation
Add your answer

Q1. How make a queue using a stack
Ans. 
To implement a queue using a stack, use two stacks and simulate the queue operations.
• Use two stacks, one for enqueue operation and one for dequeue operation.

• For enqueue operation, simply push elements onto the stack used for enqueueing.

• For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.

• Then pop from the dequeue stack to simulate dequeue operation.
Answered by AI
Add your answer
Q2. Create a linked list
Ans. 
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
• Create a Node class with data and next pointer

• Initialize a head pointer to null

• Add nodes by updating next pointers

• Traverse the list by following next pointers
Answered by AI
Add your answer

Q1. Given an array Reverse array
Ans. 
Reverse array of strings
• Iterate through the array and swap elements from start to end

• Use two pointers, one at the beginning and one at the end, and swap elements until they meet
Answered by AI
Add your answer
Q2. Giaven a string Reverse string
Ans. 
Reverse a given string
• Use built-in functions like reverse() or loop through the string in reverse order

• Create a new string and append characters from the original string in reverse order

• Convert the string to an array of characters, reverse the array, and then join it back into a string
Answered by AI
Add your answer
Q3. Given array find sum of all elements
Ans. 
Calculate sum of all elements in a given array of strings
• Iterate through the array and convert each element to integer before adding to sum

• Handle edge cases like empty array or non-numeric elements

• Return the final sum after iterating through all elements
Answered by AI
Add your answer