Premski - Puzzle Corner

Triangle area mismatch problem

2008-10-02 08:08:42

<img src=\\"http://premski.com/images/premski_puzzle_images/triangle_problem.jpg\\"></img><br>\r\n\r\nBoth triangles contain the same pieces, albeit arranged differently. How\r\ncome the upper triangle is larger by one square? Click HERE to answer this question!

Find smallest primes

2008-09-11 11:29:58

how will u find 5 smallest primes in an array having billions of element??(efficient solution required) Click HERE to answer this question!

Minimal vertex set

2008-09-08 19:40:44

Given a graph (any type - Directed acyclic graph or undirected graphs with loops), find a minimal set of vertices which affect all the edges of the graph.\r\n\r\nAn edge is affected if the edge is either originating or terminating from that vertex. Click HERE to answer this question!

Sum of the most common element in an array

2008-09-08 19:39:30

Find the sum of the most common element in an array.\r\nExample:\r\n A[]={12,23,24,89,78,76,24}\r\n OutPut:48 Click HERE to answer this question!

2008-07-15 14:19:35

You have 8*8 square grid with left-bottom and right-top squares removed. (thus there are only 62 squares remaining in the grid). You are given 31 tiles each of 2*1. You have to put the tiles on the grid without breaking any of the tiles (so that all squares of the grid are covered). How will you do that?\r\nHint: It is impossible to do that, prove :)\r\n\r\nGeneralize the result for 2n*2n grid. What is the case with (2n+1)*(2n+1) grid and (2n)*(2m+1) grid? Click HERE to answer this question!

Triangle problem

2008-06-24 23:31:30

given a triangle ABC, how would you use only a compass and a straight edge to find a point P such that triangles ABP, ACP & BCP have equal perimeters?(Assume that ABC is constructed so that a solution does exist) Click HERE to answer this question!

2008-06-24 23:28:10

#\r\n\r\nSay we have a data structure as follows:\r\n\r\nenum {RED,BLUE,GREEN};\r\nstruct Ball\r\n{\r\n /*...*/\r\n int color;\r\n};\r\n\r\nint ColorOfBall(Ball b)\r\n{\r\n return b.color;\r\n}\r\nBall arr[SIZE];\r\n\r\nThe array arr consists of balls of with one of the three colours\r\n(Red,Green,Blue). Now we need to sort the array in such a way that all\r\nthe Red coloured balls come first, followed by blue and then green.\r\n\r\nThe restriction is that call to function ColorOfBall is a very costly\r\noperation. You have to use it as less as possible. (In other words we\r\nwould be looking for the solution with least number of calls to the\r\nfunction ColorOfBall.)\r\n Click HERE to answer this question!

Multiplication of numbers

2008-06-16 04:56:01

There is an array A[N] of N numbers. You have to compose an array Output[N] such that Output[i] will be equal to multiplication of all the elements of A[N] except A[i]. For example Output[0] will be multiplication of A[1] to A[N-1] and Output[1] will be multiplication of A[0] and from A[2] to A[N-1].\r\n\r\nSolve it without division operator and in O(n). Click HERE to answer this question!

Probability to spot a car

2008-06-16 04:16:49

If the probability of observing a car in 30 minutes on a highway is 0.95, what is the probability of observing a car in 10 minutes Click HERE to answer this question!

Preorder traversal

2008-04-04 00:38:02

Write a c code (both recursive & non recursive) to do preorder traversal\r\nof a binary tree Click HERE to answer this question!