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

Software Engineer

Daffodil Software
upvote
share-icon
4 rounds | 8 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 months
Topics: Core java, Java OOPs, DSA, DBMS, SQL query
Tip
Tip

Tip 1 : Strong knowledge of DSA
Tip 2 : Strong knowledge of OOPs
Tip 3 : Good Communication skill

Application process
Where: Campus
Eligibility: More than 7 CGPA
Resume Tip
Resume tip

Tip 1 : Add good project that you know properly 
Tip 2 : Limit your resume to two pages

Interview rounds

01
Round
Medium
Online Coding Interview
Duration45 minutes
Interview date24 Sep 2022
Coding problem3

The first round they shortlisted candidates from all the students, and luckily I am one of them

1. OOPS Questions

Explain types of Polymorphism with their examples (Runtime polymorphism-Method Overriding, Compile-time polymorphism – Method Overloading).

Problem approach

Tip 1 : Be confident
Tip 2 : Be active

2. OOPS Questions

What are the pillars of object-oriented programing? (Inheritance, Encapsulation, Abstraction, Polymorphism).

Problem approach

Tip 1 : Be confident
Tip 2 : Be active

3. DBMS Questions

About indexing in dbms and query of sql like second highest salary questions

Problem approach

Tip 1 : Be confident
Tip 2 : Be active

02
Round
Medium
Face to Face
Duration45 minutes
Interview date24 Sep 2022
Coding problem2

Second round they took an assessment on hacker earth and then they took technical interview

1. Second largest element in the array

Easy
15m average time
80% success
0/40
Asked in companies
Info Edge India (Naukri.com)OracleHCL Technologies

You have been given an array/list 'ARR' of integers. Your task is to find the second largest element present in the 'ARR'.

Note:
a) Duplicate elements may be present.

b) If no such element is present return -1.
Example:
Input: Given a sequence of five numbers 2, 4, 5, 6, 8.

Output:  6

Explanation:
In the given sequence of numbers, number 8 is the largest element, followed by number 6 which is the second-largest element. Hence we return number 6 which is the second-largest element in the sequence.
Problem approach

Tip 1 : Solution should be optimized 
Tip 2 : You are able to explain solution 
Tip 3 : Code should be clear and understandable

Try solving now

2. Diagonal Sum

Easy
23m average time
75% success
0/40
Asked in companies
SamsungMicrosoftAmazon

Given a Binary Tree of 'N' nodes, find and print a list containing the sums of all the diagonals. When calculating the sum of each diagonal, consider the diagonals from right to left.

Diagonals of the binary tree are :

alt-text

There are three diagonals :

Diagonal 1 : 8 10 14

Diagonal 2 : 3 6 7 13

Diagonal 3 : 1 4

Example :

For the given binary tree : 

alt-text

Output : 24 14 2

Explanation: Rightmost diagonal contains elements {5, 10 , 9} its sum is 24, middle diagonal contains elements {6, 3, 5} its sum is 14, leftmost diagonal contains elements {2}. Thus the answer should be “24 14 2”.
Problem approach

Tip 1 : Solution should be optimized 
Tip 2 : You are able to explain solution 
Tip 3 : Code should be clear and understandable

Try solving now
03
Round
Medium
Online Coding Test
Duration45 minutes
Interview date25 Sep 2022
Coding problem2

The third round is face to face technical interview

1. Number Pattern

Easy
0/40
Asked in companies
OlaDaffodil SoftwarePaxcom

Pattern for N = 4

1
23
345
4567
Problem approach

Tip 1 : The solution should be optimized 
Tip 2 : You can explain solution 
Tip 3 : Code should be clear and understandable

Try solving now

2. Intersection Of Two Sorted Arrays

Easy
10m average time
90% success
0/40
Asked in companies
IBMFacebookBig Basket

You are given two arrays 'A' and 'B' of size 'N' and 'M' respectively. Both these arrays are sorted in non-decreasing order. You have to find the intersection of these two arrays.

Intersection of two arrays is an array that consists of all the common elements occurring in both arrays.

Note :
1. The length of each array is greater than zero.
2. Both the arrays are sorted in non-decreasing order.
3. The output should be in the order of elements that occur in the original arrays.
4. If there is no intersection present then return an empty array.
Problem approach

Tip 1 : Solution should be optimized 
Tip 2 : You are able to explain solution 
Tip 3 : Code should be clear and understandable

Try solving now
04
Round
Medium
HR Round
Duration45 minutes
Interview date25 Sep 2022
Coding problem1

This is the HR round where HR ask some questions related to your hobbies and all that

1. Basic HR Questions

Introduce yourself

What are your hobbies?

What are your strengths and weaknesses?

Are you in for a bond for 2 years?

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 Engineer
2 rounds | 3 problems
Interviewed by Daffodil Software
1008 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8518 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3320 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
2580 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
4 rounds | 1 problems
Interviewed by Newgen Software
3210 views
2 comments
0 upvotes
company logo
Software Engineer
3 rounds | 6 problems
Interviewed by HashedIn
2582 views
0 comments
0 upvotes
company logo
Software Engineer
2 rounds | 2 problems
Interviewed by Ernst & Young (EY)
0 views
0 comments
0 upvotes