Adobe Topics for Interview Preparation

Last Updated : 23 Jul, 2025

Table of Content


Easy Level

  1. Check if a number is Palindrome
  2. Check if a given Binary Tree is SumTree
  3. Count pairs (a, b) whose sum of cubes is N (a^3 + b^3 = N)
  4. Count set bits in an integer
  5. Program for Binary To Decimal Conversion
  6. QuickSort
  7. Find the middle of a given linked list in C and Java
  8. Write an Efficient Function to Convert a Binary Tree into its Mirror Tree
  9. Write one line C function to find whether a no is power of two
  10. Write your own atoi()
  11. Breadth First Traversal or BFS for a Graph
  12. How to check if two given line segments intersect?
  13. Copy set bits in a range
  14. Count all distinct pairs with difference equal to k
  15. Count Inversions in an array | Set 1 (Using Merge Sort)
  16. Design and Implement Special Stack Data Structure | Added Space Optimized Version
  17. Dynamic Programming | Set 18 (Partition problem)
  18. Equilibrium index of an array
  19. Find length of loop in linked list
  20. Find the Longest Increasing Subsequence in Circular manner
  21. Find the minimum element in a sorted and rotated array
  22. Find next greater number with same set of digits
  23. Implement Stack using Queues
  24. Level order traversal in spiral form
  25. Merge Sort for Linked Lists
  26. Find n'th node from the end of a Linked List
  27. Program for n'th node from the end of a Linked List
  28. Pascal's Triangle
  29. Print Right View of a Binary Tree
  30. Put spaces between words starting with capital letters
  31. Implement Queue using Stacks
  32. Remove duplicates from a sorted linked list
  33. Reverse Level Order Traversal
  34. Reverse words in a given string
  35. Root to leaf path sum equal to a given number
  36. Search an element in a sorted and rotated array
  37. Serialize and Deserialize a Binary Tree
  38. Sort a linked list of 0s, 1s and 2s
  39. Sort an array of 0s, 1s and 2s
  40. Sort an array after applying the given equation
  41. Trapping Rain Water
  42. Write a function to reverse a linked list

Medium Level

  1. A program to check if a binary tree is BST or not
  2. Check if a given array can represent Preorder Traversal of Binary Search Tree
  3. Combinational Sum
  4. Connect nodes at same level
  5. Detect Cycle in a Directed Graph
  6. Detect cycle in an undirected graph
  7. Dynamic Programming | Set 31 (Optimal Strategy for a Game)
  8. Find whether there is path between two cells in matrix
  9. Greedy Algorithms | Set 7 (Dijkstra's shortest path algorithm)
  10. Minimize the maximum difference between the heights
  11. Minimum number of jumps to reach end
  12. Multiply Large Numbers represented as Strings
  13. Nuts & Bolts Problem (Lock & Key problem)
  14. Quickhull Algorithm for Convex Hull
  15. Reverse a Linked List in groups of given size


Hard Level

  1. Construct a Binary Tree from Postorder and Inorder
  2. Implement LRU Cache
  3. Median in a stream of integers (running integers)
Comment
Article Tags:
Interview Experiences
Adobe

Explore