i
Cutshort
Filter interviews by
I applied via Cutshort and was interviewed before Apr 2023. There was 1 interview round.
Recursive search in JavaScript object
Use a recursive function to search through nested objects
Check if current property is an object, if so call the function recursively
Return the value if found, otherwise return null
I applied via Company Website and was interviewed in Sep 2022. There were 4 interview rounds.
UI given, need to make the UI in react with scalability in mind.
I applied via Company Website and was interviewed in Feb 2022. There were 3 interview rounds.
Simple assignment to test your UI development skills
I applied via Cutshort and was interviewed before Mar 2023. There was 1 interview round.
Create splitwise algorithm.
Cutshort interview questions for popular designations
I applied via Referral and was interviewed in Mar 2023. There were 3 interview rounds.
I applied via Campus Placement
It just like like a screen test they will ask you questions based on your cv
It will hardly take 30minutes to complete the test.
It will take hardly 30 minutes to complete coding test.
posted on 13 May 2024
I applied via Approached by Company and was interviewed in Nov 2023. There were 2 interview rounds.
Contracts review and abstraction
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 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]
based on 4 interviews
Interview experience
based on 19 reviews
Rating in categories
Full Stack Software Developer
5
salaries
| ₹6.2 L/yr - ₹6.2 L/yr |
Sales Evangelist
5
salaries
| ₹5.4 L/yr - ₹10.5 L/yr |
Software Engineer
4
salaries
| ₹10 L/yr - ₹21 L/yr |
Program Manager
4
salaries
| ₹5 L/yr - ₹11.3 L/yr |
SEO Specialist
4
salaries
| ₹9.5 L/yr - ₹11 L/yr |
InsanelyGood
Vegrow
Pepper Content
Elevate