i
Quizizz
Filter interviews by
I applied via Internshala and was interviewed in Apr 2024. There were 2 interview rounds.
Preparing solutions for middle grad math problems
I was interviewed in Feb 2025.
I was interviewed in Dec 2024.
It was a leetcode medium
It was a leetcode medium
Quizizz interview questions for popular designations
SQL Questions, metric definitions and inference generation
I applied via Campus Placement and was interviewed in Nov 2023. There were 4 interview rounds.
Two codes on hackerrank
5 codes on hackerrank
I was interviewed in Apr 2022.
Round duration - 55 Minutes
Round difficulty - Easy
Timing - evening
Interviewer was friendly.
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...
Count the number of islands in a 2D matrix of 1s and 0s.
Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.
Mark visited cells to avoid redundant calculations.
Increment island count whenever a new island is encountered.
Round duration - 55 Minutes
Round difficulty - Easy
Timing - afternoon
Interviewer was friendly
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.
The first line cont...
Given an unsorted array of integers, move all zeroes to the end while maintaining the order of non-zero elements.
Iterate through the array and maintain two pointers, one for the current position and one for the position to swap with.
If the current element is non-zero, swap it with the element at the swap pointer and increment the swap pointer.
After iterating through the array, fill the remaining positions with zeroes.
E...
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...
Determine the state of asteroids after collisions occur in a row.
Iterate through the array of asteroids and simulate collisions between adjacent asteroids moving in opposite directions.
If two asteroids collide, the larger one survives while the smaller one is destroyed.
Continue this process until no more collisions can occur.
Return the array of remaining asteroids after all collisions have been resolved.
Round duration - 55 Minutes
Round difficulty - Easy
Timing - evening
interviewer was friendly
Tip 1 : Practice DSA/Algorithms.
Tip 2 : Practice LLD and OOPs concepts. Also, do check how data models/database schema should be.
Tip 3 : Practice System Design from the Alex Xu - System Design Interview book.
Tip 1 : Do not put false things on your resume.
Tip 2 : Should know your resume in and out.
I was interviewed before Jun 2023.
Case study showcase from previous work experience
Whiteboarding session
Discussion about case studies
I applied via Approached by Company and was interviewed before Sep 2021. There were 2 interview rounds.
I applied via Company Website and was interviewed before Mar 2020. There was 1 interview round.
Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Start from the first element and compare it with the next element
If the first element is greater than the next element, swap them
Repeat this process for all elements in the list
Continue this process until no more swaps are needed
A Turing Machine is a theoretical device that can simulate any algorithmic computation.
It was proposed by Alan Turing in 1936 as a model for computation.
It consists of a tape, a head that can read and write symbols on the tape, and a set of rules for transitioning between states.
It can simulate any algorithmic computation, making it a powerful tool for theoretical computer science.
It is often used as a theoretical basi...
A hash function is a mathematical function that converts input data of arbitrary size into a fixed-size output.
Hash functions are used to index data in hash tables.
They are also used in cryptography to securely store passwords.
Examples of hash functions include MD5, SHA-1, and SHA-256.
based on 4 interviews
Interview experience
5-7 Yrs
Not Disclosed
Software Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Designer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Front end Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
BYJU'S
Unacademy
Toppr
upGrad