Given an input array like [1,2,3] and a target like 5, find all combinations of array that sum up to target. [2,3] and [3,2] counts for only 1 combination.
Software Engineers Interview Questions
419,267 software engineers interview questions shared by candidates
Write a function that finds the square root of a decimal number.
Given an integer, return all sequences of numbers that sum to it. (Example: 3 -> (1, 2), (2, 1), (1, 1, 1))
"Reverse" of the problem if finding k-th smallest element in a tree: I had to find k-th largest.
Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where each path's sum equals targetSum.
In most cases you need to have some experience with CUDA. If you want to increase your chances of getting a job offer you need to know very well about linked lists. We used the collabedit.com for the interview. It is like a chat but for coding. I got the following question on the screen of collabedit: // There is a chunk of memory in the kernel address space represented by kernelResource and an API exists to clear it. An IOCTL path exists to take a request from user-mode and using O/S services eventually dispatches to API_ZeroResource. From a security perspective what concerns do you have with this implementation? How would you fix them? // // KERNEL // BYTE kernelResource[10] = {0}; int API_ZeroResource( in_params *pParams ) { if (pParams->offset + pParams->length > sizeof(kernelResource)) return ERR_INVALID_LIMIT; memset(kernelResource + pParams->offset, 0, pParams->length); return 0; } // // USER // void ZeroResource() { in_params params = { ??? }; // an ioctl path exists to call API_ZeroResource ioctl( CMD_ZeroResource, ¶ms ); }
Write function to calculate sum of first N powers of 2 starting from 1. You shouldn't use any built-in function for calculating power. Implement the most efficient solution.
Varied behavioral questions. Technical focused on oops concepts(explain 4 pillars of OOP with examples). Was asked to write code to print the largest number in an unsorted integer array of infinite size. Although the position was for C#, they were cool about me coding in java.
if p1 and p2 are two consecutive prime number, in which cases (p1 + p2) / 2 is a prime number.
Probability of a knight making a valid move on NxN matrix in m steps.
Viewing 1191 - 1200 interview questions
See Interview Questions for Similar Jobs
Operations Engineer.net DeveloperMobile DeveloperPrincipal EngineerFirmware EngineerGame ProgrammerMobile EngineerJr Security AnalystPython DeveloperSenior DeveloperTechnical Program ManagerApplication DeveloperQa EngineerDevops EngineerAtg DeveloperData EngineerLead EngineerSoftware DeveloperC Developer