Adobe Topics for Interview Preparation



Easy Level Medium Level Hard Level

Easy Level



  • Check if a number is Palindrome

  • Check if a given Binary Tree is SumTree

  • Count pairs (a, b) whose sum of cubes is N (a^3 + b^3 = N)

  • Count set bits in an integer

  • Program for Binary To Decimal Conversion

  • QuickSort

  • Find the middle of a given linked list in C and Java

  • Write an Efficient Function to Convert a Binary Tree into its Mirror Tree

  • Write one line C function to find whether a no is power of two

  • Write your own atoi()

  • Breadth First Traversal or BFS for a Graph

  • How to check if two given line segments intersect?

  • Copy set bits in a range

  • Count all distinct pairs with difference equal to k

  • Count Inversions in an array | Set 1 (Using Merge Sort)

  • Design and Implement Special Stack Data Structure | Added Space Optimized Version

  • Dynamic Programming | Set 18 (Partition problem)

  • Equilibrium index of an array

  • Find length of loop in linked list

  • Find the Longest Increasing Subsequence in Circular manner

  • Find the minimum element in a sorted and rotated array

  • Find next greater number with same set of digits

  • Implement Stack using Queues

  • Level order traversal in spiral form

  • Merge Sort for Linked Lists

  • Find n'th node from the end of a Linked List

  • Program for n'th node from the end of a Linked List

  • Pascal's Triangle

  • Print Right View of a Binary Tree

  • Put spaces between words starting with capital letters

  • Implement Queue using Stacks

  • Remove duplicates from a sorted linked list

  • Reverse Level Order Traversal

  • Reverse words in a given string

  • Root to leaf path sum equal to a given number

  • Search an element in a sorted and rotated array

  • Serialize and Deserialize a Binary Tree

  • Sort a linked list of 0s, 1s and 2s

  • Sort an array of 0s, 1s and 2s

  • Sort an array after applying the given equation

  • Trapping Rain Water

  • Write a function to reverse a linked list



  • Medium Level



  • A program to check if a binary tree is BST or not

  • Check if a given array can represent Preorder Traversal of Binary Search Tree

  • Combinational Sum

  • Connect nodes at same level

  • Detect Cycle in a Directed Graph

  • Detect cycle in an undirected graph

  • Dynamic Programming | Set 31 (Optimal Strategy for a Game)

  • Find whether there is path between two cells in matrix

  • Greedy Algorithms | Set 7 (Dijkstra's shortest path algorithm)

  • Minimize the maximum difference between the heights

  • Minimum number of jumps to reach end

  • Multiply Large Numbers represented as Strings

  • Nuts & Bolts Problem (Lock & Key problem)

  • Quickhull Algorithm for Convex Hull

  • Reverse a Linked List in groups of given size

  • Given an a



  • Hard Level



  • Construct a Binary Tree from Postorder and Inorder

  • Implement LRU Cache

  • Median in a stream of integers (running integers)









  • Company Wise Coding Practice    Topic Wise Coding Practice