AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Hike Interview Questions and Answers for Freshers
15 Interview questions
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 reservoi...
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
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
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)
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]
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
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.
Infix to Postfix Conversion
Convert a given infix expression, represented as a string EXP, into its equivalent postfix expression.
Explanation:
An infix expression is formatted as a op b where the operat...
Convert infix expression to postfix expression.
Use a stack to keep track of operators and operands.
Follow the rules of precedence for operators.
Handle parentheses to ensure correct order of operations.
Maximum Difference in Matrix
Given an n x n matrix mat[n][n] of integers, find the maximum value of mat[c][d] - mat[a][b] for all possible indices where c > a and d > b.
Input:
The first line conta...Find the maximum difference between elements in a matrix with specific conditions.
Iterate through all possible pairs of indices (a, b) and (c, d) where c > a and d > b.
Calculate the difference between mat[c][d] and mat[a][b] for each pair.
Keep track of the maximum difference found so far.
Return the maximum difference as the final result.
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' denotes the number of columns. Your ta...
Find the maximum area of a submatrix with all 1's in a binary matrix.
Iterate over each cell in the matrix and calculate the maximum area of submatrix with that cell as the top-left corner.
Use dynamic programming to keep track of the maximum width of 1's ending at each cell.
Update the maximum area as you iterate through the matrix.
Return the maximum area found.
Hike Interview Experiences for Freshers
6 interviews found
Anonymous
I appeared for an interview in Feb 2021.
(4 Questions)
Round duration - 90 minutes
Round difficulty - Medium
Timing was 10AM. The platform was quite good.
- Q1.
Maximum Size Rectangle Sub-matrix with All 1's Problem Statement
You are provided with an
N * Msized binary matrix 'MAT' where 'N' denotes the number of rows and 'M' denotes the number of columns. Your t... - Ans.
Find the maximum area of a submatrix with all 1's in a binary matrix.
Iterate over each cell in the matrix and calculate the maximum area of submatrix with that cell as the top-left corner.
Use dynamic programming to keep track of the maximum width of 1's ending at each cell.
Update the maximum area as you iterate through the matrix.
Return the maximum area found.
- Q2.
Binary Tree Maximum Path Sum Problem Statement
Determine the maximum path sum for any path in a given binary tree with 'N' nodes.
Note:
- A 'path' is defined as any sequence of adjacent nodes connected...
- Ans.
Find the maximum path sum in a binary tree with 'N' nodes.
Traverse the binary tree to find all possible paths and calculate their sums.
Keep track of the maximum sum encountered during traversal.
Consider both left and right child nodes while calculating the path sum.
Handle null nodes represented by '-1' in the input.
Return the maximum path sum for each test case.
- Q3.
Minimum Number of Swaps to Sort an Array
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
Input:
T (number of test cases)
For each test case:
N (siz... - Ans.
The minimum number of swaps required to sort a given array of distinct elements in ascending order.
Use graph theory to solve the problem by counting cycles in the permutation.
The number of swaps needed is equal to the number of cycles in the permutation minus one.
Consider using a hashmap to keep track of visited elements to optimize the solution.
Example: For input array [4, 3, 2, 1], the minimum number of swaps require...
- Q4.
Infix to Postfix Conversion
Convert a given infix expression, represented as a string
EXP, into its equivalent postfix expression.Explanation:
An infix expression is formatted as
a op bwhere the opera... - Ans.
Convert infix expression to postfix expression.
Use a stack to keep track of operators and operands.
Follow the rules of precedence for operators.
Handle parentheses to ensure correct order of operations.
Interview Preparation Tips
Tip 1 : Do at least 1 project.
Tip 2 : Practice data structure questions.
Tip 3 : Dynamic programming is must.
Tip 1 : Do not put false things.
Tip 2 : Keep it short and direct.
Skills evaluated in this interview
I appeared for an interview in Feb 2021.
(4 Questions)
Round duration - 90 minutes
Round difficulty - Medium
Timing was 10AM. The platform was user-friendly.
- Q1.
Maximum Size Rectangle Sub-matrix with All 1's Problem Statement
You are provided with an
N * Msized binary matrix 'MAT' where 'N' denotes the number of rows and 'M' denotes the number of columns. Your t... - Ans.
Find the maximum area of a submatrix with all 1's in a binary matrix.
Iterate over each cell in the matrix and calculate the maximum area of submatrix with that cell as the top-left corner.
Use dynamic programming to keep track of the maximum width of 1's ending at each cell.
Update the maximum area as you iterate through the matrix.
Return the maximum area found.
- Q2.
Binary Tree Maximum Path Sum Problem Statement
Determine the maximum path sum for any path in a given binary tree with 'N' nodes.
Note:
- A 'path' is defined as any sequence of adjacent nodes connected...
- Ans.
Find the maximum path sum in a binary tree with 'N' nodes.
Traverse the binary tree to find the maximum path sum.
Keep track of the maximum sum encountered so far.
Consider all possible paths in the tree to find the maximum sum.
Example: For input 1 2 3 4 -1 5 6 -1 -1 -1 -1 -1 -1, the maximum path sum is 16.
- Q3.
Minimum Number of Swaps to Sort an Array
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
Input:
T (number of test cases)
For each test case:
N (siz... - Ans.
Find the minimum number of swaps required to sort an array of distinct elements in ascending order.
Use graph theory to solve the problem by considering each element as a node and edges representing the swaps needed to sort the array
Implement a graph-based approach like cycle detection to find the minimum number of swaps required
Consider using an efficient sorting algorithm like bubble sort or selection sort to minimize...
- Q4.
Prefix to Infix Conversion
Transform a string representing a valid Prefix expression, which may contain operators '+', '-', '*', '/', and uppercase letters, into its corresponding Infix expression.
Examp...
- Ans.
Convert a valid Prefix expression to its corresponding Infix expression.
Use a stack to store operands and operators while traversing the prefix expression from right to left.
Pop operands from the stack and form the infix expression by placing them between corresponding operators.
Handle the precedence of operators to ensure correct order of operations.
Ensure to handle parentheses to maintain the correct evaluation order...
Interview Preparation Tips
Tip 1 : Atleast 1 project
Tip 2 : Practice data structures
Tip 1 : Keep it short
Tip 2 : Don't put false information
Skills evaluated in this interview
I appeared for an interview in Feb 2021.
(4 Questions)
Round duration - 90 minutes
Round difficulty - Medium
Timing was 10AM. The platform was quite good.
- Q1.
Maximum Size Rectangle Sub-Matrix with All 1's
Given an N x M binary matrix 'MAT', where N is the number of rows and M is the number of columns, determine the maximum area of a submatrix consisting entire...
- Ans.
Find the maximum area of a submatrix consisting entirely of 1's in a binary matrix.
Iterate over each cell in the matrix and calculate the maximum area of a submatrix with that cell as the top-left corner.
Use dynamic programming to keep track of the maximum width of 1's ending at each cell in the current row.
Update the maximum area as you iterate through the matrix and consider each cell as the bottom-right corner of th...
- Q2.
Maximum Sum Path in a Binary Tree
Your task is to determine the maximum possible sum of a simple path between any two nodes (possibly the same) in a given binary tree of 'N' nodes with integer values.
Ex...
- Ans.
Find the maximum sum of a simple path between any two nodes in a binary tree.
Use a recursive approach to traverse the binary tree and calculate the maximum sum path.
Keep track of the maximum sum path found so far while traversing the tree.
Consider negative values in the path sum calculation to handle cases where the path can skip nodes.
Update the maximum sum path if a new path with a higher sum is found.
- Q3.
Minimum Number of Swaps to Sort an Array
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
Input:
T (number of test cases)
For each test case:
N (siz... - Ans.
The minimum number of swaps required to sort a given array of distinct elements in ascending order.
Use a graph-based approach to find cycles in the array for swapping
Count the number of swaps needed to sort the array
Example: For [4, 3, 2, 1], 2 swaps are needed to sort it to [1, 2, 3, 4]
- Q4.
Prefix to Infix Conversion
Transform a string representing a valid Prefix expression, which may contain operators '+', '-', '*', '/', and uppercase letters, into its corresponding Infix expression.
Examp...
- Ans.
Convert a valid Prefix expression to its corresponding Infix expression.
Use a stack to store operands and operators while traversing the prefix expression from right to left.
Pop operands from the stack and form the infix expression by placing them between corresponding operators.
Handle the precedence of operators to ensure correct order of operations in the infix expression.
Interview Preparation Tips
Tip 1 : Do at least 1 project.
Tip 2 : Practice data structure questions.
Tip 3 : Dynamic programming is must.
Tip 1 : Do not put false things.
Tip 2 : Keep it short and direct.
Skills evaluated in this interview
I appeared for an interview in Jan 2021.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
Maximum Difference in Matrix
Given an
n x nmatrixmat[n][n]of integers, find the maximum value ofmat[c][d] - mat[a][b]for all possible indices wherec > aandd > b.Input:
The first line cont... - Ans.
Find the maximum difference between elements in a matrix with specific conditions.
Iterate through all possible pairs of indices (a, b) and (c, d) where c > a and d > b.
Calculate the difference between mat[c][d] and mat[a][b] for each pair.
Keep track of the maximum difference found so far.
Return the maximum difference as the final result.
Round duration - 20 Minutes
Round difficulty - Easy
Interview Preparation Tips
Tip 1 : Try solving Love Babbar 450 Prog questions
Tip 2 : Have a good resume
Tip 3 : Do learn some extra technologies eg. ML/AI
Tip 1 : Do not lie at all
Tip 2 : Have some projects listed
Skills evaluated in this interview
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
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
Top trending discussions
Interview questions from similar companies
(1 Question)
- Q1. DSA Questions on ant topic
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
(2 Questions)
- Q1. Differences between RAM, HDD and SSD.
- Ans.
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...
- Q2. Given a grid with multiple products and starting from top left, how to reach bottom right collecting max number of products, and moving only right or down.
Skills evaluated in this interview
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.
(2 Questions)
- Q1. Remove the last element from a linkedlist
- Ans.
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
- Q2. Some basic questions on oops dbms and os
Skills evaluated in this interview
I applied via Instahyre and was interviewed in Oct 2024. There was 1 interview round.
(1 Question)
- Q1. Design LLD for Parking Lot
- Ans.
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
Skills evaluated in this interview
Hike Interview FAQs
Some of the top questions asked at the Hike interview for freshers -
The duration of Hike interview process can vary, but typically it takes about less than 2 weeks to complete.
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
- Senior Executive Interview Questions
- Team Lead Interview Questions
- Business Analyst Interview Questions
- Senior Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Graduate Engineer Trainee (Get) Interview Questions
- Show more
Explore Interview Questions and Answers for Top Skills at Hike
Interview Questions from Similar Companies
|
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
- Home >
- Interviews >
- Hike Interview Questions >
- Hike Interview Questions for Fresher
