## Epic Systems Interview Questions

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

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

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

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

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

- 3of 3 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?

- 1of 1 vote
The buildings of an office are numbered sequentially. Person A is in building 1 and person B is in building 106. If A crosses 5 offices in a minute and B crosses 10 offices in a minute, at which office number will they both meet?

- 0of 0 votes
Find the next number in the series.

-3, 6, -18, 72, - 360

- 0of 0 votes
Find the missing number in the series.

3, 8 , 18 , _ , 78

- 0of 0 votes
A string 'aBlY' is said to be well ordered because the letters of the string occur one after the other in the alphabet. Write a function where the number of letters in the string are passes as parameter and all such well ordered strings are found.

- 0of 0 votes
Let the user enter a decimal number. The range allowed is 0.0001 to 0.9999. Only four decimal places are allowed. The output should be an irreducible fraction.

Eg: If the user enters 0.35, the irreducible fraction will be 7/20.

- 0of 0 votes
There are two roommates. Each one prepares a list for grocery store. Make a combined list without any duplicates.

- 0of 0 votes
Write a program for a word search. If there is an NxN grid with one letter in each cell. Let the user enter a word and the letters of the word are said to be found in the grid either the letters match vertically, horizontally or diagonally in the grid. If the word is found, print the coordinates of the letters as output.

- -6of 6 votes
3, 5, 7, 9, 11, 13. Which is least like others?

- -6of 6 votes
3, 5, 7, 9, 11, 13. Which is least like others?

- 0of 0 votes
Develop a program to demonstrate your implementation of a CSV parsing framework which can be used to generically parse given CSV file into Java beans and prints out information about parsed objects using toString(). The program should follow OOAD open-closed principle to avoid/minimize modification of code when new types are added in future.

You should accept input from STDIN and print the output to STDOUT.

Assume following input format and study sample inputs given below:

Data-type

Header-Row

Data-Row-1

Data-Row-2

....

Data-Row-N

The first line indicates the entity type, 2nd line is comma separate list of column names, 3rd line onwards is the comma separated data values.

Test Case 1 Input

Type:Employee

name,age,salary

Ashok,36,20000

Kishor,30,15000

Bharath,25,30000

Expected Output

Name : Ashok;Age : 36

Name : Kishor;Age : 30

Name : Bharath;Age : 25

Test Case 2 Input

Type:Department

code,name

acc,accounts

prl,payroll

Expected Output

Code : acc;Name : accounts

Code : prl;Name : payroll

Your solution should parse the input into Java Beans (POJOs). For example, in test case 1, you will be make use of following Java bean (if you chose Java as programming language, and equivalent if you were using other language).

class Employee {

private String name;

private int age;

private int salary;

public Employee() {

}

public void setName(String name) {

this.name = name;

}

public String getName() {

return this.name;

}

public void setAge(int age) {

this.age = age;

}

public int getAge() {

return this.age;

}

public void setSalary(int salary) {

this.salary = salary;

}

public int getSalary() {

return this.salary;

}

public String toString() {

return "Name : " + this.name + ";" + "Age : " + this.age;

}

}

You can create a similar bean for Department as required for test case 2.

- 0of 2 votes
N*N matrix is given with input red or black. You can move horizontally, vertically or diagonally. If 3 consecutive same color found, that color will get 1 point. So if 4 red are vertically then point is 2. Find the winner.

- 0of 0 votes
Find the presence of a given word in a given grid, word can be matched in any direction up-down, down-up, left-right, right-left, both diagonals up and down etc.

- 1of 3 votes
Print all palindromes of size greater than equal to 3 of a given string. (DP)

- 1of 1 vote
Given n. Generate all numbers with number of digits equal to n, such that the digit to the right is greater than the left digit (ai+1 > ai). E.g. if n=3 (123,124,125,……129,234,…..789)