Nvidia Salesforce Developer Interview Questions and Answers

Q1. Which is the best sorting algorithm
Ans. 
There is no one-size-fits-all answer as the best sorting algorithm depends on the specific use case and constraints.
• The best sorting algorithm depends on factors such as the size of the data set, the range of values, whether the data is mostly already sorted or not, and the available memory.

• For small data sets or nearly sorted data, insertion sort or bubble sort may be efficient.

• For large data sets, quicksort, mergesor...read more
Answered by AI
Add your answer

Write a program to print the permutations of abc

Round duration - 90 Minutes
Round difficulty - Medium

The timing was from 4:30 pm to 6 pm, so it was quite convenient. The platform was good, the only problem I had was while attempting diagram based questions, as the interface was difficult to understand. The test had three types of questions- MCQ, subjective and diagram based. The major topics from which the question were asked were- sequential circuits(sequence detector), static timing analysis, digital design and computer architecture.

Q1. 
City of Happy People Problem Statement
Imagine a city where the happiness of each resident is described by a numerical value. Ninja, who is visiting this city, is interested in forming groups of people su...read more
Ans. 
The problem is to find the number of ways to form a group of people such that the overall happiness of the group falls within a given range.
• Iterate through all possible subsets of the given array/list

• Calculate the sum of happiness values for each subset

• Count the number of subsets whose sum falls within the given range
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

The timing for my interview was 9:30 pm and it went on for an hour. They asked me thorough questions from majorly two topics- CMOS and Digital System Design. Even if I was not able to answer certain questions,, they were happy to drop hints and then observed how I went further with the solution.

Q1. 
Wildcard Pattern Matching Problem Statement
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
The wildcard pattern may include the...read more
Ans. 
The task is to implement a wildcard pattern matching algorithm that checks if a given wildcard pattern matches a given text.
• The wildcard pattern can include the characters '?' and '*'

• '?' matches any single character

• '*' matches any sequence of characters (sequence can be of length 0 or more)

• The matching should cover the entire text, not partial text

• Implement a function that takes the wildcard pattern and the text as inp...read more
Answered by AI
Add your answer

Basic C questions and microcontrollers

Leetcode Easy - mediums

It was basic coding question and aptitude.

Q1. About project in detail?
Add your answer
Q2. They mostly asked about c programming, stages of c program and their functions, bit manipulation
Add your answer

Q1. Merge two sorted linked lists without using extra space
Ans. 
Merge two sorted linked lists without using extra space
• Use a dummy node to start the merged list

• Compare the values of the nodes in both lists and link the smaller one to the merged list

• Move the pointer of the merged list and the pointer of the smaller node to the next node
Answered by AI
Add your answer

Basic aptitude, c and data structures

Q1. C and data structures
Add your answer
Q2. Operating system and puzzle
Add your answer