Visa | SDE 1
Summary
I, with 1.10 years of experience, applied for an SDE 1 role at Visa. The interview process included an Online Assessment (OA), a coding round, and a technical discussion. I faced challenges in providing an optimized solution for the 3-sum problem and some conceptual Java questions, ultimately leading to a rejection.
Full Experience
Current Experience: 1.10 Years
College: Tier-2
Previous Organization: One of the MNCs
Applied through portal.
OA
The Online Assessment included the following problems:
1st Round (Coding)
This round involved coding questions.
2nd Round (Technical Discussion)
AGENDA: Focus areas for SWE framework Coding Quality Engineering Fundamentals Collaborate as OneVisa/Execute
Questions covered:
- Spring boot annotations - controller, service, transactional
- Autowiring - what it is? How it works?
- SQL vs NoSQL - vertical scaling vs horizontal scaling
- Pass by reference and pass by value
- Static vs non static
- 2-sum problem
- 3-sum problem
During writing code, the interviewer was asking questions like "why you used this and that type of questions."
SQL questions:
-
Problem: print number of students in each dep where cgpa > 9
My query:
select Dep, count(*) as count from student group by Dep having cgpa > 9; -
Problem: duplicate row in the table
My query:
select * from student groupby studentId having count(*) > 1;
Outcome:
I was not able to provide an optimized solution for the 3-sum problem. I gave an N^2+NlogN solution and he was expecting an N^2 solution only.
I was also not able to provide correct answers for a few conceptual Java questions.
Verdict: rejected.
Other interview experience: https://leetcode.com/discuss/post/6834384/all-interview-experiences-switch-journey-vpu1/
Interview Questions (11)
Longest Substring Without Repeating Characters
Find the length of the longest substring without repeating characters. Full problem description available at the provided link.
Letter Combinations of a Phone Number
Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Full problem description available at the provided link.
Spring Boot Annotations
Discuss Spring Boot annotations such as @Controller, @Service, and @Transactional.
Spring Autowiring
Explain what autowiring is in Spring and how it works.
SQL vs NoSQL with Scaling
Compare SQL and NoSQL databases, discussing their differences in terms of vertical and horizontal scaling.
Pass by Reference vs. Pass by Value
Explain the concepts of pass by reference and pass by value in programming.
Static vs. Non-Static Members
Explain the difference between static and non-static members (variables and methods) in object-oriented programming.
Two Sum
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
Three Sum
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
SQL: Count Students by Department with CGPA > 9
Given a student table with StudentId, Name, Dep, CGPA, write a SQL query to print the number of students in each department where CGPA is greater than 9.
SQL: Find Duplicate Rows
Given a student table with StudentId, Name, Dep, CGPA, write a SQL query to find duplicate rows based on StudentId.