i
uCertify
Filter interviews by
I appeared for an interview 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.
Top trending discussions
posted on 19 Oct 2017
I appeared for an interview before Mar 2024, where I was asked the following questions.
Basic Aptitude test
Coding Round is little tough.
I applied via Approached by Company and was interviewed before Apr 2023. There were 2 interview rounds.
They will give you problem to solve
Machine coding round
I appeared for an interview in Mar 2021.
Round duration - 45 minutes
Round difficulty - Medium
Timing (10 am- 11 am)
For this round I had slightly more time than the last, due to the fact that the weekend fell in between.The interviewer was very very cool and helping this time, something which I kept at the last in my list of probable things that can happen during an interview. Duration of this round was around 45 minutes.
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...
Connect ropes with minimum cost by merging smallest ropes first.
Sort the array of rope lengths in ascending order.
Merge the two smallest ropes at each step to minimize cost.
Keep track of the total cost as you merge the ropes.
Repeat the merging process until all ropes are connected.
Return the total cost as the minimum cost to connect all ropes.
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
A Binary Search Tr...
Validate if a given binary tree is a Binary Search Tree (BST) or not.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Check if the right subtree of a node contains only nodes with data greater than the node's data.
Recursively check if both the left and right subtrees are also binary search trees.
Round duration - 30 minutes
Round difficulty - Medium
This round was on call where I was just supposed to answer the HRquestions that were asked. It started with a brief interview with one another and then moved to questions on DBMS, operating systems, computer networks and all. Almost 10-15 questions were asked and I probably answered 90% of them correctly.
Tip 1 : practice on gfg and coding ninjas
Tip 2 : compete in online coding contests
Tip 3 : learn DSA and practice regularly from GFG or leetcode
Tip 1 : put your entire valuable experience in brief
Tip 2 : put the handle of you competitive coding profiles
I applied via Naukri.com and was interviewed before Oct 2022. There were 4 interview rounds.
Implement login with Google SSO, show emails in a single place
JWT can be implemented by generating a token with user information and a secret key, then verifying the token using the same secret key.
Generate a JWT token with user information and a secret key
Include necessary claims like expiration time, issuer, etc.
Verify the JWT token using the same secret key
Handle token expiration and refresh if needed
Middleware in Express is a function that has access to the request and response objects.
Create a middleware function using app.use() method in Express.
Middleware functions have access to the request object (req), the response object (res), and the next middleware function in the application's request-response cycle.
Example: app.use((req, res, next) => { console.log('This is a middleware function'); next(); });
Lazy loading in Angular delays loading of modules until they are needed
Lazy loading helps improve performance by only loading modules when they are required
It is achieved by using the loadChildren property in the route configuration
Lazy loaded modules are loaded asynchronously when the user navigates to the corresponding route
Server-side rendering (SSR) in Angular can be enabled by using Angular Universal.
Install Angular Universal using Angular CLI
Create a new Angular Universal project
Update app.module.ts to include server-side rendering
Build and run the Angular Universal project
I applied via Referral and was interviewed before Oct 2023. There were 3 interview rounds.
Use a hash set to find duplicates in an array of strings.
Create a hash set to store unique elements.
Iterate through the array and check if the element is already in the hash set.
If it is, then it is a duplicate. If not, add it to the hash set.
Find the single duplicate element in an array of strings with length n-1.
Iterate through the array and use a HashSet to keep track of elements seen so far.
If an element is already in the HashSet, that is the duplicate element.
Return the duplicate element once found.
Create a student support system
Design an order and payments system for an EdTech company
Allow users to browse and select courses
Implement a shopping cart for users to add courses
Integrate payment gateways for secure transactions
Provide order confirmation and receipt to users
Allow users to track their order status
I applied via Company Website and was interviewed before Nov 2022. There were 4 interview rounds.
3 questions in 3 hr, topics were Dp, Strings, Tree
1hr durations 40 questions, main topics were patterns, profit loss, work man , etc.
I applied via Naukri.com and was interviewed in Jul 2022. There were 3 interview rounds.
It was on hacker rank
It was a aptitude test taken by me of the new and all the response and the of new
Accounts Manager
21
salaries
| ₹2 L/yr - ₹6 L/yr |
Application Developer
14
salaries
| ₹3.6 L/yr - ₹6.5 L/yr |
SME
12
salaries
| ₹4 L/yr - ₹5 L/yr |
Inside Sales Executive
9
salaries
| ₹2.9 L/yr - ₹4.5 L/yr |
Web Developer
9
salaries
| ₹3 L/yr - ₹4.5 L/yr |
Acadecraft
Coding Ninjas
Internshala
Globus Infocom