i
embedUR Systems
Filter interviews by
Clear (1)
I applied via Campus Placement
Technical GD question on OS DBMS
I was interviewed in Jan 2025.
Aptitude was average ,,, logical reasoning and logical aptitude was quite difficult ,, it take time to ready question and understand it
What is semphore in os, Roundrobin algo, binary tree vs binarysearch tree, dfs vs bfs,
the topic are only from your syllabus,,, make sure it go through it once ,,,
Top trending discussions
I applied via Campus Placement and was interviewed before Jun 2023. There were 3 interview rounds.
60 minutes of coding round with medium level of question asked
Coding and Aptitude MCQ questions
Designing a login system for clients involves creating secure authentication methods and user management.
Implement secure password hashing algorithms like bcrypt to store passwords securely.
Use HTTPS to encrypt data transmission between client and server.
Implement multi-factor authentication for added security.
Utilize session management to keep track of user login status.
Consider implementing account lockout mechanisms
Foreign key is a key used to link two tables in a database, enforcing referential integrity.
Foreign key is a column or a set of columns in one table that references the primary key in another table.
It ensures that the values in the foreign key column(s) match the values in the primary key column of the referenced table.
Foreign key constraints help maintain data integrity by preventing actions that would destroy links b...
I applied via Campus Placement and was interviewed before Aug 2023. There were 4 interview rounds.
Basic Aptitude test, it was easy
Questions on array medium level
I am a software engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
5 years of experience in software development
Proficient in Java, Spring, and Angular
Strong problem-solving skills
Team player with excellent communication skills
I see myself continuing to grow and develop my skills in a challenging and rewarding role.
Continuing to learn new technologies and stay updated with industry trends
Taking on more responsibilities and leadership roles
Contributing to the success and growth of the company
Striving for personal and professional growth
The shortest distance between two farthest vertices in a cubical room is the length of the diagonal of the cube.
The diagonal of a cube can be calculated using the formula: sqrt(3) * side length
In a cube with side length 1 unit, the diagonal length is sqrt(3) units
Therefore, the shortest distance between two farthest vertices in a cubical room is sqrt(3) times the side length of the cube
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
Learn about techstack
I applied via LinkedIn and was interviewed in Feb 2024. There was 1 interview round.
I am a software engineer with 5 years of experience in developing web applications using Java, Spring Boot, and Angular.
5 years of experience in software development
Proficient in Java, Spring Boot, and Angular
Strong problem-solving skills
Experience working in Agile development environment
Annotations in Spring Boot are used to provide metadata about the application's components, helping Spring to understand how to manage them.
Annotations are used to configure Spring Boot components such as controllers, services, repositories, etc.
Annotations help Spring Boot to automatically detect and configure beans based on the annotations used.
Examples of annotations in Spring Boot include @RestController, @Service,
I applied via LinkedIn and was interviewed in May 2024. There were 3 interview rounds.
Lit bit tougher as a beginner for quants like aptitude, verbal, and reasoning.
They given 40 min for coding and , topics are below linked list , stacks
They given 30 min for coding in topics of linked list , stacks
I was interviewed in Apr 2022.
Round duration - 180 minutes
Round difficulty - Hard
There was 1 round of 180 minutes which contains of 3 questions from DSA. the two question was of medium level but one question is of neither difficult nor medium level question based on tree
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to keep track of the longest increasing subsequence ending at each element.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the ar...
Check whether a given graph is bipartite or not. Return true
if the graph's vertices can be divided into two independent sets, ‘U’ and ‘V’, such that every edge (‘u’, ‘v’) either c...
Check if a given graph is bipartite by dividing vertices into two independent sets.
Use BFS or DFS to traverse the graph and assign colors to vertices to check for bipartiteness.
If an edge connects vertices of the same color, the graph is not bipartite.
Return true if all edges connect vertices of different colors, else return false.
Given an integer array ARR
of size N
containing all distinct values, determine the total number of inversions present in the array.
An inversion is defined for a pair o...
Count the total number of inversions in an integer array.
Iterate through the array and for each pair of elements, check if the conditions for inversion are met.
Use a nested loop to compare each element with all elements to its right.
Keep a count of the inversions found and return the total count at the end.
Round duration - 50 minutes
Round difficulty - Medium
In interview I was asked about some question related to Data structures , DBMS . Some output based question was asked and 2 coding problems was given to solve.
Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.
A subset of an array 'ARR' is a tupl...
Given an array and an integer, return all subsets that sum to the given integer.
Use backtracking to generate all possible subsets of the array.
For each subset, check if the sum equals the given integer 'K'.
Print the subsets that satisfy the condition.
Example: For input [1, 2, 3] and K=3, subsets [1, 2] and [3] have sum 3.
Given a binary tree of integers, your task is to print the boundary nodes of the binary tree in an anti-clockwise direction starting from the root node.
The boundary...
Boundary traversal of a binary tree in anti-clockwise direction starting from the root node.
Implement a function to calculate the boundary traversal of a binary tree
Include nodes from left boundary, leaf nodes, and right boundary in sequence
Ensure only unique nodes are included in the output
Print the boundary nodes separated by single spaces for each test case
Tip 1 - Practice At least 250 Questions of DS algo
Tip 2 - Do at least 2 application based projects
Tip 3 - Practice questions with optimized approaches
Tip 1 : Have some application based projects on resume.
Tip 2 : Do not put false things on resume.
Tip 3 : Project should clear and crisp
based on 2 interviews
Interview experience
Software Engineer
92
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
88
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Softwaretest Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Sasken
Mindteck
Persistent Systems
L&T Technology Services