← All openings

2027 Intern - Research PhD Intern

Adobe · Bangalore

InternshipFrom Adobe's careers sitePosted 20 Oct 2026

Sign up free to apply and see Adobe's interview prep

The apply link, the hiring process, the test pattern, what to study and interview questions for Adobe.

Sign up freeLog in

Company

Adobe

Role type

Internship

Location

Bangalore

Apply by

Open now, apply early

About this internship

Who can apply: Internship

From Adobe's careers site, posted 20 Oct 2026. Apply on Adobe's own page; HireSol never charges to apply.

Interview prep

How Adobe hire freshers

Adobe looks for strong DSA and CS fundamentals; interviews often go deep into one problem with follow-ups.

The usual process

  1. Online test: coding plus aptitude or CS MCQs
  2. 2–4 technical interviews
  3. A director or HR round

Online test pattern

Coding
2 problems
MCQ
Aptitude, OS, DBMS, C/C++ output

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. 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. 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. 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. 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.

6 more questions with answers, free

Sign up free to see them all, get the apply link, and get new openings every morning.

Sign up free

Based on what candidates commonly report; companies change their process every season. Always check the official notice. HireSol isn't affiliated with Adobe.

More openings in Bangalore

All openings →