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

Updated 16 Jan 2025

Icertis Lead Consultant Interview Experiences

1 interview found

Lead Consultant Interview Questions & Answers

user image Shantanu Nesarikar

posted on 16 Jan 2025

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I was interviewed before Jan 2024.

Round 1 - One-on-one 

(2 Questions)

  • Q1. End-end implementation related questions of Icertis CLM
  • Q2. Difficult situation you faced during implementation stage
  • Ans. 

    During implementation, faced challenges with integrating new software with existing systems.

    • Lack of compatibility between new software and existing systems

    • Difficulty in data migration and transfer

    • Resistance from team members to adapt to new processes

  • Answered by AI

Interview questions from similar companies

Interview Preparation Tips

Round: Interview
Experience: They asked to write 2 codes on recursion. Then some questions on resume. I asked them about the job profile and after knowing that they were hiring candidates for frontend programming, about which they didn’t mention in JAF. I told them that I was not interested in frontend development. And didn’t even answer any question after that. Unfortunately, I was selected.

General Tips: Plan your schedule judiciously keeping your capacity in mind. There is no point of making ideal plans and then not able to do even 50% of it.
Don’t get into unnecessary arguments or debate with people.
Don’t think about what others are doing. Focus on your preparation.
How you carry yourself matters. So, make sure you portray yourself in the way you want the other person to perceive you.
Be selective while applying for companies.
College Name: IIT Kanpur
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

It was a good testAll the questions were from Indiabix.com

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

I applied via Referral and was interviewed in Sep 2023. There was 1 interview round.

Round 1 - HR 

(1 Question)

  • Q1. How would you add value to our company

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

I applied via LinkedIn and was interviewed before May 2021. There were 2 interview rounds.

Round 1 - Aptitude Test 

It was a hacker rank technical + aptitude test

Round 2 - Technical 

(1 Question)

  • Q1. Questions related to hoisting, ECMA 6 script questions etc.

Interview Preparation Tips

Interview preparation tips for other job seekers - The javascript basic concepts should be clear.

I applied via Company Website and was interviewed in Feb 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. They asked python memory management, string manipulations, regex, and about my current project

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep strong hold on python basics and data structure

I applied via LinkedIn and was interviewed before Apr 2020. There were 6 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Aptitude: probability (Bayes theorem), time-distance-speed, mathematical induction, logical questions

Interview Preparation Tips

Interview preparation tips for other job seekers - As a fresher do practice on aptitude questions and whatever you learned in 4 years of BTech e.g. Basics of DS, CO, OOP features
for front end - HTML, css, JS
for backend - Java and advanced Java

I applied via Campus Placement and was interviewed before Sep 2021. There were 4 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 - Aptitude Test 

Math and verbal round .

Round 3 - Group Discussion 

General topics to speak

Round 4 - Technical 

(1 Question)

  • Q1. Duplicates in array College Projects Hashmap implementation
  • Ans. 

    Implement a function to find duplicates in an array of strings using Hashmap.

    • Create a Hashmap to store the frequency of each string in the array

    • Iterate through the array and check if the frequency of any string is greater than 1

    • If yes, add it to the list of duplicates

    • Return the list of duplicates

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Answer what you know, be genuine and honest

Skills evaluated in this interview

I applied via Naukri.com and was interviewed before Jul 2020. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Questions on java8
  • Q2. Questions on multithreading
  • Q3. Questions on exception handling

Interview Preparation Tips

Interview preparation tips for other job seekers - First round was a coding round where interviewer asked questions randomly and were asked to optimise our code. Next round was a technical round where everyone needs to be thorough with their technical skills
Contribute & help others!
anonymous
You can choose to be anonymous

Icertis Interview FAQs

How many rounds are there in Icertis Lead Consultant interview?
Icertis interview process usually has 1 rounds. The most common rounds in the Icertis interview process are One-on-one Round.
How to prepare for Icertis Lead Consultant 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 Analytics, Change Management, Data Analysis, Accounting and Advanced Excel.
What are the top questions asked in Icertis Lead Consultant interview?

Some of the top questions asked at the Icertis Lead Consultant interview -

  1. Difficult situation you faced during implementation st...read more
  2. End-end implementation related questions of Icertis ...read more

Recently Viewed

SALARIES

Cedcoss Technologies

No Salaries

INTERVIEWS

Icertis

No Interviews

REVIEWS

Nucleus Software Exports

No Reviews

REVIEWS

Nucleus Software Exports

No Reviews

REVIEWS

Nucleus Software Exports

No Reviews

REVIEWS

Nucleus Software Exports

No Reviews

REVIEWS

Nucleus Software Exports

No Reviews

COMPANY BENEFITS

Nucleus Software Exports

No Benefits

REVIEWS

Cedcoss Technologies

No Reviews

REVIEWS

Cedcoss Technologies

No Reviews

Tell us how to improve this page.

Icertis Lead Consultant Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Chetu Interview Questions
3.3
 • 173 Interviews
Oracle Cerner Interview Questions
3.7
 • 157 Interviews
AVASOFT Interview Questions
3.7
 • 155 Interviews
ServiceNow Interview Questions
4.1
 • 120 Interviews
Thomson Reuters Interview Questions
4.1
 • 112 Interviews
Amadeus Interview Questions
3.9
 • 107 Interviews
EbixCash Limited Interview Questions
4.0
 • 102 Interviews
SPRINKLR Interview Questions
3.0
 • 100 Interviews
UKG Interview Questions
3.1
 • 100 Interviews
View all
Icertis Lead Consultant Salary
based on 23 salaries
₹16 L/yr - ₹33.2 L/yr
17% more than the average Lead Consultant Salary in India
View more details

Icertis Lead Consultant Reviews and Ratings

based on 6 reviews

2.8/5

Rating in categories

3.4

Skill development

2.5

Work-life balance

3.5

Salary

3.0

Job security

2.9

Company culture

3.0

Promotions

2.7

Work satisfaction

Explore 6 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