Synoverge technologies pvt. Ltd interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Synoverge technologies pvt. Ltd
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
During my B Tech, I started practising coding questions and participating in interview mocks.Till then, I solved many questions in all the practicing websites.
Application story
This was an on-campus opportunity. I applied through the college placement cell. The first resume shortlisting was performed. After the online test 15 candidates were selected for interviews.
Why selected/rejected for the role?
I was able to get all answers correctly and design given problem optimally thats why i got selected for this role.
Preparation
Duration: 4 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip
Tip

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Interview rounds

01
Round
Easy
Video Call
Duration50 minutes
Interview date4 Jun 2019
Coding problem2

Process was smooth and easy. Interviewers were quire friendly.

1. Sort 0 1 2

Easy
22m average time
0/40
Asked in companies
AmazonOracleWalmart

You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.

Note :
Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.
Problem approach

Initialize 3 pointers low = 0, mid = 0 and high = N-1.

Start traversing the array from start to end, repeat this process until mid <= high.

If the A[mid]==0, then swap(A[low], A[mid]) and update the pointers low = low + 1 and mid = mid + 1.
If the A[mid]==1, just update the pointer mid = mid + 1.
If the A[mid]==2, then swap(A[mid], A[high]) and update the pointer high = high - 1
Print the sorted array

Try solving now

2. OOPs Question

What is encapsulation?
What is abstraction?

02
Round
Easy
Video Call
Duration40 minutes
Interview date4 Jun 2019
Coding problem2

Interview started with my introduction, my education and background. Then they asked me about my project and the technology used, then they asked me my favorite subject.

1. Project related questions

Write SQL query related to my project.

2. OOPs Question

Construct a class that calculates area for rectangle, square and triangle.

03
Round
Easy
HR Round
Duration30 minutes
Interview date4 Jun 2019
Coding problem1

Basic HR questions were asked.

1. Basic HR Questions

Your strengths and weakness?
Where do you see yourself after 5 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
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
Associate Software Engineer
2 rounds | 4 problems
Interviewed by Synoverge technologies pvt. Ltd
643 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6451 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7874 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
9973 views
1 comments
0 upvotes
company logo
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
4310 views
1 comments
0 upvotes