Give a deck of card, calculate total number of point that is closes to 21. ex A,A,J = 12 , J,J,A,2 = 23 A, 2 = 13
Software Engineer Software Developer Interview Questions
419,591 software engineer software developer interview questions shared by candidates
Last 15 mins- coding question: Given 6 integers and 1 target value, write a function to get the target value using 6 integers with any on these operations +,*,-,/
will cache affect memory I/O register?
How many degrees are between the hour and minute hand on a clock at 9:45?
Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where each path's sum equals targetSum.
The first question is two find the largest and second largest value at each level of a binary tree. You don't need to return all values, just print out instead. the second question is to return a value in an array with the probability proportional to the weight of the value within the array. For example, in an array [4,5,6], return 4 with probability 4/15, 5 with 5/15 and 6 with 6/15. You are given a function that returns a random real number between 0 and 1
1. Given 1 billion numbers, find 100 largest numbers 2. Prefix notation +*123 = 5
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 ); }
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.
Animate a given element using JS across any given time frame
Viewing 1141 - 1150 interview questions