Adobe Interview Experience for Fresher Software Quality Engineer, Jan 2020
Online Coding Interview
Type of Questions No. of Questions
Logical and Reasoning 20
Section II: Coding Section
Number of Questions: 2
Time Duration: 60 min
Level of Difficulty: Easy-Medium
Type of Questions: String Manipulation and Tree based Question
Given a binary tree, convert this binary tree into its mirror tree.
A binary tree is a tree in which each parent node has at most two children.
Given a string ‘str’. Find the minimum number of partitions to make in the string such that every partition of the string is a palindrome.
Tip 1 : Have strong knowledge of the basic concepts of DS and Programming
Tip 2 : Be Confident and have faith in yourself
Tip 3 : Have a Strong Balanced Resume
Tip 1 : Good Projects
Tip 2 : Maintain a good balance in all the sections of the resume