i
NetApp
Filter interviews by
Clear (1)
I was interviewed in Jul 2024.
Use sliding window technique to find starting indices of substring formed by concatenating words from list in string S.
Create a hashmap to store the frequency of words in the list.
Use sliding window of size equal to total length of all words combined.
Slide the window through the string and check if the substring formed matches the hashmap.
If match found, store the starting index of the substring.
Top trending discussions
I applied via Campus Placement and was interviewed in Jul 2022. There were 2 interview rounds.
Cs subjects regarding OS, C, DBMS
Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time.
Start with the second element and compare it with the first element, swap if necessary
Move to the third element and compare it with the second and first element, swap if necessary
Continue this process until the entire array is sorted
Time complexity: O(n^2)
Example: ['banana', 'apple', 'orange', 'grape'] -> ['apple', 'banan
Implementing a tree data structure using code
Define a Node class with left and right child pointers
Implement insert, search, and delete functions
Traversal methods: inorder, preorder, postorder
Examples: binary search tree, AVL tree, red-black tree
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
Basic dp and graph questions
Calculate the sum of all left leaf nodes in a binary tree.
Traverse the binary tree using depth-first search (DFS)
Check if a node is a leaf node and if it is a left child
Add the value of the left leaf node to the sum
Recursively traverse the left and right subtrees
I applied via LinkedIn and was interviewed in Nov 2022. There were 3 interview rounds.
General questions like reasoning and maths
General DSA questions were asked like Linked list etc
I was interviewed before May 2021.
Round duration - 60 minutes
Round difficulty - Medium
Functional relations in DBMS define a relationship between input and output values where each input has a unique output.
Functional relations ensure that each input value maps to only one output value.
They are commonly used in database design to enforce data integrity and consistency.
For example, in a table storing employee information, the employee ID can be a functional key that uniquely identifies each employee.
Round duration - 40 minutes
Round difficulty - Hard
Questions related to Web development and machine learning
The question is related to Web development and machine learning.
Web development involves creating websites and web applications using languages like HTML, CSS, and JavaScript.
Machine learning is a subset of artificial intelligence that involves building models to make predictions based on data.
Examples of web development frameworks include React, Angular, and Vue.js.
Examples of machine learning algorithms include linea...
Round duration - 20 minutes
Round difficulty - Medium
Tip 1 : Have clear understanding of fundamental concepts.
Tip 2 : Have a skill of explaining your thoughts as clearly as possible.
Tip 3 : Practice RDBMS and OS concepts.
Tip 1 : Mention about the projects you've done with detail
Tip 2 : Have deep knowledge about everything mentioned on your resume.
Quantitative and Verbal
2 Questions - DSA (Array and Numbers)
I applied via Campus Placement and was interviewed before Oct 2022. There were 4 interview rounds.
Aptitude and technical questions
2 coding questions with choice of language
I applied via Referral and was interviewed in Feb 2024. There were 2 interview rounds.
Easy to medium test was easily solvable
based on 1 interview
Interview experience
Member Technical Staff
200
salaries
| ₹0 L/yr - ₹0 L/yr |
Professional Service Engineer
98
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Staff Member 3
74
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
72
salaries
| ₹0 L/yr - ₹0 L/yr |
Mts Software Engineer
62
salaries
| ₹0 L/yr - ₹0 L/yr |
Nutanix
IBM
Oracle
Dell