i
SBS
Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Jun 2023. There were 2 interview rounds.
I am a software engineer with expertise in SDE.
Proficient in programming languages like Java, C++, and Python
Experience in developing and maintaining software applications
Strong problem-solving and analytical skills
Familiarity with software development methodologies like Agile
Ability to work collaboratively in a team environment
Top trending discussions
Function to reverse a given string.
Create an empty string to store the reversed string.
Iterate through the input string in reverse order and append each character to the new string.
Return the reversed string.
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 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
I was interviewed before Jan 2024.
General aptitide test
Basic coding test like DSA
I applied via Job Portal and was interviewed in Nov 2024. There were 2 interview rounds.
July online coding test consists of 3 question pretty medium level
July -economics ,good commumication skill checks
I applied via Company Website and was interviewed before Sep 2021. There were 2 interview rounds.
2 coding questions which are of easy level
I was interviewed in Sep 2016.
Developed a web-based project management tool for a software development company.
Used Agile methodology for development
Implemented features like task assignment, progress tracking, and team collaboration
Integrated with third-party tools like GitHub and Slack
Designed a user-friendly interface with responsive design
Deployed on AWS using EC2 and RDS
My CV showcases my experience in software development, including projects in Java, Python, and web development.
Experience in Java, Python, and web development
Worked on projects involving database management systems
Familiar with Agile development practices
I was interviewed in May 2017.
Developed a web-based project management system for tracking tasks and deadlines.
Used HTML, CSS, JavaScript for front-end development
Implemented backend using Node.js and MongoDB for database management
Incorporated user authentication and authorization features
Utilized Agile methodology for project management
I was interviewed before Jun 2016.
An induction motor can be started by providing a rotating magnetic field.
Use a three-phase power supply to create a rotating magnetic field
The magnetic field induces a current in the rotor, causing it to rotate
The motor may require a starting capacitor or a starting winding to provide the initial torque
Once the motor reaches its rated speed, the starting mechanism can be switched off
I am a passionate software engineer with 5 years of experience in developing web applications using various technologies.
Experienced in full stack web development
Proficient in languages like JavaScript, Python, and Java
Familiar with frameworks like React, Node.js, and Spring Boot
Strong problem-solving and analytical skills
Excellent team player with good communication skills
based on 1 interview
Interview experience
Module Lead
254
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
232
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
174
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Lead
154
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
45
salaries
| ₹0 L/yr - ₹0 L/yr |
Temenos
Finastra
Infosys
Intellect Design Arena