Daffodil Software interview experience Real time questions & tips from candidates to crack your interview

Software Developer

Daffodil Software
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2
Topics: Data structures, DBMS concepts, OOPs, algorithms, OS
Tip
Tip

Tip 1 : Data structures and Algorithms foundation is a must, all technology and knowledge is just kind of a bummer if DSA is weak. Naive approaches must be clean and clear by everyone. At least complete all easy level questions on leetcode.
Tip 2 : Most of the good companies are basically fond of your mental and technical skills and data structure knowledge. Doesn't matter how bad the complexity you make at the first attempt but you should have at least the way out to solve that problem and then start to think to improve the solution.
Tip 3 : Soft skills are kind of important but not to that extent that it can hide your loopholes in foundation knowledge. Even some personal project is more than enough to balance your presentation.

Application process
Where: Campus
Eligibility: 65%
Resume Tip
Resume tip

Tip 1: Short and clear. 2 pages are maximum.
Tip 2: Project should have links to your github instead of just sentences.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60
Interview date20 Aug 2020
Coding problem3

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.

1. Longest Palindromic Substring

Moderate
35m average time
65% success
0/80
Asked in companies
AmazonGoldman SachsOptum

Given a string ’S’ consisting of lower case English letters, you are supposed to return the longest palindromic substring of ‘S’.

Note that in case of more than one longest palindromic substrings with the same length you need to return the rightmost substring in the given string. For example in string “bbbab”, there are two possible longest palindromic substrings i.e. “bbb” and “bab”, and since you are supposed to return the rightmost substring, so you need to return “bab” as the answer.

Note:
A substring is a contiguous sequence of elements within a string (for example, “bcd” is a substring of “abcde” while “bce” is not).

A string is said to be palindrome if the reverse of the string is the same as the actual string. For example, “abba” is a palindrome, but “abbc” is not a palindrome.
Problem approach

I went for the naive approaches in all questions. Finding all substrings and getting the longest palindrome using backtracking it would be O(n^3) but it can be improved using dynamic programming but I approached a better solution which is expanding the string from the middle the complexity would be O(n^2)

Try solving now

2. Minimum Operations to make strings same

Moderate
25m average time
70% success
0/80
Asked in companies
UberDaffodil Software

Given two strings ‘initial’ and ‘final’ , where ‘initial’ is the initial string and ‘final’ is the final string. Each state will contain ‘a’,’b’ and only one empty slot represented by ‘_’. Your task is to transform the initial string into the final string with the minimum number of operation.

Allowed operations are:

1. You can swap empty character with any adjacent character. (For example, ‘aba_ab’ can be converted into ‘ab_aab’ or ‘abaa_b’).

2. You can swap empty character with next to the adjacent character only if the adjacent character is different from next to the adjacent character. (For example, ‘aba_ab’ can be converted into ‘a_abab’ or ‘ababa_’, but ‘ab_aab’ cannot be converted to ‘abaa_b’ because ‘a’ cannot jump over ‘a’).
Problem approach

Stack is the most famous approach for this question.

Try solving now

3. MegaPrime Numbers

Easy
15m average time
90% success
0/40
Asked in companies
Daffodil SoftwareUnthinkable SolutionsNagarro Software

Given two integers ‘Left’ and ‘Right’. Your task is to find the total count of ‘megaprime’ numbers from the range ‘Left’ to ‘Right’. A ‘megaprime’ number is a prime number and its individual digits are also prime.

For example, ‘53’ is a ‘megaprime’ number because ‘53’ is a prime number and its individual digits,‘3’ and ‘5’, are also prime. ‘13’ is not a ‘megaprime’ number because out of its individual digits (1, 3), ‘1’ is not prime.

Note :

1.’Left’ and ‘Right’ both are inclusive in the range ‘Left’ to ‘Right’.

Example :

‘Left’ = ‘23’  and ‘Right’ = ‘37’

binary_heap

All prime numbers from ‘23’ to ‘37’ are 23, 29, 31, 37

23 is ‘megaprime’ number because ‘2’ and ‘3’ both are prime
29 is not ‘megaprime’ number because ‘9’ is not a prime
31 is not a ‘megaprime’ number because ‘1’ is not a prime number
37 is ‘megaprime’ number because ‘3’ and ‘7’ both are prime numbers
Hence there are two ‘megaprime’ numbers 23, 37 out of 23, 29, 31, 37.
Problem approach

The naive approach by checking the number and all its terms in one iteration is a good enough solution.

Try solving now
02
Round
Hard
Video Call
Duration60
Interview date22 Aug 2020
Coding problem0

Video call round to test my real-time data structures and algorithms skills. Good with core subjects like Operating systems, DBMS, and computer networks. Never let them know your weaker side and loopholes.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
Software Developer
1 rounds | 2 problems
Interviewed by Daffodil Software
1179 views
0 comments
0 upvotes
company logo
Software Developer
2 rounds | 4 problems
Interviewed by Daffodil Software
1606 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Daffodil Software
906 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 8 problems
Interviewed by Daffodil Software
994 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Developer
3 rounds | 3 problems
Interviewed by HCL Technologies
3393 views
1 comments
0 upvotes
company logo
Software Developer
3 rounds | 6 problems
Interviewed by Arcesium
1683 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 5 problems
Interviewed by HCL Technologies
4080 views
0 comments
0 upvotes