i
Nurturing Interns
Filter interviews by
I applied via Campus Placement
It was a great interview experience.
Backend task and other assignment work.
Top trending discussions
It was a leetcode medium
It was a leetcode medium
I applied via Indeed and was interviewed before Aug 2023. There were 3 interview rounds.
Core HTML, CSS and JS
JS deep dive and react
I applied via LinkedIn and was interviewed in Jan 2024. There was 1 interview round.
DSA questions asked in an interview
I applied via LinkedIn and was interviewed in Oct 2023. There were 2 interview rounds.
2 DSA problems were asked
I applied via campus placement at Vellore Institute of Technology (VIT) and was interviewed in Nov 2022. There were 3 interview rounds.
Normal Math Quants, Verbal and Logical ability questions. This round actually comprises of both Aptitude and Coding
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
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
I was interviewed in Apr 2022.
Round duration - 55 Minutes
Round difficulty - Easy
Timing - evening
Interviewer was friendly.
I directly came up with the DFS approach.
Round duration - 55 Minutes
Round difficulty - Easy
Timing - afternoon
Interviewer was friendly
Thought about 2 pointer technique and solved with that.
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...
Round duration - 55 Minutes
Round difficulty - Easy
Timing - evening
interviewer was friendly
Building a quizzing system for multiple classes and teachers.
Game:
A set of MCQ Questions that a Player can answer.
A Game will be assigned to a class or multiple Classes by...
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 applied via LinkedIn and was interviewed before May 2022. There were 2 interview rounds.
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...
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]
InsanelyGood
Vegrow
Pepper Content
Elevate