## Epic Systems Interview Questions

- -1of 1 vote
convert a 2d matrix in to a sprint order matrix and print it

- 0of 0 votes
Balanced String

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

- 0of 0 votes
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.

- 0of 0 votes
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.

- 0of 0 votes
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.

- 0of 2 votes
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

- 0of 0 votes
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.

- 0of 0 votes
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.

- 0of 0 votes
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.

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

- 2of 2 votes
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.

- -1of 5 votes
Goldman's conjecture - already posted,

Well ordered numbers - already posted.

- 1of 1 vote
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

- 0of 2 votes
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.

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

- 1of 1 vote
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?

- 1of 1 vote
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.

- 0of 0 votes
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.

- 0of 0 votes
Edge Detection:

Two-dimensional array representation of an image can also be represented by a one-dimensional array of W*H size, where W represent row and H represent column size and each cell represent pixel value of that image. you are also given a threshold X. For edge detection, you have to compute difference of a pixel value with each of it's adjacent pixel and find maximum of all differences. And finally compare if that maximum difference is greater than threshold X. if so, then that pixel is a edge pixel and have to display it.

- 0of 0 votes
We are given a specific time(like 02:23), we need to get the angle between hour and minute(less than 180)

- 1of 3 votes
Given number of digits of a phone number and number of disallowed digits as input, find all permutations of numbers which do not have two adjacent numbers the same, i.e. 1232 is allowed but not 1223. Disallowed digits can be upto 3, and can be included along with the phone number. Also the phone number should start with 4 if it contains the number 4.

- 0of 2 votes
The decimal and octal values of some numbers are both palindromes sometimes. Find such numbers within a given range.

- 0of 0 votes
If one and a half teenagers, eat one and a half pizzas in one and a half days, how many pizzas can 9 teenagers eat in 3 days

- 0of 0 votes
Goldbach's conjecture : Every even integer greater than 2 can be expressed as the sum of two primes.

Write a function which takes a number as input, verify if is an even number greater than 2 and also print atleast one pair of prime numbers.

- 2of 2 votes
The stepping number:

A number is called as a stepping number if the adjacent digits are having a difference of 1. For eg. 8,343,545 are stepping numbers. While 890, 098 are not. The difference between a ‘9’ and ‘0’ should not be considered as 1.

Given start number(s) and an end number(e) your function should list out all the stepping numbers in the range including both the numbers s & e.

- 1of 1 vote
Given a NXN matrix, starting from the upper left corner of the matrix start printing values in a counter-clockwise fashion.

Eg: Consider N = 4

Matrix= {a, b, c, d,

e, f, g, h,

i, j, k, l,

m, n, o, p}

Your function should output: dcbaeimnoplhgfjk

Another example would be

C I P E

R N K U

U O W O

L E S Y

The function should print: EPICRULESYOUKNOW

- 1of 1 vote
We have 'n' patients and 'm' problems. The problems are of boolean type. Eg diabetes problem would be 'T' if a patient has it or 'F' otherwise. Suggest the data structure you would store this scenario on?

Q: We have a set of problems {diabetes, liver disease, kidney disease} find all the patients who have at least the 3 problems from the set.

The number of patients can be huge (n).

The number of problems not comparatively huge (m).

Which would be the best data structure to store these kind of records, so that we have a better search time.

- 1of 1 vote
Given a array

{{ 4,7,3,6,7}}

construct a triangle like

{{81}}

{{40,41}}

{{21,19,22}}

{{11,10,9,13}}

{{ 4,7,3,6,7}}

- 2of 2 votes
Find the largest sum contiguous sub array. The length of the returned sub array must be at least of length 2.

- 4of 6 votes
A man goes to a hardware shop and asks for price of an item. The shop keeper replies that the item is "one for $1".

The man gives the shop keeper "$3 for 600". What did the man buy for his newly painted house?