write a program to check the given number is prime or not
Programmer Trainee Interview Questions
712,907 programmer trainee interview questions shared by candidates
Remove duplicates from table
13 assembley language questions in 45 minutes mean you really have to think fast.
One bridge, 4 people. A, B, C, D. A takes 2 mins to cross the bridge, B 4 mins, C 8 mins, D 16mins. It is dark and 1 torch. So, 2 people need to cross the bridge at the same time, so that one person can bring back the torch for the next group to cross the bridge. The 2 pepole group walks at the pace of the slower walker. How to cross the bridge in the fasted way?
How would you form the intersection of two lists that are unsorted? What is the complexity?
All questions were of algorithms and data structures.
# a list of strings. Each string is a management / report relationship. # # EXAMPLE INPUT: # # [ # 'B,E,F', # 'A,B,C,D', # 'D,G,I', # 'G,H' # ] So, write some code (pseudo or language of your choice, including SQL) for the following: A is the manager of B, C, D. B is the manager of E and F, and so forth. # EXAMPLE OUTPUT: # # A # ....B # ........E # ........F # ....C # ....D # ........G # ............H # ........I
Puzzle: There are 4 persons (A, B, C, and D) who want to cross a bridge in night. A takes 1 minute to cross the bridge. B takes 2 minutes to cross the bridge. C takes 5 minutes to cross the bridge. D takes 10 minutes to cross the bridge. There is only one torch with them and the bridge cannot be crossed without the torch. There cannot be more than two persons on the bridge at any time, and when two people cross the bridge together, they must move at the slower person. What is the minimum time required to cross the bridge
Implement atoi and itoa
I remember a puzzle. There is cube of size 3x3x3 unit. All of its 6 faces are painted. you cut that cube into 27 cubes of 1x1x1 size of cubes. How many cubes will have no face painted.
Viewing 1021 - 1030 interview questions