Hike interview questions
Online test → Technical → Technical·93% entry level
DSA
Showing 27 of 80 reported in this area
Reverse a linked list
Shuffle a given array using the Fisher-Yates shuffle algorithm
Find the median of a stream of numbers.
Find the n/m-th element of a linked list
Reverse alternate levels of a binary tree.
Reverse every K nodes in a singly linked list
Design and implement an LRU (Least Recently Used) cache.
Convert a Binary Search Tree into a sorted doubly linked list
Perform level order traversal of a binary tree in spiral form
Design a stack that supports push, pop, and getMin() in O(1) time.
Given preorder and postorder traversals of a BST, construct the tree.
Define a doubly linked list and write a program to reverse it in-place
Search an element in a sorted array that has been rotated at some pivot.
Find all nodes at a given distance K from a target node in a binary tree.
Given a number, find the next higher number formed using the same digits.
Given two linked lists, determine if they merge and find the merging point.
Print all the corner nodes of a binary tree clockwise starting from the root
Implement inorder traversal of a binary tree with and without using recursion.
Nut and bolt problem: match nuts and bolts efficiently without direct comparisons
Given a 2D binary matrix, find the largest square sub-matrix consisting of all 1s.
Merge two sorted linked lists. Follow-up: merge k sorted linked lists efficiently.
Word Break problem: determine if a string can be segmented into valid dictionary words
Generate all corner test cases for a spiral (helix) matrix printing program for an N×M matrix
Given a sorted array that is rotated K times, sort it in O(n) time without using extra space.
Minimum number of platforms required for a railway or bus station given arrival and departure times
Given a bitonic array (first increasing then decreasing), search for a given number in O(log n) time.
Given two arrays, sort the first array according to the relative ordering defined by the second array.
CS fundamentals
Showing 21 of 62 reported in this area
Compare inheritance in C++ and Java.
Explain various CPU scheduling algorithms
Why is a synchronized block needed in Java?
Explain how HashMap works internally in Java.
Explain concepts related to multithreading in Java.
How does image caching work in Android applications?
Explain the CAP theorem and where Cassandra fits in it
Implement Java 8 Future and a related concurrency class
Explain ConcurrentHashMap and how it differs from HashMap.
Explain different caching mechanisms available in Android.
Explain processes, semaphores, and basic networking concepts.
Explain memory allocation for a 2D array using pointers in C++.
Discuss hashing techniques and operating system related algorithms.
Explain basics of distributed storage, parallel processing, and Hadoop
Explain SoftReference and WeakReference in Android and their use cases.
Write SQL queries for the given database tables provided by the interviewer.
What problems arise in multithreaded applications and how can they be solved?
Compare hashing and B-trees, and explain which is better under different use cases
Deep discussion on NoSQL databases with focus on Couchbase internals like vBuckets
Explain how HashMap is implemented in Java, including collision handling and resizing.
What problems occur when multiple threads update a stack concurrently and how can they be handled?
System design
Showing 5 of 17 reported in this area
Design a URL shortener service
Design a file sharing mechanism between two users.
How would you analyze the usage history of an application?
Design a system where users share images and the system tracks the top trending images
Design a leaderboard system that reports the rank of a user along with +/- 5 neighboring users
Puzzles
Showing 3 of 8 reported in this area
Calculate the velocity of a swipe gesture performed by a user on a mobile screen.
100 people are standing in a circle with a gun; the first person kills the second and passes the gun. Who survives?
Solve the puzzle: Three ants are on the vertices of a triangle and start moving randomly along the edges. What is the probability that they do not collide?
Behavioural
3 questions reported in this area
How will you handle pressure at work?
asked oncePractice this →
Is India ready for electric vehicles (EVs)?
asked oncePractice this →
How will you add value to the country through your work?
asked oncePractice this →
Aptitude
Showing 1 of 2 reported in this area
General aptitude and logical reasoning questions.
asked oncePractice this →
Showing 60 of 153 questions. Ranked by how often the same question came back across reports.
Practise a Hike-style interview
A spoken interview built from these questions, scored when you finish; the report is yours.
Start practisingCommon questions
What questions does Hike ask?
Candidate interview reports most often cover DSA (47%) and CS fundamentals (36%).
How many rounds does Hike interview have?
Candidate interview reports show an average of 4.3 rounds per experience, with a typical sequence of Online test → Technical → Technical. Individual interview paths can vary.
Is the Hike interview hard?
Among questions with a reported difficulty, the mix is easy 32%, medium 51%, hard 17%.