CareerCup

This is on Additive Number Property

Additive Number examples:
123459 (1+2=3, 4+5=9)
314538 (3+1=4, 5+3=8)
122436 (12+24=36)
You are given a range, you need to print all the additive numbers.

You need to generate all possible permutations of phone numbers of a certain length, except
a) two digits can not be next to each other,
b) cannot contain digits from a given list of exclusion
c) if number contains 4, must start with 4 as well.

Given a number such as 123 having digits 1,2 and 3.
Now Product of Number and its digits is = 123*1*2*3 = 768. Now 123 is the seed number for 768. You would be given a number and you have to identify whether any seed element exists for that number. for Ex: - 4977 has two such seed numbers 79 and 711. You have to print both.

given an expression like 3*4 + 8-9 (only +, - , * operators) as a string evaluate it strictly from left to right

snake sequence. same as in other interviews

given a horizontal array of strings convert it to vertical. like english characters are read left to right. convert them to a chinese format which is read vertically.
eg.
epic is a healthcare company.
interviewing for software developer.
print this vertically sentence by sentence.

N*N matrix having various alphabets in different cells is given. Also a word is given. You have to find the position of this word in the given matrix. Please refer to other posts for details.

Write a function to determine whether a given number is colorful or not?
Please refer to other questions other posts with same question for details. They have mentioned the details quite clearly.

Here is the link to the question:
http://www.careercup.com/question?id=5725158532710400

The Mingo game:
The game of Mingo involves a 100 X 100 board with unique positive whole numbers in the range from 1 to 1,000,000 randomly distributed in the cells. Unique numbers are "called" one at a time and the goal is to have a "Mingo", which is an entire row or column of cells with numbers that have been called; one might also form a diagonal from corner to corner with numbers that have been called. Write a function that takes as parameters a square array of 100 X 100 positive whole numbers and list of "called" numbers. Your function will report whether a "Mingo" occurs, and after how many called numbers the first Mingo occurs. You may assume valid input.

find if the given set of elements 2,4,3 form a colorful number?

find if the given set of elements 2,4,3 form a colorful number?

If jan 1 2011 is tuesday then what will be the name of the day for march 6 2064 and print that.

convert a 2d matrix in to a sprint order matrix and print it

Balanced String
Given a string that has{},[],() and characters.Check if the string is balanced. E.g. {a[(b)]} is balanced. {a[(b])} isunbalanced.

RGBCompare
Given a string of RGB value (rr, gg, bb)which represents in hexadecimal. Compare if rr or gg or bb is the biggest, ortwo of those values are equal and larger than the third one, or three valuesare equal with each other.

Write a program to print the below series:
1 11 21 1211 111221 312211 13112221 ....
Another example of the series:
12 1112 3112 132112 1113122112 ....

You will be given a number. You will have to print the first ten numbers in the series. The series is basically the number of occurrence followed by the number. The occurrence should be continuous.

You are given an N*N matrix. The matrix contains characters. Write a program to find a word in the matrix.The word can be found in either the rows or columns or the diagonals. The program should return true if the word is found and false if the word is not found.

Given a certain range, produce all numbers in that range that fit the criteria. The criteria is as follows:
a number that starts with 2 of the same number, and then the sum of the previous 2 is that of the next number, and etc. For example:
112358, 121224, 448

If given a number find a number if it is colorful. A number is said to be colorful if all its possible unique permutations multiplication result different.
Eg: if n = 1234 then permutations are (1,2),(1,3),(1,4), (2,3),(2,4),(3,4),(1,2,3), (1,2,4), (2,3,4). That's it, no other combination. Find the multiplication of digits in each combination and if any of them repeats then number is not colorful.

Mutiplicative iteration.Assume letters are A=1,B=2....The number N=4 then A=1*4=4.If result is greater than 26 mod 26.Input a string and give a encrypted result as output.

Write a function which takes an input for a double dimensional matrix.Each page is 1000 pixels wide and 1000 pixels high.A black pixel is represented by 1 and a white pixel by 0.Return an answer set of array of row numbers for appropriate page breaks.A page break would ideally be a row with all white pixels.If the page break is encountered more than 1000 rows from the last break then the page break should be forcefully taken 1000 rows from the last break.

Enumerate all possible anagrams of a random string where capital letters, numbers, and symbols are not allowed to move within the string.

Given a M * N matrix, if the element in thematrix is larger than other 8 elements who stay around it, then named thatelement be mountain point. Print all the mountain points.

Goldman's conjecture - already posted,
Well ordered numbers - already posted.

The cows and bulls game, Player A chooses a word and player B guesses a word. You say bulls when a character in the player B's guess match with a character in player A's word and also it is in the corect position as in A's word. You say cows, when a character in the player B's word match the character in player A, but it is not in the correct position. The characters are case insensitive. Given two words player A's and player B's,Write a function that return the number of bulls and no of cows. For example,
A - Picture B- Epic, bulls -0, cows - 4
A - forum B - four, bulls - 3 cows - 1

Jumper Game: A NxN grid which contains either of 0-empty, 1 - player1, 2 - player 2. Given a position in the grid, find the longest jump path. For jump path, you can horizontally or vertically, you can jump on opponent cell and also the landing cell should be empty. No opponent cell can be jumped more than once. Write a function which takes grid and a specific position in the grid, and returns the longest possible number of jumps in the grid.

There are two coins that make 55 cents. If one of them is not nickle then what are the two coins?

A bear have to climb a 60.5 feet long hill. It climbs 3 feet in every minute before it fall down for 2 feet. How long it will take to climb the hill?

Colorful Number:
A number can be broken into different sub-sequence parts. Suppose, a number 3245 can be broken into parts like 3 2 4 5 32 24 45 324 245. And this number is a colorful number, since product of every digit of a sub-sequence are different. That is, 3 2 4 5 (3*2)=6 (2*4)=8 (4*5)=20 (3*2*4)= 24 (2*4*5)= 40
But 326 is not a colorful number as it generates 3 2 6 (3*2)=6 (2*6)=12.
You have to write a function that tells if the given number is a colorful number or not.

A string "aBIY" is said to be a well-ordered word as each of the letters are in sequential manner regardless of case. So, "AbLe" is not a well-ordered word.
You are a anti-hacker. you have a number of character sequences. Your task is to generate all possible well-ordered word that can be generated by those numbers of given character sequences.