i
uCertify
Filter interviews by
I applied via Campus Placement and was interviewed in Jan 2023. There were 7 interview rounds.
There were 4 coding rounds first was mainly from from both javascript htm css api and php.
2nd round was html and css coding test on there website.
3 round was javascript coding round on their website.
4 th round was the pho round on their website.
I applied via Naukri.com and was interviewed before Aug 2022. There were 2 interview rounds.
ITIL (Information Technology Infrastructure Library) is a set of best practices for IT service management.
ITIL is a framework that outlines processes, tasks, and checklists for managing IT services.
It focuses on aligning IT services with the needs of the business and improving efficiency.
ITIL processes include incident management, problem management, change management, and more.
ITIL helps organizations deliver value to...
I applied via Campus Placement and was interviewed in Jul 2021. There were 4 interview rounds.
I was interviewed in Nov 2020.
Round duration - 120min
Round difficulty - Easy
Semaphores are synchronization primitives used to control access to shared resources in a multi-threaded environment.
Semaphores can be used to limit the number of threads accessing a resource simultaneously.
They can be binary (mutex) or counting semaphores.
Operations on semaphores include wait (P) and signal (V).
Example: In a producer-consumer problem, semaphores can be used to control access to a shared buffer.
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...
Check if a given graph can be colored using two colors without adjacent vertices sharing the same color.
Use graph coloring algorithm like BFS or DFS to check if adjacent vertices can be colored with different colors.
If there are odd cycles in the graph, it is not possible to color the graph with two colors.
If the graph is bipartite, it is always possible to color the graph with two colors.
Example: For the input 5 4, 1
Round duration - 50 minutes
Round difficulty - Easy
You are given a matrix 'A' of size 'N' x 'M', where each cell contains the height of water placed in that cell. Water can flow in four directions: up, down, left, and right, b...
Find coordinates from which water can flow to both the Pacific and Atlantic Oceans in a given matrix of water heights.
Create a function that takes in the matrix 'A' and its dimensions 'N' and 'M'.
Implement a depth-first search (DFS) algorithm to find all coordinates from which water can flow to both oceans.
Keep track of visited cells and use two separate DFS calls to find coordinates for each ocean.
Sort and return the
Round duration - 10 minutes
Round difficulty - Easy
Tip 1 : Study and work hard. Work hard work hard. Always work hard. Practice Atleast 250 questions
Tip 2 : Solve at least 2 projects.
Tip 1 : Have strong projects on your resume
Tip 2 : Be yourself always.
uCertify interview questions for popular designations
I was interviewed before Nov 2020.
Round duration - 50 minutes
Round difficulty - Easy
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
Iterate through the buildings and create a list of critical points (x, y) where the height changes.
Sort the critical points based on x-coordinate and process them to form the skyline.
Merge consecutive horizontal segments of equal height to ensure no duplicates in the output.
Given a string STR
containing both lowercase and uppercase letters, the task is to sort the string so that the resulting string contains uppercase and lower...
Sort a string with alternate lowercase and uppercase letters in sorted order.
Split the string into lowercase and uppercase letters.
Sort the lowercase and uppercase letters separately.
Merge the sorted lowercase and uppercase letters alternately.
Round duration - 15 Minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
The first line contains an...
Check if given strings containing parentheses are balanced or not.
Use a stack to keep track of opening parentheses
Iterate through the string and push opening parentheses onto the stack
When a closing parenthesis is encountered, pop from the stack and check if it matches the corresponding opening parenthesis
If stack is empty at the end and all parentheses are matched, the string is balanced
If stack is not empty or mismat...
Round duration - 15 minutes
Round difficulty - Easy
Tip 1 : Practice as many as topics u can
Tip 2 : practice important questions asked in company by seeing reviews
Tip 1 : have some projects and internships in your resume
Tip 2 : Skills related to position
I was interviewed before Sep 2016.
I applied via Recruitment Consultant and was interviewed before Sep 2018. There were 4 interview rounds.
based on 2 interviews
Interview experience
based on 83 reviews
Rating in categories
Accounts Manager
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Application Developer
14
salaries
| ₹0 L/yr - ₹0 L/yr |
SME
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Inside Sales Executive
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Web Developer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Simplilearn
upGrad
MeritNation
BYJU'S