i
Icertis
Filter interviews by
I applied via Naukri.com and was interviewed in May 2024. There were 3 interview rounds.
I am a dedicated and experienced professional with a background in managing service teams and delivering exceptional results.
Over 5 years of experience in managing professional services teams
Proven track record of exceeding client expectations and achieving project goals
Strong leadership skills and ability to motivate team members
Excellent communication and problem-solving skills
Bachelor's degree in Business Administra
Seeking new challenges and opportunities for growth in a dynamic environment.
Desire for professional growth and development
Seeking new challenges and opportunities
Interested in working in a dynamic environment
The role of Manager - Professional Services involves overseeing the delivery of services to clients, managing a team of professionals, and ensuring customer satisfaction.
Leading a team of professionals to deliver high-quality services to clients
Developing and implementing strategies to improve service delivery and customer satisfaction
Collaborating with other departments to ensure seamless service delivery
Monitoring an...
Top trending discussions
I applied via Naukri.com and was interviewed in Feb 2021. There were 3 interview rounds.
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
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
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
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
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
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
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
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.
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.
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.
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
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).
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
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.
posted on 16 May 2022
I applied via LinkedIn and was interviewed before May 2021. There were 2 interview rounds.
It was a hacker rank technical + aptitude test
I applied via Naukri.com and was interviewed before Jul 2020. There were 4 interview rounds.
posted on 8 Apr 2022
I applied via Naukri.com and was interviewed before Apr 2021. There were 3 interview rounds.
Aptitude test will a hackerrank test where it might have technical MCQ and/or coding test.
I applied via Company Website and was interviewed before Jun 2020. There were 5 interview rounds.
I applied via Recruitment Consultant and was interviewed in May 2019. There were 4 interview rounds.
based on 1 interview
Interview experience
Functional Consultant
292
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Functional Consultant
237
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
234
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
225
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Software Engineer
166
salaries
| ₹0 L/yr - ₹0 L/yr |
Apttus
Zycus Infotech
SirionLabs
SAP Ariba