Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Icertis Team. If you also belong to the team, you can get access from here

Icertis Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Icertis Software Engineer Interview Questions and Answers

Updated 9 Feb 2025

Icertis Software Engineer Interview Experiences

9 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
Selected Selected
Round 1 - Coding Test 

They asked to write program on different senario.

Round 2 - Technical 

(2 Questions)

  • Q1. What is inheritance ?
  • Ans. 

    Inheritance is a concept in object-oriented programming where a class inherits attributes and methods from another class.

    • Allows a class to inherit attributes and methods from another class

    • Promotes code reusability and reduces redundancy

    • Creates a parent-child relationship between classes

    • Derived class can access and modify the properties and methods of the base class

    • Example: Class 'Car' can inherit from class 'Vehicle' t

  • Answered by AI
  • Q2. Not remember ri8 now
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Basic aptitude questions

Round 2 - Coding Test 

Medium to hard level problems

Round 3 - HR 

(1 Question)

  • Q1. Basic HR questions

Software Engineer Interview Questions Asked at Other Companies

asked in Qualcomm
Q1. Bridge and torch problem : Four people come to a river in the nig ... read more
asked in Capgemini
Q2. In a dark room,there is a box of 18 white and 5 black gloves. You ... read more
asked in TCS
Q3. Find the Duplicate Number Problem Statement Given an integer arra ... read more
Q4. Tell me something about yourself. Define encapsulation. What is i ... read more
asked in Paytm
Q5. Puzzle : 100 people are standing in a circle .each one is allowed ... read more
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Coding round having 2 dsa question of easy to moderate level

Round 2 - Technical 

(1 Question)

  • Q1. Asked about the Project worked on last company. OOPS concept SQL question
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I was interviewed before Feb 2024.

Round 1 - Coding Test 

It was on HackerEarth some Aptitude & 2 coding questions which are Medium level tough

Round 2 - Technical 

(1 Question)

  • Q1. Core concepts oops, dsa
Round 3 - HR 

(1 Question)

  • Q1. Discussion about salary,relocation

Icertis interview questions for designations

 Associate Software Engineer

 (3)

 Lead Software Engineer

 (3)

 Senior Software Engineer

 (2)

 Software Developer

 (1)

 Platform Engineer

 (1)

 Senior Sse Software Engineering Analyst

 (1)

 Senior Engineer

 (1)

 Senior Functional Consultant

 (7)

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Company Website and was interviewed before Feb 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Hacker Earth Platform on Datastructures

Round 2 - Technical 

(1 Question)

  • Q1. On Object oriented, 2 -3 coding questions on Arrays, DS

Interview Preparation Tips

Interview preparation tips for other job seekers - Be strong with DS, Object oriented

I applied via Referral and was interviewed in Apr 2022. There were 2 interview rounds.

Round 1 - Coding Test 

LC Easy-Medium level questions

Round 2 - One-on-one 

(1 Question)

  • Q1. LC Medium questions + discussion based on your resume.

Interview Preparation Tips

Interview preparation tips for other job seekers - Negotiate as much as you can. The company has huge sums of money but does not want to pay. Don't expect many hikes once you are in.

I applied via Referral and was interviewed before Apr 2021. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

They give me few questions and scenarios to complete and execute in functions

Round 3 - Technical 

(1 Question)

  • Q1. C# and oops related question .net functionalities questions from api as mentioned in cv
Round 4 - Technical 

(1 Question)

  • Q1. 2nd technical round with product manager where he asked few DSA related questions . simple only
Round 5 - HR 

(1 Question)

  • Q1. Salary discussions and goal

Interview Preparation Tips

Interview preparation tips for other job seekers - Icertis is a good company to work for and their interview level is moderate to higher side.

I applied via Naukri.com and was interviewed in Feb 2021. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. As I was previously working as a full stack developer Role so questions were related to Frontend, Backend and DB. It was a good Experience with friendly interviewer.
  • Q2. First round consist of Online test than Technical round 1 and later Technical round 2.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare related to your previous role and Projects and the role you are applying for.

I applied via Campus Placement and was interviewed before Aug 2021. There were 4 interview rounds.

Round 1 - Aptitude Test 

Campus placement: Genral Aptitude logical reasoning, problem solving

Round 2 - Coding Test 

Code for writing one problem statement

Round 3 - Technical 

(2 Questions)

  • Q1. Technical Interview based on .net, SQL, azure
  • Q2. Second technical round same like above
Round 4 - HR 

(1 Question)

  • Q1. General HR questions and Forte

Interview Preparation Tips

Interview preparation tips for other job seekers - C# , Azure, SQL gives advantage and FORTE

Interview questions from similar companies

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity

    • Use binary search to find the partition point in both arrays

    • Calculate the median based on the partition point and array sizes

    • Adjust the partition points based on the median value

    • Repeat until the partition points are at the median

    • Handle edge cases such as empty arrays and uneven array sizes

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    Anagram of strings in O(1) space complexity

    • Use a fixed size array of integers to store the frequency of characters in the first string

    • Iterate through the second string and decrement the frequency of each character in the array

    • If all the frequencies are zero, then the strings are anagrams

    • Return true or false accordingly

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    Level order traversal of a tree using Queue

    • Create a queue and add the root node to it

    • While the queue is not empty, remove the front node and print its value

    • Add the left and right child nodes of the removed node to the queue

    • Repeat until the queue is empty

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    Reverse level order traversal of a tree using Queue

    • Create a queue and push the root node into it

    • While the queue is not empty, pop the front node and push its children into the queue

    • Add the popped node to a stack

    • Once the queue is empty, pop elements from the stack and print them

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.

    • BFS uses a queue while DFS uses a stack or recursion.

    • BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.

    • BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.

    • BFS can be used to find connected components while DFS

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    Find product of each element of an array except that element in O(N) time complexity without using / operation

    • Use prefix and suffix products

    • Multiply prefix and suffix products for each element to get the final product

    • Handle edge cases where array has 0 or 1 element separately

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    Recursively delete a linked list

    • Create a recursive function that takes the head of the linked list as input

    • Base case: if the head is null, return

    • Recursively call the function with the next node as input

    • Delete the current node

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    Recursively delete a linked list from the end.

    • Start from the head and recursively traverse to the end of the list.

    • Delete the last node and set the second last node's next pointer to null.

    • Repeat until the entire list is deleted.

    • Use a recursive function to implement the deletion process.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    Recursively delete a tree by deleting all its child nodes and then the parent node.

    • Start from the leaf nodes and delete them first.

    • Then move up to the parent nodes and delete them.

    • Repeat until the root node is deleted.

    • Use post-order traversal to ensure child nodes are deleted before parent nodes.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    Recursively delete elements from the end of an array.

    • Create a recursive function that removes the last element of the array.

    • Call the function recursively until the desired number of elements are removed.

    • Handle edge cases such as empty arrays and removing more elements than the array contains.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.

    • Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.

    • Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).

    • Floyd Warshall can handle negative edge weights while Djikstra cannot.

    • Floyd Warshall can detect negative cycles while Dj

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    There is no known algorithm to find shortest path in 2-D space in O(log N) time.

    • The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).

    • Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).

    • If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    Design a system for putting newspapers using classes and functions

    • Create a Newspaper class with attributes like title, date, and content

    • Create a Publisher class with methods to publish and distribute newspapers

    • Create a Subscriber class with methods to subscribe and receive newspapers

    • Use inheritance to create different types of newspapers like daily, weekly, etc.

    • Implement a database to store newspaper information and ha

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    I believe practical experience is more valuable than higher studies.

    • I have gained valuable experience through internships and projects.

    • I prefer hands-on learning and problem-solving over theoretical knowledge.

    • I am constantly learning and improving my skills through online courses and workshops.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Icertis Interview FAQs

How many rounds are there in Icertis Software Engineer interview?
Icertis interview process usually has 2-3 rounds. The most common rounds in the Icertis interview process are Coding Test, Technical and HR.
How to prepare for Icertis Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Icertis. The most common topics and skills that interviewers at Icertis expect are SQL, microsoft, Javascript, Windows and .Net.
What are the top questions asked in Icertis Software Engineer interview?

Some of the top questions asked at the Icertis Software Engineer interview -

  1. what is inheritanc...read more
  2. As I was previously working as a full stack developer Role so questions were re...read more
  3. 2nd technical round with product manager where he asked few DSA related questio...read more

Recently Viewed

INTERVIEWS

Suma Soft

10 top interview questions

COMPANY BENEFITS

Nowfloats Technologies

No Benefits

INTERVIEWS

Wipro

No Interviews

INTERVIEWS

BigBasket

No Interviews

JOBS

Nityo Infotech

No Jobs

JOBS

builder.ai

No Jobs

JOBS

CGI Group

No Jobs

JOBS

CareerPage

No Jobs

JOBS

Nowfloats Technologies

No Jobs

REVIEWS

CGI Group

No Reviews

Tell us how to improve this page.

Icertis Software Engineer Interview Process

based on 6 interviews

2 Interview rounds

  • Coding Test Round
  • Technical Round
View more
Icertis Software Engineer Salary
based on 225 salaries
₹5.3 L/yr - ₹15 L/yr
17% more than the average Software Engineer Salary in India
View more details

Icertis Software Engineer Reviews and Ratings

based on 36 reviews

3.3/5

Rating in categories

2.9

Skill development

3.3

Work-life balance

3.1

Salary

3.7

Job security

3.7

Company culture

2.5

Promotions

3.0

Work satisfaction

Explore 36 Reviews and Ratings
Functional Consultant
292 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Functional Consultant
237 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
235 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
225 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Lead Software Engineer
166 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Icertis with

Apttus

4.4
Compare

Zycus Infotech

2.9
Compare

SirionLabs

3.8
Compare

SAP Ariba

4.2
Compare
Did you find this page helpful?
Yes No
write
Share an Interview