AI Researcher Intern
HackerRank · Onsite in Bangalore
Sign up free to apply and see HackerRank's interview prep
The apply link, the hiring process, the test pattern, what to study and interview questions for HackerRank.
Company
HackerRank
Role type
Internship
Location
Onsite in Bangalore
Apply by
Open now, apply early
About this internship
Who can apply: Internship
From HackerRank's careers site, posted 28 Oct 2026. Apply on HackerRank's own page; HireSol never charges to apply.
Interview prep
How companies like HackerRank hire freshers
Product companies hire freshers mainly on problem solving: data structures and algorithms in an online test, then technical interviews where you code and explain your thinking.
The usual process
- Online assessment: 2–3 coding problems, sometimes MCQs on CS fundamentals
- 1–3 technical interviews: DSA problems, your projects, CS fundamentals
- A final or hiring-manager round: projects, teamwork and motivation
Online test pattern
- Coding
- 2–3 problems in 60–90 minutes, easy to medium
- CS MCQs (some companies)
- OOP, DBMS, OS, networks, output prediction
What to study
- •Arrays, strings and hashing (two pointers, sliding window, prefix sums)
- •Linked lists, stacks and queues (monotonic stack, LRU-style design)
- •Binary search, including on the answer
- •Trees and binary search trees (traversals, lowest common ancestor, views)
- •Graphs: BFS, DFS, topological sort, shortest paths, union-find
- •Heaps and greedy (top-k, intervals, scheduling)
- •Dynamic programming (knapsack, LIS, grid paths, partitions)
- •OOP, DBMS (joins, indexes, normalisation), OS (processes, threads, deadlock) and computer networks basics
Interview questions to practise
1.Find two numbers in an array that add up to a target.
How to answer: Start with the O(n²) idea, then improve to O(n) with a hash map. Say the complexity out loud before coding.
2.Return the length of the longest substring without repeating characters.
How to answer: Sliding window with a map of last-seen positions. Walk through an example like "abba" to show you handle the left pointer.
3.Detect a cycle in a linked list and find where it starts.
How to answer: Floyd's slow and fast pointers. Be ready to explain why resetting one pointer to the head finds the start.
4.Print the level-order traversal of a binary tree, one line per level.
How to answer: BFS with a queue, processing the queue's size at each level. Mention the recursive DFS alternative.
8 more questions with answers, free
Sign up free to see them all, get the apply link, and get new openings every morning.
Sign up freeBased on what candidates commonly report; companies change their process every season. Always check the official notice. HireSol isn't affiliated with HackerRank.