CareerLabs SDE (Software Development Engineer) Interview Questions and Answers

Q1. Projects you have done
Add your answer
Q2. Scenario based questions
Add your answer

Q1. Why you want to join
Add your answer
Q2. Salary negotiation
Add your answer

Q1. DSA question from Bit Manipulation Topic, Easy Level
Add your answer
Q2. DSA question from string can be solved using priority queue, Medium Level
Add your answer

Q1. Impliment comment box using ReactJs
Add your answer

3 coding questions any programming language

Q1. Technical Interview based on your programming skills
Add your answer
Q2. 1.Find the possible permutation of the given string 2. Remove 3 from the given input (Number) and input should be taken from the user 3. Check whether the given string is Anagram without using map DATA s...read more
Ans. 
Answering questions related to string permutations, removing numbers, and checking for anagrams without using map data structure.
• To find permutations of a string, use recursion to swap characters at each position.

• To remove a specific character (e.g. '3') from a string, iterate through the string and build a new string without the character.

• To check for anagrams without using a map data structure, sort both strings and
Answered by AI
Add your answer

Q1. Introduce yourself and are you willing to relocate And salary discussion. That's it
Add your answer

Q1. What is latest technology you have worked on
Ans. 
I have worked on React Native for mobile app development.
• Developed a mobile app for a client using React Native

• Used Redux for state management

• Integrated with Firebase for real-time database and authentication

• Implemented push notifications using Firebase Cloud Messaging
Answered by AI
Add your answer

Q1. Why you want to join us
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. Path Queries
You are given a weighted, undirected graph with ‘V’ vertices numbered from 1 to ‘V’ and ‘E’ bidirectional edges.
You have to answer ‘Q’ queries. Every query has two integers, ‘u’, ‘v’, repre...read more
Ans. Dijkstra Algorithm
We will run Dijkstra Algorithm for all vertices in this approach and store the minimum distance in an array. Then we can answer the queries using this distance array.
 
Dijkstra Algorithm is one of the most popular algorithms in graph theory. A single-source shortest path algorithm gives the shortest path length to all vertices from a given vertex known as the source vertex. It is a greedy algorith...read more
Answered Anonymously
Add your answer
Q2.  Merge Sort
Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.
Example :
Merge Sort Algorithm -

Merge so...read more
Ans. Recursion
The basic idea is that we divide the given ‘ARR’ into two-part call them ‘leftHalves’ and ‘rightHalves’ and call the same function again with both the parts. In the end, we will get sorted ‘leftHaves’ and sorted ‘righthalves’ which we merge both of them and return a merged sorted ‘ARR’.
We implement this approach with a divide and conquer strategy.
 
Here is the algorithm : 
 
1. Divide ‘ARR’ into two-p...read more
Answered Anonymously
Add your answer
Q3. Rat In a Maze: All Paths
You are given a 'N' * 'N' maze with a rat placed at 'MAZE[0][0]'. Find and print all paths that rat can follow to reach its destination i.e. 'MAZE['...read more
Ans. Backtracking Approach
Initialize, all the cells of the solution matrix used to print the path matrix to 0. First, you cannot make use of the existing maze to print the solution maze as you have to distinguish b/w 1 of maze or 1 of ‘SOLUTION matrix.
 
Form a recursive function, which will follow a path and check if the path reaches the destination or not. If the path does not reach the destination then backtrack and t...read more
Answered Anonymously
Add your answer

Q1. Find duplicates in an array
Ans. 
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.
Answered by AI
Add your answer
Q2. Find single duplicate element in an array where contents of the array are length of array - 1
Ans. 
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.
Answered by AI
Add your answer

Create a student support system

Q1. Design an order and payments system for an EdTech company
Ans. 
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
Answered by AI
Add your answer

Both Aptitude and coding

Q1. Basic Java questions
Add your answer

Q1. Salary discussion only
Add your answer