'Coding has over 700 languages', '67% of programming jobs arenâ€™t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Visa interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Visa
1 rounds | 2 Coding problems
Interview preparation journey
Preparation
Duration: 5 months
Topics: Algorithms, Array, Dynamic Programming, Trees, Heap, Linked List, Backtracking, OOPS, Operating System, Database Management System
Tip

Tip 1 : Prepare data structures and algorithms thoroughly and practice atleast 2 to 3 questions daily for 4-5 months consistently.
Tip 2 : Have few good projects in your resume and also prepare your core subjects like Operating System, DBMS.
Tip 3 : Before interview do a little research about the company.

Application process
Where: Campus
Eligibility: 9 CGPA
Resume tip

Tip 1 : Mention at least 2 good projects.
Tip 2 : You should be able to defend whatever you have put on your resume so don't mention anything false.

Interview rounds
01
Round
Easy
Online Coding Test
Duration60 minutes
Interview date6 Dec 2020
Coding problem2

The coding test was conducted on Hackerrank platform. The test was in the evening. There were two coding questions of easy difficulty. The test was proctored, our webcam was on but not the mic. Also we were not allowed to switch tabs.
About 360 students sat in this round out which 15 were shortlisted for the next interview round.

1. Maximum equal elements after K operations
Moderate
15m average time
85% success
0/80

#### You are given an arbitrary array/list of integers 'ARR' of size â€˜Nâ€™ and an integer â€˜Kâ€™. You need to find the maximum number of elements which can be made equal to each other afte...

View more
Problem approach

This was a very easy question as I just had to traverse both the array and maintain a count variable and a variable to store last maximum equal element encountered which I initialized to a very small number (like INT_MIN in C++) . Now while traversing whenever you encounter equal elements which are greater than last maximum equal elements then increment count by 1. In the end just print count.<...

View more
2. Number of Pairs with Given Sum
Moderate
39m average time
60% success
0/80

#### You have been given an integer array/list(arr) and a number 'Sum'. Find and return the total number of pairs in the array/list which when added, results equal to the 'Sum'.

##### Note:
`...`
View more
Problem approach

Step 1 : Create a map and store count of each unique element in the array.
Step 2 : Maintain a count variable to store the number of unique pairs of elements whose sum is K.
Step 3 : Traverse the array. Let the array be called arr and arr[i] is current element in array while traversing. If value arr[i] and K-arr[i] in map is greater than 0 then increment count and make value of arr[i] and...

View more
Start a Discussion
Similar interview experiences
SDE - 1
4 rounds | 6 problems
Interviewed by Visa
2241 views
SDE - 1
1 rounds | 1 problems
Interviewed by Visa
583 views
SDE - 1
2 rounds | 3 problems
Interviewed by Visa
1441 views
SDE - 1
4 rounds | 7 problems
Interviewed by Visa
923 views
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
92552 views