Zuddl Senior Software Engineer Interview Questions and Answers

Round duration - 55 Minutes
Round difficulty - Easy

Timing - evening
Interviewer was friendly.

Q1. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
I directly came up with the DFS approach.
Answered Anonymously
Add your answer

Round duration - 55 Minutes
Round difficulty - Easy

Timing - afternoon
Interviewer was friendly

Q1. 
Move Zeroes to End
Given an unsorted array of integers, rearrange the elements such that all the zeroes are moved to the end, while maintaining the order of non-zero elements.
Input:
The first line cont...read more
Ans. 
Thought about 2 pointer technique and solved with that.
Answered Anonymously
Add your answer
Q2. 
Asteroid Collision Problem Description
Given an array/list ASTEROIDS representing asteroids aligned in a row, each element's absolute value identifies the asteroid's size, while its sign indicates the dir...read more
Ans. Stack Based Approach
The idea is to use the stack to maintain the state of the asteroids. If we find an asteroid moving to the left (-ve value), let’s say at index i, then it will collide with an asteroid moving to the right (+ve value) and having index less than i. Hence, we can use a stack to keep track of asteroids moving to the right and then pop the elements from the stack as and when any asteroid gets destroyed.
&n...read more
Answered Anonymously
Add your answer

Round duration - 55 Minutes
Round difficulty - Easy

Timing - evening
interviewer was friendly

Q1. How python dictionary is implemented internally ?
Ans. 
Python dictionary is implemented using hash tables.
• Python dictionary is a collection of key-value pairs.

• The keys in a dictionary must be unique and immutable.

• The values in a dictionary can be of any data type.

• Python dictionary is implemented using hash tables.

• Hash tables provide constant time complexity for insertion, deletion and retrieval of elements.

• The hash function used in Python dictionary is based on the key's h...read more
Answered by AI
Add your answer
Q2. What is heap sort
Ans. 
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
• It divides the input into a sorted and an unsorted region.

• It repeatedly extracts the maximum element from the unsorted region and inserts it into the sorted region.

• It has a time complexity of O(n log n) and is not stable.

• Example: [8, 5, 3, 1, 9, 6, 0, 7, 4, 2] -> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
Answered by AI
Add your answer
Q3. Coding question to sort array based on a custom filter
Add your answer