Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Jul 2022. There were 4 interview rounds.
Top trending discussions
I applied via Campus Placement and was interviewed before Dec 2021. There were 3 interview rounds.
Coding Rond consisted of 3 questions
I applied via Campus Placement and was interviewed in Sep 2024. There were 3 interview rounds.
There were 3 coding questions totally based on dsa- hard
I applied via Company Website and was interviewed in Jun 2024. There was 1 interview round.
Implement your own state management in React and integrate it into a React application.
Customizing live data class implementation involves modifying the structure and behavior of a class to suit specific requirements.
Understand the current implementation of the live data class
Identify the specific requirements for customization
Modify the class structure and behavior accordingly
Test the customized implementation to ensure it meets the desired functionality
Custom views in Android allow developers to create unique UI components tailored to their specific needs.
Custom views can be created by extending existing View classes in Android, such as TextView or ImageView.
Developers can define custom attributes for their custom views in XML using the
Custom views can be used to create complex UI components like charts, graphs, or interactive widgets.
Custom ...
Custom view class design for software engineering interview
Extend the View class in Android or UIView class in iOS
Override onDraw method to customize drawing behavior
Implement custom attributes for XML layout customization
I applied via Approached by Company and was interviewed in Mar 2024. There was 1 interview round.
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
The Dutch Flag problem involves sorting an array of strings with three possible values in a specific order.
Create three pointers to keep track of the boundaries of each color group
Iterate through the array and swap elements to group them in the correct order
Time complexity of O(n) can be achieved by a single pass through the array
I applied via Approached by Company and was interviewed in Jun 2024. There were 3 interview rounds.
Generate all possible subsequences of a given string.
Use recursion to generate all possible combinations of characters in the string.
At each step, include or exclude the current character to form subsequences.
Store each subsequence in an array of strings.
Find and print the longest substring with k unique characters in an array of strings.
Iterate through the array of strings and keep track of the longest substring with k unique characters.
Use a sliding window approach to efficiently find the longest substring.
Keep a hashmap to store the frequency of characters in the current window.
Update the window boundaries based on the number of unique characters.
Return the longest ...
based on 1 interview experience
Difficulty level
Duration
based on 1 review
Rating in categories
Data Scientist
8
salaries
| ₹13 L/yr - ₹36 L/yr |
Decision Analyst
6
salaries
| ₹8 L/yr - ₹15 L/yr |
Risk Analyst
4
salaries
| ₹4 L/yr - ₹15.4 L/yr |
Data Analyst
4
salaries
| ₹2 L/yr - ₹21.5 L/yr |
Analyst
3
salaries
| ₹12 L/yr - ₹12 L/yr |
Udaan
BigBasket
Swiggy
CARS24