AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
ConsultAdd
Compare
Filter interviews by
ConsultAdd Interview Questions and Answers
10 Interview questions
Bubble sorting has a time complexity of O(n^2) for a sorted list.
Bubble sorting has a worst-case time complexity of O(n^2) for a sorted list.
The time complexity does not change even if the list is already sorted.
Example: If we have a sorted list of size n, bubble sorting will still take O(n^2) time.
An abstract class is a class that cannot be instantiated and may contain abstract methods that must be implemented by its subclasses.
Cannot be instantiated directly
May contain abstract methods
Used as a blueprint for other classes
Abstraction is the process of hiding complex details and showing only the essential features of an object or system.
Abstraction allows us to focus on what an object does, rather than how it does it
It helps in simplifying complex systems by breaking them down into smaller, more manageable parts
Examples of abstraction include using a car without needing to understand its internal combustion engine, or using a smartp...
Find the longest subsequence in a string
Iterate through the string and keep track of the longest subsequence found so far
Use a hashmap to store the last index of each character seen
Update the longest subsequence length when a character is repeated
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.
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.
A requirement is a specific need or expectation that must be met in order to achieve a desired outcome.
A requirement is a statement of what a product or service must do or how it must perform.
Requirements can be functional (what the product must do) or non-functional (how well it must do it).
Requirements should be clear, concise, and measurable.
Examples of requirements include: the ability to save and retrieve dat...
Find the 2nd largest element in an array with the least time complexity.
Sort the array in descending order and return the element at index 1.
Initialize two variables to keep track of the largest and second largest elements.
Iterate through the array and update the variables accordingly.
Return the second largest element.
I resonate with a Swiss Army Knife, embodying versatility, adaptability, and practicality in my approach to challenges.
Versatility: Like a Swiss Army Knife, I can handle various tasks, from creative brainstorming to data analysis.
Adaptability: I thrive in dynamic environments, adjusting my strategies based on changing market trends.
Practicality: I focus on solutions that are effective and efficient, ensuring that ...
QuickSort is one of the best sorting algorithms with an average time complexity of O(n log n).
QuickSort is a divide and conquer algorithm that works by selecting a 'pivot' element and partitioning the array around the pivot.
It has an average time complexity of O(n log n) and a worst-case time complexity of O(n^2).
Example: ['apple', 'banana', 'cherry', 'date', 'fig'] can be sorted using QuickSort.
Example: ['3', '1'...
ConsultAdd Interview Experiences
37 interviews found
Anonymous
I applied via Google and was interviewed in Aug 2023. There were 4 interview rounds.
Coding questions about array and string.
Cosing questions about sql and ds.
(1 Question)
- Q1. Personal and behavioral questions.
Interview Preparation Tips
(4 Questions)
- Q1. What is an abstract class?
- Ans.
An abstract class is a class that cannot be instantiated and may contain abstract methods that must be implemented by its subclasses.
Cannot be instantiated directly
May contain abstract methods
Used as a blueprint for other classes
- Q2. What is abstraction?
- Ans.
Abstraction is the process of hiding complex details and showing only the essential features of an object or system.
Abstraction allows us to focus on what an object does, rather than how it does it
It helps in simplifying complex systems by breaking them down into smaller, more manageable parts
Examples of abstraction include using a car without needing to understand its internal combustion engine, or using a smartphone ...
- Q3. Best sorting algo?time complexity of it?
- Ans.
QuickSort is one of the best sorting algorithms with an average time complexity of O(n log n).
QuickSort is a divide and conquer algorithm that works by selecting a 'pivot' element and partitioning the array around the pivot.
It has an average time complexity of O(n log n) and a worst-case time complexity of O(n^2).
Example: ['apple', 'banana', 'cherry', 'date', 'fig'] can be sorted using QuickSort.
Example: ['3', '1', '4'...
- Q4. You have been provided a sorted list time complexity achieved after we apply bubble sorting
- Ans.
Bubble sorting has a time complexity of O(n^2) for a sorted list.
Bubble sorting has a worst-case time complexity of O(n^2) for a sorted list.
The time complexity does not change even if the list is already sorted.
Example: If we have a sorted list of size n, bubble sorting will still take O(n^2) time.
(1 Question)
- Q1. Have you ever been to a state other than jharkhand?
- Ans.
Yes, I have been to multiple states other than Jharkhand.
I have traveled to states like Maharashtra, Karnataka, and Tamil Nadu for work and leisure.
I have visited tourist destinations in states like Rajasthan, Kerala, and Himachal Pradesh.
I have family in states like Uttar Pradesh, Bihar, and West Bengal, which I have visited multiple times.
I appeared for an interview in Nov 2024.
Questions related to rfp and procurement law
(2 Questions)
- Q1. Regarding indian contract act
- Q2. Regarding indian competition law
Interview Preparation Tips
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
(3 Questions)
- Q1. Question related to oops
- Q2. Question related to coding
- Q3. I was rejected after 2nd round
(2 Questions)
- Q1. Question related to advanced topic in oops
- Q2. Question related to coding
Tanushree Dour
I applied via Campus Placement and was interviewed in Jun 2024. There were 4 interview rounds.
In the coding test, there were 2 problems based on arrays and hashing (easy to medium level leetcode)
(2 Questions)
- 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?
- Q2. DBMS question: Normalization questions and keys concepts.
(2 Questions)
- 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.
- Ans.
Sort a stack of numbers in ascending order using only the stack itself.
Use a temporary stack to hold elements while sorting.
Pop elements from the original stack and compare with the temporary stack.
Push elements to the temporary stack in sorted order.
Once sorted, transfer elements back to the original stack.
- Q2. OS and DBMS questions(sharding, semaphores, etc.)
(1 Question)
- Q1. Questions based on Consultadd principles.
Interview Preparation Tips
I applied via Campus Placement and was interviewed in Sep 2024. There were 2 interview rounds.
2 coding questions medium to hard level
(3 Questions)
- Q1. Doubly Linkeded List
- 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.
- Q3. DBMS Normalisation
Interview Preparation Tips
Skills evaluated in this interview
Siddharth Choudhary
I applied via Walk-in
(2 Questions)
- 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.
- 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
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Dec 2024. There was 1 interview round.
2 questions of DSA medium to hard
(3 Questions)
- Q1. Given an array Reverse array
- Q2. Giaven a string Reverse string
- Q3. Given array find sum of all elements
Interview Preparation Tips
Skills evaluated in this interview
Jayesh Telang
Communication skills
(2 Questions)
- Q1. About US market and visa.
- Q2. Cold calling and comfortable in working in night shift?
- Ans.
Yes, I have experience with cold calling and working night shifts.
I have extensive experience in cold calling and have successfully built relationships with clients through this method.
I am comfortable working night shifts and have done so in previous roles, ensuring that all tasks are completed efficiently and effectively.
I understand the importance of flexibility in working hours in the recruitment industry and am wi...
Samarth Gupta
(1 Question)
- Q1. Dsa oops cn os
(1 Question)
- Q1. Dsa oops cn os
(1 Question)
- Q1. Yourself, education, family, future
Top trending discussions
ConsultAdd Interview FAQs
Some of the top questions asked at the ConsultAdd interview -
The duration of ConsultAdd interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
ConsultAdd Interviews By Designations
- ConsultAdd Software Developer Interview Questions
- ConsultAdd Management Trainee Interview Questions
- ConsultAdd Software Engineer Interview Questions
- ConsultAdd Associate Software Engineer Interview Questions
- ConsultAdd Sdet Lead Interview Questions
- ConsultAdd Management Engineer Trainee Interview Questions
- ConsultAdd Information System Engineer Interview Questions
- ConsultAdd Graduate Trainee Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Management Trainee Interview Questions
- Associate Interview Questions
- Team Lead Interview Questions
- Software Engineer Interview Questions
- Senior Associate Interview Questions
- Associate Software Engineer Interview Questions
- Accountant Interview Questions
- Show more
Overall Interview Experience Rating
based on 30 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
ConsultAdd Reviews and Ratings
based on 60 reviews
Rating in categories
|
Software Engineer
45
salaries
|  ₹5.8 L/yr - ₹18 L/yr |
|
Business Analyst
36
salaries
| ₹5 L/yr - ₹11 L/yr |
|
Management Engineer Trainee
17
salaries
| ₹4.6 L/yr - ₹5.8 L/yr |
|
Management Trainee
16
salaries
| ₹4.6 L/yr - ₹6.5 L/yr |
|
Associate Software Engineer
12
salaries
| ₹4.2 L/yr - ₹15 L/yr |
JoulestoWatts Business Solutions
Value Point Systems
Saama Technologies
Systems Plus
- Home >
- Interviews >
- ConsultAdd Interview Questions
