ConsultAdd Inc interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

ConsultAdd Inc
upvote
share-icon
1 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Journey
I focused extensively on DSA, solving numerous problems on LeetCode, GeeksforGeeks, and Code360. The mock interviews at Coding Ninjas were particularly helpful—they highlighted my weaknesses, and I worked on them to turn them into strengths. By giving multiple mock interviews, I gained confidence and improved both my problem-solving and interview skills.
Preparation
Topics: DSA, OS, DBMS, OOPs
Application process
Where: Coding Ninjas Placement Cell
Eligibility: B.Tech CS/IT (Grad Year-2025 & 2024)

Interview rounds

01
Round
Medium
Online Coding Interview
Duration
Interview date19 Mar 2025
Coding problem3

1. Overriding in Java – Implementation and Conceptual Questions

Write a Java program to demonstrate method overriding. You can use a parent class and a child class. Once done, explain how overriding works and answer the following:

  • What is method overriding?
  • How is it different from method overloading?
  • What is the purpose of the @Override annotation?
  • Can private or static methods be overridden? Why or why not?
  • How does polymorphism work in your example?"

2. Count Combinations to Reach Target Using Recursion

Given an array of positive integers arr and a target integer target, determine how many combinations of elements from arr (with repetition allowed) sum up to target. For example, if arr = {1, 2, 3} and target = 5, valid combinations include [1,1,1,1,1], [1,1,3], [2,3], [1,2,2], etc. Return the total number of such combinations.

3. Searching and Sorting Concepts

  1. Can you explain how Linear Search works? What is its time complexity?
  2. How does Binary Search work? What are the conditions for using it, and what is its time complexity?
  3. Can you implement Linear Search and Binary Search in code?
  4. What are different sorting algorithms you know? Explain their working with time and space complexity.
  5. Compare Bubble Sort, Insertion Sort, and Merge Sort. When would you use each?
  6. How would you sort a large dataset efficiently? Which algorithm would you choose and why?
  7. Can you explain stable vs unstable sorting algorithms with examples?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
Software Engineer
1 rounds | 2 problems
Interviewed by ConsultAdd Inc
53 views
0 comments
0 upvotes
Software Engineer
1 rounds | 1 problems
Interviewed by ConsultAdd Inc
53 views
0 comments
0 upvotes
Software Engineer
1 rounds | 2 problems
Interviewed by ConsultAdd Inc
49 views
0 comments
0 upvotes
Software Engineer
1 rounds | 1 problems
Interviewed by ConsultAdd Inc
47 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
4 rounds | 1 problems
Interviewed by Newgen Software
3210 views
2 comments
0 upvotes
company logo
Software Engineer
3 rounds | 6 problems
Interviewed by HashedIn
2582 views
0 comments
0 upvotes
company logo
Software Engineer
2 rounds | 2 problems
Interviewed by Ernst & Young (EY)
0 views
0 comments
0 upvotes