The second question was something like this: You get two arrays representing dice rolls And you need to find the minimum changes in the arrays so their sums will be the same. For example Arr1={5,4,6} Arr2={1,2,3,2} The answer is two because you can change 6 to 1 and 4 to 2 and you get the same sum in both of the arrays.
The first was something like: You get a string of 'a' and 'b', and you need to find how many ways you can split it into three groups, so there will be same amount of 'a' in every group. For example: 'ababa' there are 4 ways to split the string: ab ab a ; a bab a; ab a ba; a ba ba. Or for 'bbbbb' there are 6 ways to split the string.
to talk about my university.
What is .dtb (Device Tree Blob) file?
compares C++ 14 vs 11 ?
Binary tree search complexity.
still need to attend the interview
what is the your most difficult bug you faced?
Write a program which kicks in Watch Dog Timer?
The interview questions were mostly very stock, with some easy technical questions. One question was "how do you instantiate a component in VHDL?". Kind of frustrating as I didn't think this was an entry-level position, and the interview was time-constrained.
Viewing 431 - 440 interview questions