Given an integer array containing positive and negative numbers, how do you get the maximum sum of its sub-arrays? Continuous numbers form a sub-array of an array. For example, if the input array is {1, -2, 3, 10, -4, 7, 2, -5}, the sub-array with the maximum sum is {3, 10, -4, 7, 2} whose sum 18.
Showed a struct definition in C and asked its size?
Explain the graphics pipeline in a GPU core.
What is the difference between a class, an abstract class, and an interface?
how would you detect a cycle in a DAG.
How would you reverse a singly-linked list?
Waiting for the result of online test.
It was a puzzle Two people, let "A" and "B" are talking. "C" tries to listen to them. "A' says to "B", I have 3 daughters, the product of their age is 72. Can you tell their age? "B", says "NO". "A" again said to B about some of his daughter's age. "C" could not hear the sum. A asked to B Can you tell their age now. "B" again said NO. They "A" says my eldest daughter's age is equal to my house's street number. B immediately answered A about the age. What was their ages?
Reverse a string in any language of your choice.
Implement a function all_anagram_groups() that, given many input strings, will identify and group words that are anagrams of each other. An anagram is word that is just a re-arrangement of the characters of another word, like "reap" and "pear" and "a per" (whitespace is ignored). But "pear" and "rep" are not, since "rep" does not have an "a". Also, "the" and "thee" are not anagrams, because "the" only has one "e". Given this example input: [ "pear","dirty room","amleth","reap","tinsel","hamlet","dormitory","listen","silent" ] The output should be an array-of-arrays (or list-of-lists) [ ["pear","reap"], ["dirty room","dormitory"], ["amleth","hamlet"], ["tinsel","listen","silent"] ]
Viewing 2211 - 2220 interview questions