Pure Storage Mts Software Engineer Interview Questions and Answers

Technical round- Hackerank Problem

Q1. Coding medium and easy problems for Leetcode,
Add your answer
Q2. More of a scenario based questions like whatyou will do if you have a confict with your developer
Add your answer
Q3. How will you lead your team
Add your answer

Q1. Java, API, Testing related, Selenium, Scenario based question
Add your answer

We were asked a couple of DSA questions around array and string manipulation

Q1. DSA question - 2 sum. problem
Add your answer
Q2. DSA - island problem of leetcode
Ans. 
The island problem on LeetCode involves finding the number of connected islands in a grid of 1s and 0s.
• Use depth-first search (DFS) or breadth-first search (BFS) to traverse the grid and count the number of islands.

• Keep track of visited cells to avoid redundant calculations.

• Consider diagonal movements if specified in the problem.

• Example: Given grid = [[1,1,0,0],[0,1,0,1],[1,0,0,1]], the number of islands is 3.
Answered by AI
Add your answer

Q1. 1 screenig round
Add your answer
Q2. 2 tech + 2 managerial rounds
Add your answer

Two medium level question in 75 minutes

Q1. Return k most frequent string from an array of strings
Ans. 
Return k most frequent strings from an array of strings
• Use a hashmap to store the frequency of each string in the array

• Sort the hashmap by frequency in descending order

• Return the first k keys from the sorted hashmap
Answered by AI
Add your answer

Q1. Find 2 element having sum equal to x.
Ans. 
Use a hash set to find two elements in an array that sum up to a given value x.
• Create a hash set to store elements as you iterate through the array.

• For each element, check if the difference between x and the current element exists in the hash set.

• If it does, return the current element and the difference as the two elements that sum up to x.
Answered by AI
Add your answer

Q1. Basic Behavioural questions.
Add your answer

Duration: 1:30
Topics: DSA

Q1. Simple DSA questions
Add your answer
Q2. Simple DSA questions again
Add your answer