24/7 Customer Software Developer Interview Questions, Process, and Tips

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.

Q1. Reverse words in a string
You are given a string of length N. You need to reverse the string word by word. There can be multiple spaces between two words and there can be leading or trailing spaces but in ...read more
Ans. 
Steps :
1. Initially, reverse the individual words of the given string one by one. 
2. Reverse the whole string from start to end to get the desired output
Answered by CodingNinjas
View 2 more answers
Q2. Reverse a stack
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 allowed to use ...read more
Ans. 
Recursion can be used to reverse a stack. In this approach, we pop the top element from the given stack and recursively call another instance of the same function. When this child function returns to the parent function, append the popped element to the bottom of the stack. For this, two recursive functions can be used: reverseStack() and insertAtBottom(). 

reverseStack():
It checks if the stack is empty or not. The...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.

Q1. Convert a Binary Tree to its Mirror Tree
Given a binary tree, convert this binary tree into its mirror tree.
A binary tree is a tree in which each parent node has at most two children.
Mirror of a Tree...read more
Ans. 
This can be solved using recursion. 
Steps :
(1) Call Mirror for left-subtree i.e., Mirror(left-subtree)
(2) Call Mirror for right-subtree i.e., Mirror(right-subtree)
(3) Swap left and right subtrees.
temp = left->subtree
left->subtree = right->subtree
right->subtree = temp

Worst-case Time complexity is O(n) 
Auxiliary space complexity : O(h) where h is the height of the tree.
Answered by CodingNinjas
View 2 more answers
Q2. Delete Nth node from end of Linked List
You have been given a singly Linked List of 'N' nodes with integer data and an integer 'K'. Your task is to remove the Kth node from the end of the g...read more
Ans. 
Intuition:
Lets K be the total nodes in the linked list.
Observation : The Nth node from the end is (K-N+1)th node from the beginning.
So the problem simplifies down to that we have to find (K-N+1)th node from the beginning.

One way of doing it is to find the length (K) of the linked list in one pass and then in the second pass move (K-N+1) step from the beginning to reach the Nth node from the end.
To do it in one pass. Le...read more
Answered by CodingNinjas
View 3 more answers

Round duration - 30 minutes
Round difficulty - Easy

Typical Managerial round.

Q1. Basic HR Questions
1. Behavioral questions like why are you leaving current company?
2. Why 24*7?
3. What technologies do you want to learns and work on etc ?

 
Ans. 
Tip 1 : The cross questioning can go intense some time, think before you speak.

Tip 2 : Be open minded and answer whatever you are thinking, in these rounds I feel it is important to have opinion.

Tip 3 : Context of questions can be switched, pay attention to the details. It is okay to ask questions in these round, like what are the projects currently the company is investing, which team you are mentoring. How all is the
Answered by CodingNinjas
Add your answer