Filter interviews by
Given an array of natural numbers, find the first missing natural number.
Sort the array and iterate through it to find the first missing number.
Use a hash set to keep track of the numbers present in the array.
The first missing number will be the smallest positive integer not present in the array.
Design a screen to show 10 nearest restaurants in a list while keeping the UI uninterrupted.
Use a scrollable list view to display the restaurants
Implement a location-based search algorithm to find the nearest restaurants
Include a search bar to allow users to search for specific restaurants
Display relevant information for each restaurant such as name, rating, and distance
Implement filters or sorting options to allo...
IPC (Inter-Process Communication) methods in Android allow communication between different processes.
Binder: Android's default IPC mechanism, provides high-performance communication between processes.
AIDL (Android Interface Definition Language): Used to define the programming interface for IPC using Binder.
Intents: Used for asynchronous communication between components within an application or between different ap...
A photo viewer app for Android devices.
Use RecyclerView to display a grid of photos
Implement a caching mechanism to improve performance
Support gestures for zooming and swiping between photos
Integrate with a cloud storage service for photo storage and retrieval
Implement a search feature to allow users to find specific photos
To search for contacts with duplicate names and numbers, create a search function that checks both fields.
Create a function that takes a search term as input
Iterate through the list of contacts
Check if the search term exists in the Name field or Num field
Return the contacts that match the search term
To transfer the Ball object from one thread to another in Android, we can use Handler or AsyncTask.
Use Handler to post the Ball object from one thread to another
Create a Handler in the receiving thread and use its post() method to receive the Ball object
Alternatively, use AsyncTask to perform the transfer in the background thread and update the UI thread with the Ball object
A HashMap is a data structure that stores key-value pairs and provides constant time complexity for basic operations.
Implement a hash function to convert keys into array indices
Create an array to store the key-value pairs
Handle collisions using a technique like chaining or open addressing
Implement methods like put(), get(), and remove() to interact with the HashMap
Prints a linked list in a zigzag manner, alternating between left-to-right and right-to-left traversal.
1. Traverse the linked list level by level.
2. Use a flag to alternate the direction of printing for each level.
3. For odd levels, print from left to right; for even levels, print from right to left.
4. Example: For linked list 1 -> 2 -> 3 -> 4 -> 5, zigzag output would be: 1, 2, 3, 4, 5 (level 1), 5, 4...
Implement an LRU cache using a custom HashMap and a doubly linked list for efficient access and eviction.
Use a HashMap to store key-value pairs for O(1) access.
Maintain a doubly linked list to track the order of usage.
On access, move the accessed node to the front of the list.
On insertion, if the cache exceeds capacity, remove the least recently used node from both the list and the HashMap.
Example: For a cache wit...
Check if any permutation of a string can form a palindrome by analyzing character frequencies.
A palindrome reads the same forwards and backwards (e.g., 'racecar').
For a string to have a permutation that is a palindrome, at most one character can have an odd frequency.
Example: 'civic' can be rearranged to 'civic' (palindrome).
Example: 'ivicc' can be rearranged to 'civic' (palindrome).
Example: 'hello' cannot be rear...
I appeared for an interview in Feb 2017.
Prints a linked list in a zigzag manner, alternating between left-to-right and right-to-left traversal.
1. Traverse the linked list level by level.
2. Use a flag to alternate the direction of printing for each level.
3. For odd levels, print from left to right; for even levels, print from right to left.
4. Example: For linked list 1 -> 2 -> 3 -> 4 -> 5, zigzag output would be: 1, 2, 3, 4, 5 (level 1), 5, 4, 3, ...
A photo viewer app for Android devices.
Use RecyclerView to display a grid of photos
Implement a caching mechanism to improve performance
Support gestures for zooming and swiping between photos
Integrate with a cloud storage service for photo storage and retrieval
Implement a search feature to allow users to find specific photos
Check if any permutation of a string can form a palindrome by analyzing character frequencies.
A palindrome reads the same forwards and backwards (e.g., 'racecar').
For a string to have a permutation that is a palindrome, at most one character can have an odd frequency.
Example: 'civic' can be rearranged to 'civic' (palindrome).
Example: 'ivicc' can be rearranged to 'civic' (palindrome).
Example: 'hello' cannot be rearrange...
Given an array of natural numbers, find the first missing natural number.
Sort the array and iterate through it to find the first missing number.
Use a hash set to keep track of the numbers present in the array.
The first missing number will be the smallest positive integer not present in the array.
To transfer the Ball object from one thread to another in Android, we can use Handler or AsyncTask.
Use Handler to post the Ball object from one thread to another
Create a Handler in the receiving thread and use its post() method to receive the Ball object
Alternatively, use AsyncTask to perform the transfer in the background thread and update the UI thread with the Ball object
IPC (Inter-Process Communication) methods in Android allow communication between different processes.
Binder: Android's default IPC mechanism, provides high-performance communication between processes.
AIDL (Android Interface Definition Language): Used to define the programming interface for IPC using Binder.
Intents: Used for asynchronous communication between components within an application or between different applica...
Implement an LRU cache using a custom HashMap and a doubly linked list for efficient access and eviction.
Use a HashMap to store key-value pairs for O(1) access.
Maintain a doubly linked list to track the order of usage.
On access, move the accessed node to the front of the list.
On insertion, if the cache exceeds capacity, remove the least recently used node from both the list and the HashMap.
Example: For a cache with cap...
A HashMap is a data structure that stores key-value pairs and provides constant time complexity for basic operations.
Implement a hash function to convert keys into array indices
Create an array to store the key-value pairs
Handle collisions using a technique like chaining or open addressing
Implement methods like put(), get(), and remove() to interact with the HashMap
Create a weather app that fetches and displays an image from a fixed URL upon button press.
Use a button to trigger an API call to the fixed image URL.
Handle the response to extract the image data.
Display the image in a full-screen image view.
Consider using libraries like Glide or Picasso for image loading.
Ensure to handle errors, such as network issues or invalid responses.
To search for contacts with duplicate names and numbers, create a search function that checks both fields.
Create a function that takes a search term as input
Iterate through the list of contacts
Check if the search term exists in the Name field or Num field
Return the contacts that match the search term
Launch mode determines how a new instance of an activity is created and added to the task stack.
Standard: Creates a new instance of the activity each time it is launched.
SingleTop: If an instance of the activity already exists at the top of the stack, it will be reused.
SingleTask: If an instance of the activity already exists in the stack, it will be brought to the front and cleared of any activities above it.
SingleIns...
Deep linking in Android allows linking to specific content within an app, enabling seamless navigation.
Deep linking is achieved by defining intent filters in the app's manifest file.
The intent filter specifies the data format and scheme for the deep link.
Deep links can be triggered from other apps, websites, or even notifications.
Handling deep links involves extracting data from the intent and navigating to the appropr...
Design a screen to show 10 nearest restaurants in a list while keeping the UI uninterrupted.
Use a scrollable list view to display the restaurants
Implement a location-based search algorithm to find the nearest restaurants
Include a search bar to allow users to search for specific restaurants
Display relevant information for each restaurant such as name, rating, and distance
Implement filters or sorting options to allow use...
Top trending discussions
Graph, DP questions of hard level
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Included questions on mathematical reasoning, OS, DBMS and two coding questions
RAM is volatile memory for temporary storage, HDD is non-volatile storage for long-term data, and SSD is a faster non-volatile storage.
RAM is volatile memory that stores data temporarily while the computer is on.
HDD is a non-volatile storage device that uses spinning disks to store data long-term.
SSD is a faster non-volatile storage device that uses flash memory for quicker access to data.
RAM is faster but more expensi...
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
It was ok. I was not able to solve all the questions.
To remove the last element from a linked list, iterate to the second last node and update its next pointer to null.
Iterate through the linked list to find the second last node
Update the next pointer of the second last node to null
I applied via Instahyre and was interviewed in Oct 2024. There was 1 interview round.
Design LLD for Parking Lot
Create classes for ParkingLot, ParkingSpot, Vehicle, etc.
Implement methods for parking, unparking, checking availability, etc.
Consider different types of vehicles and parking spots (e.g. regular, handicapped, electric)
Include features like ticketing system, payment processing, and security measures
I appeared for an interview in Oct 2021.
Round duration - 50 minutes
Round difficulty - Medium
First round was a basic javascript problem-solving round. The interviewer judged my grasp on fundamental javascript concepts like objects, closures, polyfills, etc. It was during the afternoon and was conducted on google meet and leetcode playground.
The interviewer was very calm. I was first asked some general questions like why I'm applying for this role and what are the projects I've done.
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...
This question asks to find the position of a target integer in a row-wise and column-wise sorted matrix.
Iterate through each row and column of the matrix
Compare the target integer with the current element
If the target integer is found, return the position as {i, j}
If the target integer is not found, return {-1, -1}
Round duration - 40 minutes
Round difficulty - Easy
One DSA Question along with some javascript questions were asked like hoisting, difference between JSX and Javascript etc.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water for all bars and return the total amount.
Tip 1 : Focus on core Javascript fundamentals before becoming a framework ninja
Tip 2 : Have at least one (or more) good project(s) which shows your experience in frontend development
Tip 3 : Practice fundamental javascript questions and machine coding
Tip 1 : Clearly highlight the skills you have which match with the role you are applying for.
Tip 2 : Mention the work you have done in your internships related to your role (frontend in my case), work experience matters
Tip 3 : Mention some really good projects in your resume.
Tip 4 : Having some special achievements like SIH, Gsoc, etc. certainly helps but isn't compulsory.
I appeared for an interview in Apr 2021.
Round duration - 45 Minutes
Round difficulty - Easy
It was a DSA round where I was asked 2 coding questions and optimised approaches for both.
Ninja has started a new startup with a single conference room available for meetings. Given an array/list MEETINGS
of consecutive appointment requests, Ninja must ...
Find the maximum total booked minutes possible in a conference room for all meetings with a 15-minute break between meetings.
Iterate through the list of meeting durations and calculate the maximum total booked minutes considering the 15-minute break constraint.
Keep track of the total booked minutes and skip consecutive meetings that violate the break constraint.
Return the maximum total booked minutes for each test case...
Given an M * N matrix where each cell's value represents its height in a 2-D elevation map, calculate the total volume of water that can be trapped after rainfall.
...Calculate the total volume of water that can be trapped in a 2-D elevation map after rainfall.
Iterate through each cell in the matrix and calculate the trapped water based on the surrounding heights.
Use a stack or queue to keep track of the cells to be processed.
Consider edge cases such as when the matrix is empty or has only one row or column.
Round duration - 45 Minutes
Round difficulty - Medium
It was more of discussion around my projects and resume. Also asked some questions related to me. What are your hobbies? Willing to relocate?
Given an array A
consisting of N
integers, your task is to find the smallest subarray of A
that contains exactly K
distinct integers.
If multiple such subarrays...
Find the smallest subarray with exactly K distinct elements in an array.
Use a sliding window approach to keep track of the subarray with K distinct elements.
Maintain a hashmap to count the frequency of each element in the window.
Update the window size based on the number of distinct elements.
Return the smallest subarray with K distinct elements.
Tip 1 : Be consistent, you might not get success in the starting but if you are consistent with your prep, then in the end you will get offers from most companies
Tip 2 : Do participate in contests on leetcode
Tip 3 : Have a good resume
Tip 1 : Good projects
Tip 2 : Includes achievements in coding contests like ACM ICPC or Google kickstart, Hashcode.
I applied via Job Portal and was interviewed before Nov 2022. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before Oct 2021. There were 2 interview rounds.
Scaling refers to increasing capacity of a system. Horizontal scaling adds more machines, while vertical scaling adds more resources to a machine.
Horizontal scaling involves adding more machines to a system to increase capacity
Vertical scaling involves adding more resources to a machine to increase capacity
Use cases for horizontal scaling include handling increased traffic or adding redundancy
Use cases for vertical sca...
I applied via Job Portal and was interviewed in Apr 2024. There were 3 interview rounds.
Contained aptitude questions followed by two coding questions.
Contained Two coding questions
Contained project to find bugs
Some of the top questions asked at the Hike Software Development Engineer interview -
based on 1 review
Rating in categories
Senior Product Analyst
20
salaries
| ₹23 L/yr - ₹36 L/yr |
Senior Software Engineer
12
salaries
| ₹21.2 L/yr - ₹65 L/yr |
Associate Manager Marketing
11
salaries
| ₹13.5 L/yr - ₹15 L/yr |
Product Manager
10
salaries
| ₹18 L/yr - ₹52 L/yr |
Associate Product Manager
10
salaries
| ₹11 L/yr - ₹26.8 L/yr |
JoulestoWatts Business Solutions
DotPe
Thoughtsol Infotech
11:11 Systems