Monocept Software Developer Interview Questions and Answers

Easy to medium leetcode questions

Q1. How make a queue using a stack
Ans. 
To implement a queue using a stack, use two stacks and simulate the queue operations.
• Use two stacks, one for enqueue operation and one for dequeue operation.

• For enqueue operation, simply push elements onto the stack used for enqueueing.

• For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.

• Then pop from the dequeue stack to simulate dequeue operation.
Answered by AI
Add your answer
Q2. Create a linked list
Ans. 
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
• Create a Node class with data and next pointer

• Initialize a head pointer to null

• Add nodes by updating next pointers

• Traverse the list by following next pointers
Answered by AI
Add your answer

Coding questions about array and string.

Cosing questions about sql and ds.

Q1. Personal and behavioral questions.
Add your answer

Q1. Data structures algorithms
Add your answer

1 hour online test ..

Q1. Programming related questions.
Add your answer

Q1. DSA round (easy to medium)
Add your answer

Q1. Technical+ hr round
Add your answer

Q1. Technical questions.
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was in the morning around 9:00Am-9:30AM. Platform used for this round was hacerrank. Questions were of moderate to difficult level.

Q1. 
Count Subarrays with Given XOR Problem Statement
You are given an array of integers ARR and an integer X. Your task is to determine the number of subarrays of ARR whose bitwise XOR is equal to X.
Example...read more
Ans. 
Count the number of subarrays in an array whose XOR is equal to a given value.
• Iterate through the array and keep track of XOR values and their frequencies using a hashmap.

• For each element in the array, calculate the XOR value with all previous elements and check if it equals the given XOR value.

• Use the concept of XOR to efficiently solve the problem.

• Handle edge cases like XOR value being 0 separately.

• Time complexity ca...read more
Answered by AI
Add your answer
Q2. 
Distinct Characters Problem Statement
Given a string STR, return all possible non-empty subsequences with distinct characters. The order of the strings returned is not important.
Example:
Input:
STR = ...read more
Ans. 
Return all possible non-empty subsequences with distinct characters from a given string.
• Iterate through all possible subsequences of the input string

• Check for distinct characters in each subsequence

• Return the distinct character subsequences as an array of strings
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was in the night around 8:00PM-8:20PM. Interviewer was very calm in questioning. Platform used for this round was Skype and the questions focused more on personality rather than total.