Apple SEG-GPU
16 bit input with identical 16 bit output → there's a bug where any two of the output bits are switched. What's the minimum number of inputs you need to try to find the two broken bits?
What's the probability that one of the bits is switched?
Given a string "ababcA" output "abcA" (remove duplicate letters, preserve order)
Write grey code for 0-9, design digital circuit that outputs that sequence with clock input
Given array with integers where most are duplicate except for one element, return the single element. Ex. [1,1,3,4,4,3,2] returns 2
--> do this in O(n) time, O(1) space
Given a number between 1-999,999,999,999, write a function that returns a string with the written version of that number (ex 123,456 → onehundredtwentythousandfourhundredfiftysix
Lots of general computer architecture questions, like hazards etc