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 Developer Interview Questions and Answers

Updated 24 Aug 2024

Icertis Software Developer Interview Experiences

1 interview found

Software Developer Interview Questions & Answers

user image Kritika Kaura

posted on 24 Aug 2024

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Coding Test 

Coding test mostly included moderate level DSA questions

Round 2 - Technical 

(1 Question)

  • Q1. Questions related to DSA, sql , projects done
Round 3 - HR 

(1 Question)

  • Q1. Some behavioural questions were asked

Interview questions from similar companies

Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Questions based on dp

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

Aptitude test of 85 min

Round 2 - Technical 

(2 Questions)

  • Q1. OOP concepts : - Inheritence , polymorphism
  • Q2. DSA :- arrays , strings basic leetcode questions
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Coupa and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

15 MCQs of two different sessions. They also has session isolated timings.

Round 2 - Coding Test 

3 Coding questions of easy and medium level.

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Apr 2024. There were 4 interview rounds.

Round 1 - Coding Test 

Aptitude+3 easy to medium level coding questions

Round 2 - Technical 

(1 Question)

  • Q1. Linked List & DSA questions on strings
Round 3 - Technical 

(1 Question)

  • Q1. Resume + DSA questions
Round 4 - Technical 

(1 Question)

  • Q1. Non technical+ System design basics + DSA

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare system design basics

I applied via Recruitment Consultant and was interviewed in Apr 2021. There were 3 interview rounds.

Interview Questionnaire 

5 Questions

  • Q1. 1 round of hacker rank online test + 2 rounds of technical + 1 managerial round.
  • Q2. Round 1 Q1: Reverse the Linked List
  • Q3. Round 1 Q2: Related to array simply sorting type problems
  • Q4. Level order traversal of tree
  • Ans. 

    Level order traversal of tree is a breadth-first search algorithm to visit all nodes in a tree level by level.

    • Use a queue to keep track of nodes to be visited

    • Enqueue the root node and loop until the queue is empty

    • Dequeue a node, visit it, and enqueue its children

    • Repeat until all nodes have been visited

  • Answered by AI
  • Q5. Round 2 Q1 : Simple design related questions how will you insert bulk data in db, expecting both maintaining consistency as well as without maintaining consistency.

Interview Preparation Tips

Interview preparation tips for other job seekers - It's a easy to medium level interview try to do well in technical round 1 and next will be easier.

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Jul 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

Basic aptitude test questions logical,mathematical,english

Round 2 - Coding Test 

Core java basics,collection

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Coding Test 

Data structure and algo

Round 2 - Technical 

(1 Question)

  • Q1. All around java and oops
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Jun 2023. There were 3 interview rounds.

Round 1 - Aptitude Test 

Not remembered right now

Round 2 - Technical 

(2 Questions)

  • Q1. Collection based question
  • Q2. Oops concept and some tricky question
Round 3 - HR 

(1 Question)

  • Q1. Salary discussion

Interview Preparation Tips

Topics to prepare for Zycus Infotech Software Engineer interview:
  • Collections
  • Arrays
  • OOPS
Interview preparation tips for other job seekers - Should be prepare on collection framework and there implementation

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 Developer interview?
Icertis interview process usually has 3 rounds. The most common rounds in the Icertis interview process are Coding Test, Technical and HR.
What are the top questions asked in Icertis Software Developer interview?

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

  1. Questions related to DSA, sql , projects d...read more
  2. Some behavioural questions were as...read more

Recently Viewed

INTERVIEWS

Syncfusion

No Interviews

INTERVIEWS

Syncfusion

No Interviews

COMPANY BENEFITS

Nucleus Software Exports

No Benefits

SALARIES

Nucleus Software Exports

SALARIES

Cedcoss Technologies

No Salaries

SALARIES

Cedcoss Technologies

No Salaries

REVIEWS

Cedcoss Technologies

No Reviews

SALARIES

Cedcoss Technologies

SALARIES

Nucleus Software Exports

No Salaries

REVIEWS

Cedcoss Technologies

No Reviews

Tell us how to improve this page.

Icertis Software Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
Icertis Software Developer Salary
based on 18 salaries
₹7 L/yr - ₹12 L/yr
21% more than the average Software Developer Salary in India
View more details

Icertis Software Developer Reviews and Ratings

based on 2 reviews

3.8/5

Rating in categories

3.8

Skill development

3.8

Work-life balance

3.8

Salary

4.0

Job security

3.8

Company culture

2.8

Promotions

3.8

Work satisfaction

Explore 2 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
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent