AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Clear (1)
Hike Android Developer Interview Questions, Process, and Tips
Top Hike Android Developer Interview Questions and Answers
- Q1. Design an photo viewing app which will show images from the disk in the list, and one item in the list should take half of the screen. (Android app design question, have ...read more
- Q2. Rearrange Linked List Problem Statement Given a singly linked list in the form 'L1' -> 'L2' -> 'L3' -> ... 'Ln', your task is to rearrange the nodes to the form 'L1' -> ...read more
- Q3. Find Missing Number In String Problem Statement You have a sequence of consecutive nonnegative integers. By appending all integers end-to-end, you formed a string S with ...read more
Hike Android Developer Interview Experiences
3 interviews found
Anonymous
(3 Questions)
- Q1. What are the different android components and concepts such as Recycler View, View Model, ANR and how do they function internally?
- Ans.
Android components like Recycler View, View Model, ANR are essential for building robust Android applications.
Recycler View: Efficient way to display large data sets by recycling views as they scroll off the screen.
View Model: Manages UI-related data in a lifecycle-conscious way, surviving configuration changes.
ANR (Application Not Responding): Dialog shown to the user when the main thread of an app is blocked for too ...
- Q2. How will you debug and solve the following crash and ANR from the given stack trace?
- Q3. Solve this DSA question.
(1 Question)
- Q1. Similar questions to the first round.
(1 Question)
- Q1. Implement an LRU cache
- Ans.
LRU cache is a data structure that stores the most recently used items, discarding the least recently used items when full.
Use a hashmap to store key-value pairs for quick access
Use a doubly linked list to keep track of the order of items based on their usage
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the end of the list
Skills evaluated in this interview
I was interviewed before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a DSA based round, I was asked to code on collabedit.
- Q1.
Rearrange Linked List Problem Statement
Given a singly linked list in the form 'L1' -> 'L2' -> 'L3' -> ... 'Ln', your task is to rearrange the nodes to the form 'L1' -> 'Ln' -> 'L2' -> '...
- Ans.
Rearrange the nodes of a singly linked list in a specific order without altering the data of the nodes.
Use two pointers to split the linked list into two halves.
Reverse the second half of the linked list.
Merge the two halves alternately to rearrange the nodes.
Ensure to handle cases with odd and even number of nodes separately.
Example: For input 1 -> 2 -> 3 -> 4 -> 5, the output should be 1 -> 5 -> 2 -
- Q2.
Find Missing Number In String Problem Statement
You have a sequence of consecutive nonnegative integers. By appending all integers end-to-end, you formed a string
Swithout any separators. During this pro... - Ans.
Given a string of consecutive nonnegative integers without separators, find the missing integer.
Iterate through all possible splits of the string and check if the sequence is valid
If the sequence is valid, return the missing integer
Handle cases where there are multiple missing integers or the string is invalid
- Q3.
Palindrome Permutation - Problem Statement
Determine if a permutation of a given string
Scan form a palindrome.Example:
Input:
string S = "aab"
Output:
"True"
Explanation:
The permutation "aba" o...
- Ans.
Check if a permutation of a string can form a palindrome.
Create a frequency map of characters in the string.
Check if at most one character has an odd frequency.
If yes, return True; otherwise, return False.
(3 Questions)
Round duration - 30 minutes
Round difficulty - Medium
This was onsite interview round 1. Java and Android threading concepts are needed.
- Q1. What is a Cyclic Barrier in Java?
- Ans.
CyclicBarrier in Java is a synchronization aid that allows a set of threads to wait for each other to reach a common barrier point.
CyclicBarrier is initialized with a count of the number of threads that must invoke await() before the barrier is tripped.
Threads wait at the barrier until all threads have invoked await(), then the barrier is released.
Once the barrier is tripped, it can be reused for subsequent synchroniza...
- Q2. What are the different launch modes for activities in Android?
- Ans.
Different launch modes for activities in Android control how the activity is launched and how it interacts with the existing activities in the back stack.
Standard: The default launch mode where a new instance of the activity is created every time it is launched.
SingleTop: If the activity is already at the top of the back stack, it will not be recreated and onNewIntent() will be called instead.
SingleTask: The activity w...
- Q3. How can you pass a simple Java object from one thread to another?
- Ans.
Use a Handler or AsyncTask to pass a Java object between threads.
Use a Handler to send messages containing the object from one thread to another.
Use AsyncTask to perform background tasks and update UI with the object on the main thread.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This round was all about android and internals of collections in Java.
- Q1. What is an IntentService?
- Ans.
IntentService is a subclass of Service that can handle asynchronous requests on the main thread.
IntentService is used for handling long-running operations in the background without blocking the main thread.
It is started with an Intent and runs in a separate worker thread.
Once the task is completed, the IntentService stops itself automatically.
It is commonly used for tasks like downloading files, syncing data, or perfor
- Q2. What is the difference between deep links and app links?
- Ans.
Deep links are URLs that take users directly to specific content within an app, while app links are URLs that open an app if it's installed, or redirect to a website if not.
Deep links are used to navigate users to a specific location within an app, bypassing the home screen.
App links are URLs that can open an app if it's installed on the device, or redirect to a website if the app is not installed.
Deep links require sp...
- Q3. What are the IPC mechanisms available in Android OS?
- Ans.
Inter-Process Communication (IPC) mechanisms in Android OS allow different processes to communicate with each other.
Binder: High-performance mechanism for IPC between processes in Android. Used for communication between system services and applications.
Intent: Used for communication between components within the same application or between different applications.
Content Providers: Allow different applications to share ...
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
Technical interview round for purely checking the design knowledge of a person.
- Q1.
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1.
get(key)- Return the value of the key if it exists in the cache; otherw... - Ans.
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to keep track of the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access and update.
When capacity is reached, evict the least recently used item before inserting a new item.
Update the order of keys in the linked list whenever a
- Q2. How would you design an ImageDownloader that efficiently handles parallel API calls?
- Ans.
Use a thread pool to handle parallel API calls efficiently.
Implement a thread pool to manage multiple threads for downloading images concurrently.
Use a caching mechanism to store downloaded images and avoid redundant API calls.
Consider using a priority queue to prioritize important images for download.
Implement a mechanism to cancel or pause ongoing downloads if needed.
Optimize network requests by batching multiple req
Round duration - 30 minutes
Round difficulty - Easy
This was the last Interview with director of engineering.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I was interviewed in Feb 2017.
Interview Questionnaire
19 Questions
- Q1. Design an photo viewing app which will show images from the disk in the list, and one item in the list should take half of the screen. (Android app design question, have to explain all the components used ...
- Ans.
An Android photo viewing app with a list of images from disk, one taking half the screen.
Use RecyclerView to display the list of images
Use a custom adapter to bind the images to the RecyclerView
Use a GridLayoutManager with span count of 2 to achieve the half-screen effect
Load images from disk using a library like Glide or Picasso
Implement click listeners to handle item selection and display the selected image
- Q2. Print a linked list in a zig zag manner. -----/
- Q3. Given a String, write a function, which will return a boolean. The function will tell you whether one permutation of the string is Palindrome or not.
- Q4. Given an array, which consist of natural numbers only. The elements are in random order, tell the first missing natural number in the array. e.g 4,6,3,1,6,8 o.p - 2 1,2,3 O/P - 4
- Ans.
Given an array of natural numbers in random order, find the first missing natural number.
Sort the array in ascending order
Iterate through the sorted array and compare each element with its index
If the element is not equal to its index + 1, return the missing number
If all elements are in order, return the next natural number after the last element
- Q5. Java/Android : Given an Object 'Ball'. How will you transfer this ball object from one thread to another. Same ball object pass from Thread to MainThread.
- Ans.
To transfer the Ball object from one thread to another, we can use Handler or AsyncTask.
Use Handler to post a Runnable to the main thread's message queue
Use AsyncTask to perform background operations and update the UI on the main thread
Pass the Ball object as a parameter or use a shared variable between threads
- Q6. How does looper/handlers work internally when you pass object from one thread to another.
- Ans.
Looper/handlers allow passing objects between threads in Android.
Looper is a message loop that runs in a thread and processes messages from a message queue.
Handlers are used to send messages to the message queue of a looper.
When an object is passed from one thread to another using a handler, it is encapsulated in a message and added to the receiving thread's message queue.
The receiving thread's looper then processes th...
- Q7. Methods of IPC in android.
- Ans.
IPC (Inter-Process Communication) methods in Android allow communication between different processes.
Binder: Android's native IPC mechanism, used for communication between processes.
Intents: Used for communication between components within the same application or between different applications.
Content Providers: Allow sharing data between applications using a common interface.
Broadcasts: Used for asynchronous communica...
- Q8. Implement LRU cache. (Implement you own HashMap meanwhile) Main focus was around this question only.
- Q9. If you were asked to make your own HashMap, how will you do it. (As it was used in the first question)
- Ans.
To create my own HashMap, I would use an array of linked lists to handle collisions and implement key-value pairs using a hash function.
Create an array of linked lists to store the key-value pairs
Implement a hash function to generate an index for each key
Handle collisions by adding elements to the linked list at the corresponding index
Support operations like put(key, value), get(key), and remove(key)
- Q10. Some definitions and basic android questions. AsyncTask, IntentService, Service, internals of ArrayList, etc.
- Q11. Design a weather app. (One image for every weather is there on a server) Take care of half downloaded image, try not to consume data of user again.
- Ans.
A weather app that displays images for different weather conditions, taking care of half downloaded images and minimizing data consumption.
Implement image caching to store downloaded images locally
Check if the image is already downloaded before making a network request
Use a progress bar to indicate the download status of the image
Handle cases where the download is interrupted or incomplete
Implement a mechanism to resum...
- Q12. Extended same question for the adapter with multiple images. Do not unncessary download if user has scrolled fast. - How will you cancel the request when the user has scrolled, and what will you do when ...
- Q13. You have application which shows list of all contacts, the Name/Numbers can be duplicated. How will you go on and do searching in this. Search term can either exist in Name or in Number.
- Ans.
To search for contacts with duplicate names or numbers, iterate through the list and compare each contact's name and number with the search term.
Iterate through the list of contacts
Compare the search term with each contact's name and number
Return the contacts that match the search term
- Q14. Question based on Java cyclic barrier.
- Q15. Launch Mode of Activity.
- Ans.
Launch mode determines how an activity is launched and how it behaves in the task stack.
Standard: Creates a new instance of the activity on each launch.
SingleTop: Reuses the existing instance if it's already at the top of the stack.
SingleTask: Creates a new task and places the activity at the root of the task.
SingleInstance: Creates a new task and places the activity as the only one in the task.
- Q16. How do you do DeepLinking in android.
- Ans.
Deep linking in Android allows users to navigate directly to specific content within an app.
Deep linking is achieved by defining intent filters in the app's manifest file.
The intent filter specifies the URL scheme and host that the app can handle.
When a deep link is clicked, Android checks if any app can handle the URL and prompts the user to choose.
The chosen app receives the deep link data in the intent's data field.
...
- Q17. Some Project based questions, What were your challenges, which projecct you loved most, which one you did not etc......
- Q18. You have to design screen in which at a time on screen 10 nearest restaurants will be shown in a list. The screen will keep adding more options while scrolling. Scroll in the list should be uninterrupted...
- Ans.
Design a screen to show 10 nearest restaurants in a list with uninterrupted scrolling.
Use a RecyclerView to display the list of restaurants
Implement a custom adapter to populate the data in the list
Use a location service to get the user's current location
Sort the restaurants based on their distance from the user's location
Load more restaurants as the user scrolls to the end of the list
- Q19. Design the ImageDownloader, with efficiently handling parallel API calls.
- Ans.
ImageDownloader efficiently handles parallel API calls.
Use a thread pool to manage parallel API calls.
Implement caching to avoid redundant API calls.
Use a priority queue to prioritize image downloads.
Optimize network requests by using HTTP/2 or multiplexing.
Consider using a library like Picasso or Glide for image loading and caching.
Interview Preparation Tips
Experience: Skype round, coding on collabedit (1 Hour)
Round: Technical Interview
Experience: On Site interview 1 and half hour round.
Tips: Java and Android threading concepts are needed.
Round: Technical Interview
Experience: This round was all about android and internals of collections in Java.
OnSite 1 hour round.
Round: Technical Interview
Experience: Purely for checking the design knowledge of a person. (1.5 hour round)
Round: Technical Interview
Experience: Interview with director of engineering.
Skills: Android Development, Java Programming, Data Structures And Algorithms
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I was interviewed before Dec 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
- Q1.
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
- Ans.
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as
- Q2.
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege... - Ans.
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
(1 Question)
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
- Q1.
Intersection of Two Arrays Problem Statement
Given two arrays
AandBwith sizesNandMrespectively, both sorted in non-decreasing order, determine their intersection.The intersection of two arrays in...
- Ans.
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I applied via Campus Placement
Interview Preparation Tips
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.
Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix
Tips: All question were from geeksforgeeks
So practice it well ..u will make through it
Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible
Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...
Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens
Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar
Interview Questionnaire
9 Questions
- Q1. Write a regex for email validation?
- Ans.
Regex for email validation
Start with a string of characters followed by @ symbol
Followed by a string of characters and a period
End with a string of characters with a length of 2-6 characters
Allow for optional subdomains separated by periods
Disallow special characters except for . and _ in username
- Q2. Parse the XML? and store the output in JSON. Discussed different approaches?
- Q3. Print prime numbers in a given range and optimize the solution?
- Ans.
Print prime numbers in a given range and optimize the solution.
Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently
Start with a boolean array of size n+1, mark all as true
Loop through the array and mark all multiples of each prime as false
Print all the indexes that are still marked as true
- Q4. Puzzle – 25 horses – 5 lanes, find fastest 3 horses?
- Q5. Web related questions on Sessions and cookies?
- Q6. A lot of discussion on my resume, experience etc
- Q7. Find angle between hour hand and minute hand in clock if time is given? Write a program or pseudo code?
- Ans.
Find angle between hour and minute hand in a clock given the time.
Calculate the angle made by the hour hand with respect to 12 o'clock position
Calculate the angle made by the minute hand with respect to 12 o'clock position
Find the difference between the two angles and take the absolute value
If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle
- Q8. A hash function was written to convert a string into a hash. Write a un-hash function to revert it(from hash to string)?
- Ans.
To un-hash a string, use a reverse algorithm to convert the hash back to the original string.
Create a reverse algorithm that takes the hash as input and outputs the original string
Use the same logic as the hash function but in reverse order
If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string
- Q9. He discussed about expectations and role. Asked me if I have any questions. He said to me “yaha aana hai to marwani padegi. tyar ho”? I smiled and asked what are the work timings? He said 9-9 and I was kin...
Interview Preparation Tips
Skills: Web development, JSON, Algorithm
College Name: na
Motivation: Overall process was not very tough. But they have start up culture. People work their for 11-12 hours a day. Sometimes on Saturday as well. So people who are geeks or have nothing in life to do except their job can go and join
Skills evaluated in this interview
I was interviewed before Jan 2021.
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.
- Q1.
K-th Largest Number in a BST
Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.
If there is no K-th la...
- Ans.
Find the K-th largest element in a BST.
Perform reverse in-order traversal of the BST to find the K-th largest element.
Keep track of the count of visited nodes to determine the K-th largest element.
Return -1 if there is no K-th largest element in the BST.
- Q2.
Is Height Balanced Binary Tree Problem Statement
Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:
- The left subtree is balanced.
- The right subtree is bala...
- Ans.
Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.
Check if the left subtree is balanced
Check if the right subtree is balanced
Calculate the height difference between the left and right subtrees
Return 'True' if all conditions are met, otherwise return 'False'
- Q3. Can you explain the concepts of Zombie Process and Orphan Process in operating systems?
- Ans.
Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.
Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.
Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.
Orphan p...
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .
- Q1.
Longest Substring Without Repeating Characters Problem Statement
Given a string
Sof lengthL, determine the length of the longest substring that contains no repeating characters.Example:
Input:
"abac...
- Ans.
Find the length of the longest substring without repeating characters in a given string.
Use a sliding window approach to keep track of the longest substring without repeating characters.
Use a hashmap to store the index of each character in the string.
Update the start index of the window when a repeating character is found.
Calculate the maximum length of the window as you iterate through the string.
Return the maximum le
- Q2.
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer
Qqueries. Each query is represented by an integerQ[i], and you must ... - Ans.
Search for integers in a rotated sorted array efficiently.
Use binary search to efficiently search for integers in the rotated sorted array.
Handle the rotation of the array while performing binary search.
Return the index of the integer if found, else return -1.
- Q3.
Count Subarrays with Sum Divisible by K
Given an array
ARRand an integerK, your task is to count all subarrays whose sum is divisible by the given integerK.Input:
The first line of input contains an... - Ans.
Count subarrays with sum divisible by K in an array.
Iterate through the array and keep track of the prefix sum modulo K.
Use a hashmap to store the frequency of each prefix sum modulo K.
For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.
Handle the case when prefix sum itself is divisible by K.
Return the total count of subarrays with sum divisible by K.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.
- Q1.
Ceil Value from BST Problem Statement
Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.
The ceil of an integer is defined as the s...
- Ans.
Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.
Traverse the BST to find the closest value greater than or equal to the key.
Compare the key with the current node value and update the ceil value accordingly.
Recursively move to the left or right subtree based on the comparison.
Return the ceil value once the traversal is complete.
- Q2.
Design a Constant Time Data Structure
Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:
1. INSERT(key, value): Add or update t... - Ans.
Design a constant time data structure to maintain mappings between keys and values with various operations.
Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.
Keep track of the number of key-value pairs for GET_SIZE operation.
Check if the hash table is empty for IS_EMPTY operation.
Return true or false for SEARCH operation based on key existence.
Return the value associated...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I was interviewed before Jan 2021.
(3 Questions)
Round duration - 90 Minutes
Round difficulty - Hard
I found the online coding round of Flipkart to be quite difficult based on the constraints of the problem and their time limits. I coded the first problem quite easily but on the second and the third problem , my code could only pass a few test cases and gave TLE for most of them. Both the questions required very efficient solution and the last 5 to 10 Test Cases carried more weight than the rest so I didn't get through this round.
- Q1.
Print the Kth Digit
Given three non-negative integers N, M, and K, compute the Kth digit from the right in the number obtained from N raised to the power M (i.e., N ^ M).
Input:
The first line contains ... - Ans.
The task is to find the Kth digit from the right in the number obtained from N raised to the power M.
Iterate through the digits of N^M from right to left
Keep track of the position of the current digit
Return the digit at position K from the right
- Q2.
The Skyline Problem
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...
- Ans.
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
Iterate through the buildings and create a list of critical points (x, y) where the height changes.
Sort the critical points based on x-coordinate and process them to form the skyline.
Merge consecutive horizontal segments of equal height into one to ensure no duplicates.
Return the fin...
- Q3.
Longest Palindromic Substring Problem Statement
You are provided with a string
STRof lengthN. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind... - Ans.
Identify the longest palindromic substring in a given string.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found
Return the longest palindrome with the smallest start index
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I applied via Campus Placement
Interview Preparation Tips
Experience: It was a good one but both questions would have been easy if we know more libraries in java
Tips: Both the questions were related to bigint. It could have been better if both questions were from different areas
Duration: 90 minutes
Round: Technical Interview
Experience: I felt my interview went fine since i was able to answer most of their questions.They gave many hints even if i didn't get the right one
Tips: Everything was fine
Round: HR Interview
Experience: I was able to see myself how i responded to questions asked regarding me and sometimes i was just blabbering
Tips: nothing
General Tips: One must be good at datastrucures and algorithms
Skill Tips: nothing
Skills: Datastructures and Algorithms
Duration: 2
College Name: IIT Madras
Motivation: I wanted to do something for the company where I ordered many of my things
Funny Moments: No funny moments as such but I enjoyed talking to the hr interviewer
RAJIVTEJA NAGIPOGU
I applied via Campus Placement
Interview Preparation Tips
Experience: The test started very late due to some technical issues and space issues. So , It helped us to be far more relaxed.
Duration: 11/2 hr minutes
Total Questions: 2
Round: Technical Interview
Experience: The Overall Technical Interview was a mixture of innovation and apprehension and it really helped me to get my strengths and weaknesses out. The questions outsmarted me at the beginning, Later I did.
Round: HR Interview
Experience: HR was very friendly. He asked about my strengths and weaknesses. And then we continued talking about the nature of work and sincerity and technicality expected from my side, while taking a stroll in cool night air.
Skills: Algorithms and DataStructures
Duration: 2 months
College Name: IIT Madras
Motivation: The work specification
Hike Interview FAQs
Some of the top questions asked at the Hike Android Developer interview -
Recently Viewed
INTERVIEWS
dezerv
No Interviews
INTERVIEWS
Bata
No Interviews
SALARIES
GGK Technologies
JOBS
Bacancy Technology
No Jobs
INTERVIEWS
Bata
No Interviews
INTERVIEWS
Bata
No Interviews
INTERVIEWS
Chemplast Sanmar
No Interviews
LIST OF COMPANIES
Bacancy Technology
Overview
INTERVIEWS
CONCAST
No Interviews
INTERVIEWS
Bata
No Interviews
Tell us how to improve this page.
Hike Interviews By Designations
- Hike Software Developer Interview Questions
- Hike Software Developer Intern Interview Questions
- Hike Android Developer Interview Questions
- Hike Associate Product Manager Interview Questions
- Hike Senior Software Engineer Interview Questions
- Hike HR Manager Interview Questions
- Hike Salesman Interview Questions
- Hike Software Development Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Android Developer Interview Questions
- Senior Android Application Developer Interview Questions
- Android Mobile Application Developer Interview Questions
- Junior Android Developer Interview Questions
- IOS Developer Interview Questions
- React Native Developer Interview Questions
- Senior IOS Developer Interview Questions
- Mobile Application Developer Interview Questions
- Show more
Hike Android Developer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
|
Senior Product Analyst
28
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Associate Product Manager
11
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Product Manager
8
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Software Developer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Ola Cabs
Flipkart
Paytm
Swiggy
- Home >
- Interviews >
- Hike Interview Questions >
- Hike Android Developer Interview Questions
