EDIFI Interview Experience for Fresher SDE - Intern, Oct 2020

Posted: 14 Dec 2020

Rejected

Interview Rounds

Application Process

Round 1

Interview Process

Video Call

Moderate

Duration:

100 minutes

Interview-Date:

7 Oct 2020

Problems:

Maximum Equal Stack Sum

Given three filled stacks namely ‘stack1’ ‘stack2’ and ‘stack3’ of positive numbers, the task is to find the possible equal maximum sum of the stacks with the removal of top elements allowed.

Try Problem

See my Approach

Preparation

Duration:

3 months

Topics:

Data structures, Inheritance in Java, OOps , Dynamic Programming System Software SHell scripting

Preparation Tip

Tip 1 : Be calm and introduce well
Tip 2 : Ask relevant doubts about the questions asked.
Tip 3 : Explain your projects well

Application Process

Where:

Referral

Eligibility:

Development projects needed

Resume Tip

Tip 1 : Make a well-formatted resume with numbers and facts and not stars etc.
Tip 2 : Have good projects either hosted live or on GitHub with a good readme

0 upvotes

Have an interview experience that you want to contribute?

PreviousNext

Start a Discussion

EDIFI Mock Interviews

For college students & professionals looking to get into EDIFI

Similar Experiences

Categories:

Coding courses for beginners |

Web Development Courses |

Data Science & Machine Learning Courses |

Competitive Programming Course |

Android App Development Courses |

Courses for interview preparation

Popular Courses:

C++ Foundation with Data Structures |

Java Foundation with Data Structures |

Python Foundation with Data Structures |

Competitive Programming |

Full Stack Web Development

Career Tracks:

Ninja Competitive Programmer Track |

Ninja Android Developer Career Track |

Ninja Web Developer Career Track - NodeJS & ReactJs |

Ninja Web Developer Career Track - NodeJS |

Ninja Data Scientist Career Track |

Ninja Machine Learning Engineer Career Track

EDIFI Interview Experience for Fresher SDE - Intern, Oct 2020

Interview Process

Video Call

Given three filled stacks namely ‘stack1’ ‘stack2’ and ‘stack3’ of positive numbers, the task is to find the possible equal maximum sum of the stacks with the removal of top elements allowed.

Preparation

Application Process

Similar Experiences

Interested in Coding Ninjas Flagship Courses?