uCertify Interview Questions, Process, and Tips

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.

Q1. In this round the hr asked for personel information and project discussion mainly.
Add your answer

Q1. In this round the hr took deep dive into my projects and asked more about projects and technical skills.
Add your answer

Q1. Tell me about your About project manager skills
Add your answer
Q2. What is ITIL PROCESS
Ans. 
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...read more
Answered by AI
Add your answer

Round duration - 120min
Round difficulty - Easy

Q1. What are semaphores?
Add your answer
Q2. 
Graph Coloring Problem
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...read more
Ans. DFS
We can approach this problem by running a DFS starting from vertex-1.
We have a total of ‘m’ edges.
When can we achieve the configuration when we see in reference to vertex-1? 
1. Let's say vertex-1 is ‘Blue’
   1. If all the vertices that connect to vertex-1 are ‘Red’, then we can say that the configuration is possible.
2. If this would be the negation of the last one. Say, vertex-1 is ‘Red’
   1. If all the vertices that connect to ...read more
Answered Anonymously
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

Q1. 
Water Flow Problem Statement
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...read more
Ans. Brute force, DFS
• We will run two nested loops to traverse each cell of the matrix.
• For each cell, we perform DFS in which we go to all adjacent neighbours having their height lower than the current cell.
• We take two boolean variables to mark the reachability of that cell to the ocean. If we somehow reach any of the ocean we mark the corresponding boolean variable to be true.
• In the end, if both of the boolean variables are...read more
Answered Anonymously
Add your answer

Round duration - 10 minutes
Round difficulty - Easy

Q1. Can you tell us about yourself and your projects?
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

Q1. 
The Skyline Problem
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 ...read more
Ans. Brute Force
The idea here is to first, sort the critical POINTS with respect to their coordinate and height pairs. Make a pair of 'X1' and take a negative of the height for the building so that 'X1' pairs are sorted before 'X2' pairs. Create a dictionary keeping the heights as keys and as soon as a left edge of a building is encountered, we add that building to the dictionary with its height as the key. When we encounte...read more
Answered Anonymously
Add your answer
Q2. 
Sort String with Alternate Lower and Upper Case
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...read more
Ans. Brute Force Approach
• We will solve this problem by taking two arrays, ‘upCount’ and ‘lowCount’ of size ‘26’ that will store the count of uppercase and lowercase letters.
• We will traverse the given string and increment its count corresponding to its value.
• Now, ‘upCount’ and ‘lowCount’ will store the count of uppercase and lowercase letters in sorted order, but there will be some characters whose count is ‘0’, i.e., the ch...read more
Answered Anonymously
Add your answer

Round duration - 15 Minutes
Round difficulty - Easy

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Valid Parentheses Problem Statement
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
Input:
The first line contains an...read more
Ans. Valid Parenthesis
Make use of the stack. Traverse the string and push the current character in the stack if it is an opening brace else pop from the stack If it is the corresponding starting brace for current closing brace then move to the next character of the string otherwise return false.
 
If after complete traversal if the stack is empty then the string is balanced else it is not balanced.
 
Pseudo Code:
• Decla...read more
Answered Anonymously
Add your answer

Round duration - 15 minutes
Round difficulty - Easy