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

SDE - 1

Vinove Software & Services

5 rounds | 5 Coding problems

Safalata singh

Fresher | Dec 2020

Selected

Interview preparation journey

Preparation

Duration: 2 months

Topics: DBMS, Data structures, Basics of Web development, OS, OOPS, Sorting and Searching Algorithms

Tip

Tip 1 : Must go for interviews questions present online for topics you have mentioned.
Tip 2 : Be updated with the latest technology and have those concepts clear in your mind and do prepare your projects and have a clear picture of it to explain that
Tip 3 : For preparing algorithms do practice them, that is the best way and lastly you can check your knowledge by solving mcqs and quizzes of those topics to have confidence.

Application process

Where: Campus

Eligibility: Just the graduation year and some web development skills

Resume tip

Tip 1 : Do not mention anything in your resume that you are not confident about. And prepare your resume well before interview.
Tip 2 : Mention your projects and technical skills and your github link to showcase your project portfolio that will have a great impression

Interview rounds

Round

Medium

Online Coding Interview

Duration60 minutes

Interview date10 Dec 2020

Coding problem1

The round had quantitative questions along with some logical reasoning and english section and fundamentals of DBMS ,OS and Data structures and some other such topics

1. OS Question

Disk scheduling

Problem approach

Tip 1 : Remember the technique to solve such question.

Round

Medium

Online Coding Test

Duration90 minutes

Interview date10 Dec 2020

Coding problem1

The editor and the environment was great and not disturbing like many have.
They had their own test cases to check the scope of our code.

1. Maximum Subarray Sum

Moderate

25m average time

75% success

0/80

Asked in companies

Given an array of numbers, find the maximum sum of any contiguous subarray of the array.

For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.

Given the array [-5, -1, -8, -9], the maximum sum would be -1.

Follow up: Do this in O(N) time.

Problem approach

Tip 1 : Used dictionary to find the sum of the number.

Try solving now

Round

Medium

Online Coding Interview

Duration40 minutes

Interview date10 Dec 2020

Coding problem1

It had only mcq questions but we could not navigate through the questions it had some reasoning and some dbms topics along with data structure ,memory ,cache memory and other topics

1. SQL Question

Finding the age of the employee from personal details table .

Problem approach

Tip 1 : do practice sql queries and joins and some clauses

Round

Medium

Video Call

Duration10 minutes

Interview date19 Dec 2020

Coding problem1

The interviewer was polite and asked few questions from data structures and some from DBMS and some web question and about my project.

1. DBMS Question

Difference between primary key and candidate key

Problem approach

Tip 1 : do check all the differences between keys in DBMS and other concepts as well and have a clear concept of other topics as well

Round

Medium

HR Round

Duration12 minutes

Interview date21 Dec 2020

Coding problem1

The interviewer asked me about my project and told me to describe myself in one word and justify that and asked my personal skills and asked some technical questions as well

1. Technical Question

What is pickling?

Problem approach

Tip 1 : do prepare your resume and keep yourself updated according to that as questions are raised from that.
Tip 2 : If you have mentioned some latest technology then you should have basic idea about that and go through the interview questions from that topic which will really be helpful.