Daffodil Software Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA, OOPS, DBMS and some SQL queries.

Q1. 
Find the Second Largest Element
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
Example:
Input:
ARR = [2,...read more
Ans. 
Find the second largest element in an array of integers.
• Iterate through the array to find the largest and second largest elements.

• Handle cases where all elements are identical.

• Return -1 if second largest element does not exist.
Answered by AI
Add your answer
Q2. 
Triangle of Numbers Pattern
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
Example:
Input:
N = 4
Output:
   1
  232
 34545
4567654
Explanation:
The pat...read more
Ans. 
Print a triangle pattern of numbers based on given input 'N'.
• Iterate through each row and print the numbers in a centered and incremented manner

• Use nested loops to handle the alignment and incrementing of numbers

• Ensure to properly format the output with spaces for alignment
Answered by AI
Add your answer
Q3. Can you explain the OOP concepts in C++?
Ans. 
OOP concepts in C++ include classes, objects, inheritance, polymorphism, and encapsulation.
• Classes are user-defined data types that contain data members and member functions.

• Objects are instances of classes that can interact with each other.

• Inheritance allows a class to inherit properties and behavior from another class.

• Polymorphism enables objects to be treated as instances of their parent class.

• Encapsulation restrict...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Round duration - 60 Minutes
Round difficulty - Medium

First-round was the machine test coding round on HackerEarth with a decent level of questions on data structures and algorithms. It consists of 3 questions 2 medium and 1 easy to moderate in 60 minutes.

Q1. 
Find the Longest Palindromic Substring
Given a string ‘S’ composed of lowercase English letters, your task is to identify the longest palindromic substring within ‘S’.
If there are multiple longest palin...read more
Ans. 
Find the longest palindromic substring in a given string, returning the rightmost one if multiple substrings are of the same length.
• Iterate through each character in the string and expand around it to find palindromic substrings

• Keep track of the longest palindromic substring found so far

• Return the rightmost longest palindromic substring
Answered by AI
Add your answer
Q2. 
Minimum Operations to Transform Strings
You are provided with two strings initial and final. Each string consists of characters 'a', 'b', and one empty slot represented by '_'. Your task is to transform t...read more
Ans. 
The task is to transform one string into another by swapping characters with an empty slot, using the minimum number of operations.
• Iterate through the strings character by character and count the number of operations needed to transform one string into another.

• Consider the allowed operations and their conditions while counting the operations.

• Return the total number of operations needed for each test case.
Answered by AI
Add your answer
Q3. 
MegaPrime Numbers Problem Statement
Given two integers Left and Right, determine the count of 'megaprime' numbers within the inclusive range from 'Left' to 'Right'. A 'megaprime' number is a prime number ...read more
Ans. 
Count the 'megaprime' numbers within a given range of integers.
• Iterate through the range of integers from Left to Right.

• For each number, check if it is a prime number and if all its digits are prime.

• Increment the count if the number satisfies the conditions.

• Return the total count of 'megaprime' numbers.
Answered by AI
Add your answer