Quizizz Senior Software Engineer Interview Questions and Answers

Core HTML, CSS and JS

JS deep dive and react

Q1. Mimic Promise.all, Array.flat, OTP Component etc
Add your answer

DSA questions asked in an interview

Normal Math Quants, Verbal and Logical ability questions. This round actually comprises of both Aptitude and Coding

Q1. Questions about cloud, What do you understand by cloud ?, What's the importance of it?
Add your answer
Q2. Python coding question - Write a code for Fibonacci series.
Ans. 
Code for Fibonacci series in Python.
• Use a loop to iterate through the series

• Start with 0 and 1 as the first two numbers

• Add the previous two numbers to get the next number

• Repeat until desired number of terms is reached
Answered by AI
Add your answer
Q3. Python conceptual questions
Add your answer
Q4. What is an CIDR block? why is it used ?what is the range of CIDR block?
Ans. 
CIDR block is a method of allocating IP addresses and routing Internet Protocol packets.
• CIDR stands for Classless Inter-Domain Routing.

• It is used to allocate IP addresses and route Internet Protocol packets.

• CIDR block is a combination of an IP address and its associated network mask.

• CIDR notation is used to represent the CIDR block, for example, 192.168.0.0/16.

• The range of CIDR block varies depending on the network mas
Answered by AI
Add your answer
Q5. Introduce yourself in a few lines.
Add your answer

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