Filter interviews by
I applied via Naukri.com and was interviewed before Jul 2022. There were 3 interview rounds.
Design of the brochure and ideation of UI UX design
Top trending discussions
posted on 14 Sep 2021
I applied via LinkedIn and was interviewed in Aug 2021. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Aug 2022. There were 4 interview rounds.
2 coding questions with aptitude question(logical aptitude and quantitative aptitude)
This was a Machine Coding. We need to design a system and then they will check our design by running test cases. It was 2.5 hrs long.
Basic coding and MySQL queries. Like Types of join, having and where difference etc.
I appeared for an interview in Nov 2020.
Round duration - 60 minutes
Round difficulty - Easy
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...
Implement a function to find the shortest distance between two vertices in a weighted, undirected graph.
Use Dijkstra's algorithm to find the shortest path between the given vertices.
Create a graph data structure to represent the weighted, undirected graph.
Handle cases where no path exists between the given vertices by returning -1.
Optimize the algorithm to handle multiple queries efficiently.
Consider edge cases such as...
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Merge Sort is a divide-an...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively
Sort the two halves separately
Merge the sorted halves to produce a fully sorted array
Time complexity of Merge Sort is O(n log n)
Example: Input - [5, 2, 9, 1, 5], Output - [1, 2, 5, 5, 9]
You are provided with an N * N
maze where a rat is positioned at starting cell MAZE[0][0]
. The goal is to determine and print all possible paths that the rat can take to r...
Given an N * N maze with binary values, find and print all possible paths for a rat to reach the destination cell.
Use backtracking to explore all possible paths from the starting cell to the destination cell.
At each cell, check if it is a valid move (within bounds and not blocked), then recursively explore all four directions.
Keep track of the path taken so far and mark the cells accordingly.
Once the destination cell i...
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
I applied via Naukri.com and was interviewed in Sep 2022. There were 3 interview rounds.
Basic coding maths aptitude java python communication skills test
Java coding c plus python SQL oracle dbmsos
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 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 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
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Apprentice Engineer
43
salaries
| ₹3.5 L/yr - ₹5.1 L/yr |
Software Engineer
38
salaries
| ₹2.8 L/yr - ₹6.5 L/yr |
Software Developer
25
salaries
| ₹2.4 L/yr - ₹6.1 L/yr |
Full Stack Developer
12
salaries
| ₹1.2 L/yr - ₹5 L/yr |
Java Developer
9
salaries
| ₹4 L/yr - ₹5.5 L/yr |
FastInfo
Testbook.com
Lido Learning
Acadecraft