## therethere

- 0of 0 votes

AnswersYou are given a grid of numbers. A snake sequence is made up of adjacent numbers such that for each number, the number on the right or the number below it is +1 or -1 its value. For example,

- therethere in United States

1 3 2 6 8

-9 7 1 -1 2

1 5 0 1 9

In this grid, (3, 2, 1, 0, 1) is a snake sequence.

Given a grid, find the longest snake sequences and their lengths (so there can be multiple snake sequences with the maximum length).| Report Duplicate | Flag

Adobe Algorithm - 0of 0 votes

Answersvalid Number-- A number is called valid if it satisfies as in following example:

- therethere in United States

A=1248 then products when taken 1,2,3,and 4 at a time are:

1,2,4,8,2,8,32,8,64,64(1,2,3,4,1*2,2*4,4*8,1*2*4,2*4*8,1*2*4*8)

if all these numbers are unique the number is valid here the number is not valid.| Report Duplicate | Flag

Adobe - 0of 0 votes

AnswersFibonacci Numbers: A number is said to be Fibonacci number if it follows the fibonacci property. (Ex: 112, 1123, etc). But additionally, it need not necessarily start with 1, as with the normal fibonacci series. So, in this new definition, 112(1,1,2) is a fibonacci number and so is 121224(12,12,24), and so is 252550(25,25,50). So, given any two numbers as input, print out all the Fibonacci Numbers within that range..

- therethere in United States| Report Duplicate | Flag

Adobe Applications Developer Algorithm - -2of 2 votes

AnswersLong Subtraction -- Given two arrays A, B, each contains elements of digits, return an array of A - B. Your machine can only do calculation of less than 20.

- therethere in United States

eg. A = [1,2,5,7,5];

B = [3,4,8,9];

A - B = [9,0,8,6];| Report Duplicate | Flag

Amazon Developer Program Engineer Algorithm - 1of 1 vote

AnswersGiven a keyboard with every letter maps a digit from 0 to 9, return all possible permutation of given a n digit number.

- therethere in United States

eg. 0 <- z,a,q,x,s,w

1 <- c,d,e

2 <- v,f,r

3 <- b,g,t

...

Then permutation of num 1230 will be:

cvbz

cvba

cvbq

...| Report Duplicate | Flag

Amazon Developer Program Engineer Algorithm - 0of 4 votes

Answersa word is valid if the letters follow their natural order in it. abcd is valid, acde is valid aaaa is valid, acb is not valid. condition for valid: char1<=char2<=char3<=… given a length n find all valid words of length n.

- therethere in United States| Report Duplicate | Flag

Adobe Algorithm

the first non-numeric it encounters is '.' which is removed leaving 12..then considering it a string it encounters "\0" and stops..therefore ans should be 12

- therethere October 15, 20132348 would have 2,3,4,8,6,12,32,24,96,192 which are all unique and hence number is valid even though 2,4,8 is a subset

- therethere October 14, 2013is building a new string valid since we need to "replace"

- therethere October 13, 2013**CareerCup**is the world's biggest and best source for software engineering interview preparation. See all our resources.

Open Chat in New Window

Read the question again and see the way the products are being formed b4 downvoting a comment!

- therethere October 16, 2013