AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Hike Interview Questions, Process, and Tips
Top Hike 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 moreasked in Android Developer interview
- Q2. Reverse Words in a String: Problem Statement You are given a string of length N . Your task is to reverse the string word by word. The input may contain multiple spaces ...read moreasked in Software Developer interview
- Q3. Maximum Size Rectangle Sub-matrix with All 1's Problem Statement You are provided with an N * M sized binary matrix 'MAT' where 'N' denotes the number of rows and 'M' de ...read moreasked in Software Developer Intern interview
Hike Interview Experiences
32 interviews found
Anonymous
Interview Questionnaire
7 Questions
- Q1. A sorted array is rotated K times. Sort it in o(n) traversal without extra space
- Ans.
Sort a rotated sorted array in O(n) time without extra space
Find the index of the minimum element using binary search
Reverse the two subarrays on either side of the minimum element
Reverse the entire array
Example: [4,5,6,7,0,1,2] -> [0,1,2,4,5,6,7]
- Q2. Median of a stream of array
- Ans.
Finding the median of a stream of array in real-time.
Use two heaps to keep track of the median
Maintain a max heap for the lower half and a min heap for the upper half
If the heaps are balanced, the median is the average of the top elements of both heaps
If the heaps are unbalanced, the median is the top element of the heap with more elements
- Q3. Pirates and gold puzzle
- Q4. Why manhole is round ?
- Ans.
Manholes are round because it prevents them from falling into the hole and allows for easy movement of the cover.
Round covers cannot fall into the hole as they cannot fit through diagonally
Round covers can be easily moved in any direction
Round shape distributes weight evenly
Round shape is easier to manufacture and install
- Q5. Two pair with a given sum in a bst with o(log n) space
- Ans.
Finding two pairs with a given sum in a BST using O(log n) space.
Traverse the BST in-order and store the nodes in an array
Use two pointers approach to find the pairs with the given sum
Time complexity: O(n), Space complexity: O(log n)
Optimized approach: Use two stacks to traverse the BST in-order and find the pairs
Time complexity: O(log n), Space complexity: O(log n)
- Q6. K random numbers from infinite stream of array with equal probability
- Ans.
To select k random numbers from an infinite stream of array with equal probability.
Use reservoir sampling algorithm to randomly select k numbers from the stream
Maintain a reservoir array of size k to store the selected numbers
For each incoming number, generate a random number between 0 and the total count of numbers seen so far
If the generated number is less than k, replace the corresponding number in the reservoir arr...
- Q7. Question from projects
Interview Preparation Tips
Experience: We all were required to write a code for LRU implementation with proper Locks and synchronization so as it is thread safe.
Round: TECHNICAL INTERVIEW
Experience: Lots of question from projects and technology used there.
How you choose tgose technology over the others ?
Given a file with student name and marks .. Print all student whose marks lies within a given range of marks.
College Name: NA
Skills evaluated in this interview
Interview Questionnaire
4 Questions
- Q1. How you will find out 3rd smallest element from an array
- Ans.
To find the 3rd smallest element from an array, sort the array and return the element at index 2.
Sort the array in ascending order
Return the element at index 2
If the array has less than 3 elements, return null
- Q2. Based on first Question, rather than an array you have a large file containing billions of number and from it you have to print Kth minimum element
- Q3. A file containing billion of numbers in unsorted manner is given to you. At run time you will be given two integers ‘m’ and ‘n’. Now print all the numbers from file which lies in this range. He said u can ...
- Q4. Do you know spell checker in micro soft word
- Ans.
Yes, spell checker is a built-in feature in Microsoft Word.
Spell checker automatically checks for spelling errors as you type.
It underlines misspelled words in red and suggests corrections.
You can also customize the spell checker settings and add words to the dictionary.
To access the spell checker, go to the Review tab and click on Spelling & Grammar.
Alternatively, you can use the shortcut key F7 to run the spell check
Interview Preparation Tips
Experience: 1) Reverse every K nodes in a singly linked list.
2) Find out the next greater element having same digits.
1432 -> 2134 5432 -> no greater number
Total Questions: 25
Round: Technical Interview
Experience: This question was new to me. He told me let’s play a game. I said okay sir :). In this game we will be given even number of cards. Each card will be having some digit written over it. Now both player will play optimally and can only choose card from either corner. He asked me to devise a strategy which would help me winning the game always.Later he asked me to prove my strategy for the general case.
Given a file which contains large number of strings.e.g.:my name is XYZ. My emansi XYZi.e. it has words and reverse of words. There can be the case where no reverse word is present He told me to print all those pair whose reverse is also present in the file. For above example output will be: {name,eman}, {is, si} Constraints were Minimum space should be used and time complexity should be minimum further he added don’t compute reverse of string at all.(He was interested in function which I will use to calculate the hash value of string).He asked me what my weak point in coding is. I said finding out the corner test cases. At this he caught me and said let see how you will face your fear and give me a code and asked me to generate all the test cases for the program.
Later he asked me to write code for printing a helix (spiral matrix)and write all corner test cases for it.I wrote solution for NxN but he asked me to write for NxMand do dry run for several test cases.That is how second round went ?
Round: HR Interview
Experience: Interviewer asked me about chess, rules of chess and all1. He started with Knight Tour problem in which I have to print the path. Conditions wereI have to cover all the blocks in chess. I can use only 63 moves and solution must be other than backtracking.(most optimal solution). He wanted me to tell him the strategy required to prune the recursion tree.
Round: Technical Interview
Experience: you have newspapers of last 20 years. Use these newspapers and suggest most probable words.
He gave me exampleInput: fonfor this input printOutput: foe, for, fork, fond
Question seemed easy but when I started he kept adding constraints on data structures used and complexity.
I used lexicographical dictionary for this but later he added two more examplehe asked me to suggest ‘con’ and ‘ion’ as most probable word for fon.
Later he added another exampleBrowserBsowerr
He said suggest browser for ‘Bsowerr’.
He kept adding examples and constraints.My solution started from lexicographical dictionary moved to Trie Tree then to Edit Distance problem then Hashing
He said why I gave you newspapers rather than Dictionary. From this I got smell of Machine learningHe wanted me to suggest on the basis of currently most frequently used words.
And the Question got more complexand it ended on SUFFIX TREE.
College Name: NA
Skills evaluated in this interview
I was interviewed before Mar 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on DSA were discussed.
- Q1.
Ninja and Sorted Array Merging Problem
Ninja is tasked with merging two given sorted integer arrays
ARR1andARR2of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w... - Ans.
Merge two sorted arrays into one sorted array within the first array.
Create a pointer for the last index of ARR1 and ARR2 to start merging from the end.
Compare elements from both arrays and place the larger element at the end of ARR1.
Continue this process until all elements are merged in sorted order within ARR1.
- Q2.
Reverse Alternate Levels of a Perfect Binary Tree Problem Statement
Given a perfect binary tree consisting of 'N' nodes, reverse the nodes at alternate levels in the tree (i.e., reverse level 2, level 4, ...
- Ans.
Reverse alternate levels of a perfect binary tree by reversing nodes at even levels starting from level 2.
Traverse the tree in level order and store nodes at even levels in a separate list.
Reverse the list of nodes at even levels.
Update the tree with the reversed nodes at even levels.
Repeat the process for alternate levels starting from level 2.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on OS, Java were discussed.
- Q1. What are the characteristics of distributed file systems?
- Ans.
Characteristics of distributed file systems include scalability, fault tolerance, and data replication.
Scalability: Distributed file systems can easily scale to accommodate a large amount of data and users.
Fault tolerance: They are designed to continue functioning even if some components fail, ensuring high availability.
Data replication: Data is often replicated across multiple nodes to ensure reliability and performan...
- Q2. Design a file sharing mechanism between two users.
- Ans.
Design a file sharing mechanism between two users.
Implement a secure login system for both users.
Allow users to upload files to a shared server.
Provide a way for users to view and download files shared by the other user.
Implement access control to ensure only authorized users can access the shared files.
- Q3. What is ConcurrentHashMap in Java?
- Ans.
ConcurrentHashMap is a thread-safe implementation of the Map interface in Java.
ConcurrentHashMap allows multiple threads to read and write to the map concurrently without causing any issues like deadlocks or data corruption.
It achieves thread-safety by dividing the map into segments, each of which can be locked independently.
ConcurrentHashMap is more efficient than using synchronized maps for concurrent access.
Example:...
- Q4. How do you analyze the usage history of an application?
- Ans.
Analyzing usage history involves tracking user interactions, patterns, and trends to improve application performance.
Collect and store user interaction data such as clicks, page views, and time spent on each feature.
Use analytics tools to generate reports and visualize usage patterns.
Identify popular features, user preferences, and areas for improvement based on usage data.
Implement A/B testing to compare different ver...
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
Top Hike Software Developer Interview Questions and Answers
Software Developer Interview Questions asked at other Companies
Interview Questionnaire
6 Questions
- Q1. Questions of my work in current job
- Q2. Some DB queries to write for the tables provided by interviewer
- Q3. Implement Inorder Traversal with and without using recursion
- Ans.
Inorder Traversal can be implemented using recursion or without recursion.
Inorder Traversal using recursion involves traversing the left subtree, visiting the root node, and then traversing the right subtree.
Inorder Traversal without recursion involves using a stack to keep track of the nodes to be visited.
For each node, push it onto the stack and traverse its left subtree until there are no more left nodes.
Pop the top...
- Q4. How does Stack work internally and what data it holds?
- Ans.
Stack is a data structure that follows LIFO (Last In First Out) principle.
Stack holds a collection of elements
It has two main operations: push (adds element to top) and pop (removes element from top)
It also has peek operation (returns top element without removing it)
Stack can be implemented using arrays or linked lists
Examples: undo-redo functionality in text editors, back-forward navigation in web browsers
- Q5. Given a cartesian x-y plane and lot of points in that plane with x and y coordinates and 1 more point(say x,y) is given, so we have to find all the points in that plane which are lying in a radius of lengt...
- Ans.
Given a point and a radius, find all points in a cartesian plane within the radius.
Calculate the distance between the given point and all other points in the plane using the distance formula.
If the distance is less than or equal to the radius, add the point to the result set.
Return the result set of points within the radius of the given point.
- Q6. Why synchronised block needed? and some more questions on Multithreading in Java
Interview Preparation Tips
Experience: We all were required to write a code for LRU implementation with proper Locks and synchronization so as it is thread safe.
College Name: NA
Skills evaluated in this interview
Hike interview questions for popular designations
Interview Questionnaire
3 Questions
- Q1. Asked to write code for level order traversal in binary tree
- Q2. Write code to get maximum and second maximum element of a stack. The given function should be in O(1) complexity
- Ans.
Code to get max and second max element of a stack in O(1) complexity.
Create two variables to store max and second max values
Update the variables whenever a new element is pushed or popped from the stack
Return the max and second max values when required
- Q3. Given a biotonic array ( first numbers increase and then decrease ) write code to search a given number. Time complexity O(logn)
- Ans.
Code to search a given number in a biotonic array with O(logn) time complexity.
Use binary search to find the peak element in the array.
Divide the array into two subarrays and perform binary search on each subarray.
Return the index of the element if found, else return -1.
Interview Preparation Tips
Experience: Duration – 90 minsSection 1 ( Technical objective questions)
– 25 mcq’s mainly focusing on c , c++ , os , data structures , algorithmsSection 2 ( 2 Coding questions )
– Code was supposed to be written on paperQuestion 1: Given a string of words return all words which have their reverse present in the string as ( (word1 , reverseword1 ) , (word2 ,reverseword2) )eg .
Input -
Sachin tendulkar is the best tseb eth nihcaS
Output -
{ ( best , tseb ) , ( the , eth) , (Sachin , nihcaS) } Question 2: Finding the just smaller number formed using same number of digits.
Print -1 if not possible .eg
input - 371
output - 317
input - 456
output - -1
Duration: 90 minutes
Total Questions: 27
Round: Technical Interview
Experience: First round of interview was based on basic data structures1. Interviewer asked me to write code for the 2nd maximum element of an array . Then the 3rd and kth largest element in array was discussed .2. Concepts related to binary search tree , uses and comparing complexity .3. Asked about Hashing , Collisions , Implementation for hashing .
Round: Technical Interview
Experience: Question 1: Asked to write code for level order traversal in binary tree. Question was further modified to do a spiral order traversal. Both were supposed to be done in O(n) time complexity .Then he asked me a puzzlehttp://www.programmerinterview.com/index.php/puzzles/3-ants-on-a-triangle-riddle/There was a small discussion about my projects then .Then he started asking questions about operating system
– Mutual exclusion and semaphores .
– Write code for producer consumer problem using semaphores .
After I wrote some pseudo code problem was made more complex by adding further constraints .The interviewer wanted to test my understanding about semaphores and asked some tricky and confusing questions .
Round: Technical Interview
Experience: Question 1: Write code to get maximum and second maximum element of a stack. The given function should be in O(1) complexity .
I gave a solution using 2 additional stacksThen he made it more interesting by extending the question to Find kth largest number from stack at any instance in O(1) time. Stack supports push ,pop , peek , and kthmaximum function .
He was very particular about the O(1) constraint .
I gave plenty of solutions but he wanted me to reach a O(1) solution.
Finally i gave him a solution which used an additional heap and a binary search tree and was able to get O(1) time complexity .Question 2: Given a biotonic array ( first numbers increase and then decrease ) write code to search a given number. Time complexity O(logn)The question was further modified to write code for 4 cases to search –
1 Array could be sorted ascending
2 Array could be sorted descending
3 Array could be first increasing and then decreasing
4 Array could be first decreasing and then increasingThe idea was to first detect which case it was and then search accordingly
Time complexity O(logn)Question was further modified to handle duplicates. In case of duplicates my algorithm became O(n)
Round: TELEPHONIC INTERVIEW
Experience: This round was a telephonic interview with the CTO of the company .First he asked me about database indexing. What ? Why to use indexing ? how is it implemented ?
I gave him a complete explanation
This is a very good explanation
-----.php/database-sql/what-is-an-index/The he started with a small discussion about my projects and research paper .He then moved on to data structures and asked me how to choose a relevant data structure for a given problem .
– I gave him advantages of every data structure and certain problems where specific data structures could be useful .Then he gave a question and asked me for what data structure should be used keeping time complexity in mindQuestion: Given a list of students and their marks write a function that would print all students with marks in a given range l , reg .
Akshay 30
Atul 25
Angay 20
Sahil 10
Then if input is l = 12 and r = 26
Output - Angay, Atul I gave a solution by indexing marks with a link list of students creating an array of link listsHe then modified the questions by adding marks in floating points were also allowed .I gave him a solution using map (c++) based on a key value pair of marks and list of studentsBut he asked to optimize the time complexity
I then gave a modification of my first solution and adding concept of buckets and binary search .He asked me a few hr questions in the end .
College Name: NA
Skills evaluated in this interview
Get interview-ready with Top Hike Interview Questions
Interview Preparation Tips
Experience: 3 sections in all. To be done in 90 minutes
Section A: – 10 aptitude questions (you can find almost every question on indiabix).
Section B: – 13 questions based on C skills.
Section C: – 2 programming questions which were easy.1) Reverse every K nodes in a singly linked list.2) Find out the next greater element having same digits. 1432 -> 2134
5432 -> no greater number
Duration: 90 minutes
Total Questions: 25
Round: Technical Interview
Experience: The interviewer was quite cool and composed.
1 He started with simple question and asked me to write the code of Quick sort but before I could start he said leave it and tell me how you will find out 3rd smallest element from an array.2. Based on first Question, rather than an array you have a large file containing billions of number and from it you have to print Kth minimum element.3. A file containing billion of numbers in unsorted manner is given to you. At run time you will be given two integers ‘m’ and ‘n’. Now print all the numbers from file which lies in this range. He said u can use extra space, no problem with memory but time complexity should be minimum.4. This question was new to me. He told me let’s play a game. I said okay sir :). In this game we will be given even number of cards. Each card will be having some digit written over it. Now both player will play optimally and can only choose card from either corner. He asked me to devise a strategy which would help me winning the game always.
Later he asked me to prove my strategy for the general case
Round: Technical Interview
Experience: Interviewer asked me about chess, rules of chess and all
1. He started with Knight Tour problem in which I have to print the path. Conditions were
I have to cover all the blocks in chess. I can use only 63 moves and solution must be other than backtracking.(most optimal solution). He wanted me to tell him the strategy required to prune the recursion tree.2. Given a file which contains large number of strings.
e.g.:my name is XYZ. My emansi XYZ
i.e. it has words and reverse of words. There can be the case where no reverse word is present
He told me to print all those pair whose reverse is also present in the file.
For above example output will be:
{name,eman}, {is, si}
Constraints were Minimum space should be used and time complexity should be minimum
further he added don’t compute reverse of string at all.
(He was interested in function which I will use to calculate the hash value of string).3. He asked me what my weak point in coding is. I said finding out the corner test cases. At this he caught me and said let see how you will face your fear and give me a code and asked me to generate all the test cases for the program.Later he asked me to write code for printing a helix (spiral matrix)
and write all corner test cases for it.
I wrote solution for NxN but he asked me to write for NxMand do dry run for several test cases.
That is how second round went ?
Round: Technical Interview
Experience: The interviewer was a bit strict.In this round only single Question was asked but it took almost 1 hour.
He asked do you know spell checker in micro soft word. I said yes.He said, you have newspapers of last 20 years. Use these newspapers and suggest most probable words.He gave me example
Input: fon
for this input print
Output: foe, for, fork, fondQuestion seemed easy but when I started he kept adding constraints on data structures used and complexity.I used lexicographical dictionary for this but later he added two more example
he asked me to suggest ‘con’ and ‘ion’ as most probable word for fon.Later he added another example
Browser
BsowerrHe said suggest browser for ‘Bsowerr’.He kept adding examples and constraints.
My solution started from lexicographical dictionary moved to Trie Tree then to Edit Distance problem then HashingHe said why I gave you newspapers rather than Dictionary. From this I got smell of Machine learning
He wanted me to suggest on the basis of currently most frequently used words.And the Question got more complex
and it ended on SUFFIX TREE.
Round: HR Interview
Experience: It was telephonic round taken by the CEO of the company and asked me all HR related Questions.
It was a good experience.
College Name: NA
Jobs at Hike
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 Hike Android Developer Interview Questions and Answers
Android Developer Interview Questions asked at other Companies
I was interviewed before Mar 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical interview round with questions based on DSA.
- Q1.
Binary Tree Traversals
Your task is to compute the In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes, where each node has an integer value.
Input:
T For each test cas... - Ans.
Compute In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes.
Implement tree traversal algorithms: In-Order, Pre-Order, and Post-Order.
Use recursion to traverse the binary tree efficiently.
Handle null nodes represented by -1 in the input.
Follow the order of nodes as they appear in the level order traversal.
Ensure the output is space-separated lists for each traversal type.
- Q2.
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.
Use a combination of hashmap and doubly linked list to implement the LRU cache.
Keep track of the least recently used item and update it accordingly.
Ensure to handle cache capacity by evicting the least recently used item when the cache is full.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA, OS etc.
- Q1.
Number of Islands II Problem Statement
You have a 2D grid of dimensions 'N' rows by 'M' columns, initially filled with water. You are given 'Q' queries, where each query contains two integers 'X' and 'Y'....
- Ans.
The task is to determine the number of islands present on a 2D grid after each query of converting water to land.
Create a function that takes the grid dimensions, queries, and coordinates as input.
For each query, convert the water at the given coordinates to land and update the grid.
Use depth-first search (DFS) to find connected lands and count the number of islands.
Return the number of islands after each query.
- Q2. Why are synchronized blocks needed in Java?
- Ans.
Synchronized blocks are needed in Java to ensure thread safety by allowing only one thread to access a block of code at a time.
Prevents multiple threads from accessing critical sections of code simultaneously
Ensures data consistency and prevents race conditions
Improves performance by reducing contention for shared resources
Example: synchronized block in a method that updates a shared variable
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
Top Hike Software Developer Interview Questions and Answers
Software Developer Interview Questions asked at other Companies
I was interviewed before Mar 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
This test has 2 sections :
Section 1 ( Technical objective questions)
– 25 mcq’s mainly focusing on c , c++ , os , data structures , algorithms
Section 2 ( 2 Coding questions )
– Code was supposed to be written on paper.
- Q1.
Next Greater Number Problem Statement
Given a string
Swhich represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequenc... - Ans.
Given a number represented as a string, find the smallest number greater than the original with the same set of digits.
Sort the digits in non-increasing order to find the next greater number.
Swap the last two digits to get the smallest greater number.
If no greater number exists, return -1.
- Q2.
Reverse Words in a String: Problem Statement
You are given a string of length
N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o... - Ans.
Reverse words in a string by reversing the order of words while maintaining spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
First round of interview was based on basic data structures. Concepts related to binary search tree , uses and comparing complexity were asked. He also asked about Hashing , Collisions.
- Q1.
K Largest Elements Problem Statement
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
Input:
The fir... - Ans.
Find K largest elements in an unsorted array and return them in non-decreasing order.
Sort the array in non-decreasing order
Return the last K elements of the sorted array
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
The interview started with a programming question. Then he asked me a puzzle. There was a small discussion about my projects then .Then he started asking questions about operating system. The interviewer wanted to test my understanding about semaphores and asked some tricky and confusing questions .
- Q1.
Level Order Traversal Problem Statement
Given a binary tree of integers, return the level order traversal of the binary tree.
Input:
The first line contains an integer 'T', representing the number of te... - Ans.
Return the level order traversal of a binary tree given in level order with null nodes represented by -1.
Parse the input to create the binary tree using level order traversal
Use a queue to perform level order traversal and print the nodes in the order visited
Handle null nodes represented by -1 appropriately
- Q2. Explain the Producer-Consumer problem and how it can be solved using semaphores.
- Ans.
Producer-Consumer problem involves multiple threads sharing a common buffer. Producers add items to the buffer while consumers remove them.
Producers and consumers need to synchronize their access to the shared buffer to avoid race conditions.
Semaphores can be used to control access to the buffer. Two semaphores are used - one to track the empty slots in the buffer and one to track the filled slots.
Producers increment t...
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions based on DSA.
- Q1.
Peak Element Finder
For a given array of integers
arr, identify the peak element. A peak element is an element that is greater than its neighboring elements. Specifically, ifarr[i]is the peak, then both... - Ans.
Find the peak element in an array of integers.
Iterate through the array and check if the current element is greater than its neighbors.
Handle edge cases for the first and last elements of the array.
Return the peak element found.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
This round was a telephonic interview with the CTO of the company. The he started with a small discussion about my projects and research paper .He then moved on to data structures and asked me how to choose a relevant data structure for a given problem. I gave him advantages of every data structure and certain problems where specific data structures could be useful .Then he gave a question and asked me for what data structure should be used keeping time complexity in mind. He asked me a few HR questions in the end .
- Q1.
Average Marks Problem Statement
Given the initial letter of a student's name and three integer marks for that student, calculate and display the student's initial letter followed by the integer part of th...
- Ans.
Calculate and display the student's initial letter followed by the integer part of their average marks.
Calculate the average of the three marks provided for each student.
Display the initial letter of the student's name followed by the integer part of the average marks.
Round down the average to the nearest integer to get the integer part.
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
Top Hike Software Developer Interview Questions and Answers
Software Developer Interview Questions asked at other Companies
I was interviewed before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
- Q1.
Running Median Problem
Given a stream of integers, calculate and print the median after each new integer is added to the stream.
Output only the integer part of the median.
Example:
Input:
N = 5
Stre... - Ans.
Calculate and print the median after each new integer is added to the stream.
Use two heaps - a max heap to store the smaller half of the numbers and a min heap to store the larger half.
Keep the sizes of the two heaps balanced to efficiently calculate the median.
If the total number of elements is odd, the median will be the top element of the max heap.
If the total number of elements is even, the median will be the avera
- Q2.
Pair Sum in Binary Search Tree
Given a Binary Search Tree (BST) and a target value 'K', determine if there exist two unique elements in the BST such that their sum equals the target 'K'.
Explanation:
A ...
- Ans.
Given a BST and a target value, determine if there exist two unique elements in the BST such that their sum equals the target.
Traverse the BST in-order to get a sorted array of elements.
Use two pointers approach to find the pair sum in the sorted array.
Keep track of visited elements to ensure uniqueness.
Handle edge cases like null nodes and empty tree.
Example: For input BST [20, 10, 35, 5, 15, 30, 42, -1, 13, -1, -1, -
- Q3.
Statistics From A Large Sample Task
Calculate various statistical measures given a large sample of integers in the range [0, 255]. For efficiency, you are provided with an array 'count' where the i-th ele...
- Ans.
Calculate various statistical measures given a large sample of integers in the range [0, 255] using the provided frequency array.
Iterate through the 'count' array to calculate minimum and maximum values.
Calculate the mean by summing up all values and dividing by the total count.
Find the median by sorting the sample and determining the middle element(s).
Identify the mode by finding the element with the highest frequency...
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA. A puzzle was also asked.
- 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.
Use a combination of hashmap and doubly linked list to efficiently implement the LRU cache.
Keep track of the least recently used item and update it accordingly when inserting new items.
Ensure to handle the capacity constraint by evicting the least recently used item when the cache is full.
- Q2.
Sorting of a Rotated Sorted Array Problem Statement
You are provided with a rotated sorted array of size
N. Your task is to sort the given array in increasing order.Example:
Input:
N = 4
Array = [2, 3,... - Ans.
Implement a function to sort a rotated sorted array in increasing order without using the sort() function.
Find the pivot element in the rotated sorted array.
Split the array into two subarrays based on the pivot element.
Sort each subarray separately.
Merge the sorted subarrays to get the final sorted array.
- Q3. You have 5 pirates and 100 gold coins. The challenge is to determine how the pirates will divide the coins among themselves based on their ranking and the rules they follow.
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
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
Top Hike Software Developer Interview Questions and Answers
Software Developer Interview Questions asked at other Companies
Top trending discussions
Hike Interview FAQs
Some of the top questions asked at the Hike interview -
The duration of Hike interview process can vary, but typically it takes about less than 2 weeks to complete.
Recently Viewed
JOBS
Hike
No Jobs
SALARIES
CONCAST
SALARIES
dezerv
SALARIES
Hike
SALARIES
CONCAST
SALARIES
Bata
INTERVIEWS
RED CHIEF
No Interviews
LIST OF COMPANIES
CONCAST
Overview
SALARIES
CONCAST
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
- Software Developer Interview Questions
- Software Developer Intern Interview Questions
- Team Lead Interview Questions
- Intern Interview Questions
- Senior Associate Interview Questions
- Senior Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Java Developer Interview Questions
- Show more
Hike Interview Process
based on 10 interviews
Interview experience
Explore Interview Questions and Answers for Top Skills at Hike
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
