XpressBees Software Developer Intern Interview Questions and Answers

5 MCQ questions, and 1 coding question similar to Leetcode medium-hard level (topic-greedy).

Q1. Basic DSA questions related to strings, linkedlists, binary search etc.
Add your answer
Q2. Questions related to resume
Add your answer

1 hr , 3 sum leetcode question

Q1. It consist of general introduction and then a simple coding question
Add your answer

Q1. This round was HR +technical
Add your answer
Q2. Ask about project and the HR type questions like facing problem in the project and dealing with that
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Timing was 11 am. Platform was quite well.

Q1. Rat in a Maze
You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a...read more
Ans. Bactracking
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
 
Algorithm is as follows:
 
1. Take the starting position of th...read more
Answered by CodingNinjas
Add your answer
Q2. Minimum Cost to Destination
You have been given an N*M matrix where there are 'N' rows and 'M' columns filled with '0s' and '1s'.


'1' means you can use the cell,...read more
Ans. Backtracking
Maintain a visited array and try to explore all the possibilities with the help of backtracking.
1. Start with (0, 0) and mark it as visited and try to move in all 4 directions.
2. Say at any point we are at (i, j) then the cost of reaching (x,y) will be the minimum of these four cases.
   1. Option 1 -  Left: cost of reaching from (i, j-1)
   2. Option 2 - Right: cost of reaching from (i, j+1)
   3. Option 3 - Up: 1 + cost of rea...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 90 mintues
Round difficulty - Easy

Timing it is around 11 am and Environment is good .

Q1. Reverse Stack Using Recursion
Reverse a given stack of integers using recursion.
Note:
You are not allowed to use any extra space other than the internal stack space used due to recursion.
You are not a...read more
Ans. Recursive Approach
We will be using two recursive methods:
1. To Reverse the Stack: We will use recursion to iterate through the stack. For each top element, we will pop it and use recursion to reverse the remaining stack. After getting the stack reversed by recursion we can simply push the popped element to the bottom of the stack. The procedure to push the element at the bottom of stack is explained in following paragraph...read more
Answered by CodingNinjas
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Environment was very friendly but questions asked are very hard.

Q1. Maximum subarray
Ninjas has been given an array. He wants to find a subarray such that the sum of all elements in the subarray is maximum.
Subarray 'A' is greater than sub-array 'B' if su...read more
Ans. Brute Force Approach
Our Brute force approach will figure out all the possible combinations possible. To find a subarray, we need to know both the starting point and the ending out of the array. We can make a loop that would iterate through the array. During each iteration, we will make another nested loop inside which will take all possible combinations where the starting index will be the pointer of the parent loop an...read more
Answered by CodingNinjas
View 1 more answer
Q2. Intersection of Linked List
You are given two Singly Linked List of integers, which are merging at some node of a third linked list.
Your task is to find the data of the node at which merging starts. If ...read more
Ans. Brute Force
• For each node in the first list, traverse the entire second list
• Check if any node in the second list coincides with the first list
  • If it does, return that node’s data
  • If it doesn’t, return -1
Space Complexity: O(1)Explanation:
O(1)
 
Since we only use constant space.
Time Complexity: O(m*n) - For 2d arraysExplanation:
O(N * M), where N and M are the lengths of the first and second linked lists respectively.&n...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 75 minutes
Round difficulty - Easy

Simple question based on strings was given. MCQs based on basic aptitude and programming questions were asked. 
Tips: Time management is important. Remember all the syntaxes

Q1. Reverse the String
You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.
For example:
 If the given string is: STR...read more
Ans. 
This can be done by iterative swapping using two pointers. The first pointer points to the beginning of the string, whereas the second pointer points to the end. Both pointers keep swapping their elements and go towards each other. Essentially, the algorithm simulates the rotation of a string with respect to its midpoint.
Time Complexity : O(n)
Answered by CodingNinjas
View 1 more answer

Round duration - 60 minutes
Round difficulty - Easy

It was a good experience.
Tips: If you don't know something just tell them. Don't try to answer something if you don't know anything about it

Q1. One Away
You are given two strings, string A and string B. Your task is to determine whether string A can be transformed into string B by performing only one of the following operations at most one (or may...read more
Ans. 
The idea is to create a new character array and copy the characters from the original String before the given position
After that, we put the new character at the position and copy the rest of the characters from the original String in the subsequent positions of the new array.
Other option can be to directly use the already defined methods such as insert().
Answered by CodingNinjas
View 2 more answers
Q2. Remove Duplicates From String
You are given a string (STR) of length N, consisting of only the lower case English alphabet.
Your task is to remove all the duplicate occurrences of characters in the strin...read more
Ans. 
Hashing can be used to approach this problem.
Use a hash map and maintain count of the occurrences of all the characters in the string which character as the string and count as the value. At last, traverse the hash map and print all those characters with count > 1. 
Time Complexity : O(N) where N is the length of the string
Space Complexity : O(N)
Answered by CodingNinjas
View 3 more answers

Round duration - 30 minutes
Round difficulty - Easy

It was easy. I could answer the first question. Second one I answered really badly

Q1. Basic HR Questions
Q1. Explain the projects that I've done
Q2. What did you learn about PayPal today?
Q3. Why join PayPal?
Ans. 
Tip 1 : Explain the projects done in the best possible way
Tip 2 : Get to know about the company as much as possible via seniors
Answered by CodingNinjas
Add your answer

Q1. Java questions were asked by them
Add your answer
Q2. Python were asked by them
Add your answer

Q1. Location preferences were asked by them
Add your answer
Q2. Future what u wanna do was asked by them
Add your answer