ZapCom Group Senior Software Developer Interview Questions and Answers

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

Q1. Given the react machine coding example
Add your answer

Q1. Explain about your projects
Add your answer

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 Rount
DSA Round + Puzzle
SQL + Project Discussion
JS

Dsa problems dp and tress problem

Q1. Tell me about your self
Add your answer
Q2. Projects and intership
Add your answer

Q1. About the project. and asked what i did in project. how to create schema in pyspark. what is ADE. what are the difficulties i faced in project. what is spark submit command how we write sparksubmit command...read more
Add your answer
Q2. No of occurrences of letter in a string.
Ans. 
Count occurrences of a letter in a string.
• Iterate through each character in the string and count occurrences of the specified letter.

• Use a hashmap to store the count of each letter.

• Handle both uppercase and lowercase letters to ensure accurate counting.
Answered by AI
Add your answer

Question based on array string linkedlist