Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2023. There were 2 interview rounds.
2 Coding Questions and approx 20 MCQs where there in the Online Assisment
I applied via campus placement at KK Wagh Instiute of Engineering Education and Research, Pune and was interviewed before Dec 2023. There were 4 interview rounds.
Questions of medium difficulty were posed.
I was interviewed in May 2022.
Round duration - 60 Minutes
Round difficulty - Easy
The interviewer asked to tell me about myself and then asked some questions to solve like some questions on Lists, Strings and Numbers like comparing 2 strings, performing some operations on lists etc.
Given a string S
and a list wordList
containing N
distinct words, determine if each word in wordList
is present in S
. Return a boolean array where the value at index 'i' indi...
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Prepare basics of Programming like Lists and Strings.
Tip 2 : Algorithms for sorting and searching are very important for Coding interviews.
Tip 1 : Projects are a must on resume.
Tip 2 : Keep the resume simple but answer every question on resume very well.
Nvidia interview questions for designations
Top trending discussions
I applied via campus placement at BRACT's Vishwakarma Institute of Information Technology, Pune and was interviewed in Oct 2024. There was 1 interview round.
Polymorphism is the ability of a function or method to behave differently based on the object it is acting upon.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
It enables a single interface to be used for different data types or classes.
Examples include method overloading and method overriding in object-oriented programming.
Find missing number from nth number array.
Iterate through the array and calculate the sum of all numbers
Calculate the sum of numbers from 1 to n using the formula n*(n+1)/2
Subtract the sum of array from the sum of numbers from 1 to n to find the missing number
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Inheritance allows a class to reuse code from another class.
Types of inheritance include single inheritance, where a class inherits from only one parent class, and multiple inheritance, where a class inherits from multiple parent classes.
Example: Class B inherits from Class A, so Class B can access
Find 2nd max element from array of strings
Sort the array in descending order
Skip the first element (max element)
Return the second element
Very good but easy
easy question long question
I applied via Approached by Company and was interviewed in Jul 2024. There were 3 interview rounds.
Design a data structure for LRU cache with get and put operations, evicting least recently used item when capacity is reached.
Implement a doubly linked list to keep track of the order of keys based on their usage
Use a hashmap to store key-value pairs for quick access
Update the order of keys in the linked list when a key is accessed or inserted
Evict the least recently used item when the cache reaches its capacity
Hacker rank, 3 questions with 1 hour duration
Difficult online round
Arrays are a collection of strings in programming used to store multiple values under a single variable name.
Arrays are declared using square brackets []
Each element in an array is accessed by its index, starting from 0
Example: var fruits = ['apple', 'banana', 'orange']
Trees in neet code refer to the implementation of tree data structures in coding challenges on the platform NeetCode.
Trees are a common data structure used in coding challenges to represent hierarchical relationships between data.
Common tree operations include traversal (inorder, preorder, postorder), insertion, deletion, and searching.
Examples of tree-related coding challenges on NeetCode include implementing a binary...
Trees in leetcode are a common topic for coding interviews, involving various tree traversal and manipulation techniques.
Understand different tree traversal methods like inorder, preorder, and postorder.
Learn about common tree algorithms like finding the height, diameter, and lowest common ancestor.
Practice solving tree-related problems on leetcode to improve your skills.
based on 3 interviews
1 Interview rounds
based on 13 reviews
Rating in categories
Processing Executive
1.1k
salaries
| ₹2 L/yr - ₹4 L/yr |
Quality Analyst
145
salaries
| ₹2.5 L/yr - ₹4 L/yr |
Software Engineer
140
salaries
| ₹11.8 L/yr - ₹35 L/yr |
Data Analyst
119
salaries
| ₹1.9 L/yr - ₹5 L/yr |
Senior Software Engineer
104
salaries
| ₹15.7 L/yr - ₹50.4 L/yr |
Qualcomm
Intel
Advanced Micro Devices
Micron Technology