About Me

▼
Showing posts with label FaceBook Engineering Team. Show all posts
Showing posts with label FaceBook Engineering Team. Show all posts
Saturday, November 16, 2013

Given a deck of nCards unique cards, cut the deck iCut cards from top and perform a perfect shuffle. A perfect shuffle begins by putting down the bottom card from the top portion of the deck followed by the bottom card from the bottom portion of the deck followed by the next card from the top portion, etc., alternating cards until one portion is used up. The remaining cards go on top. The problem is to find the number of perfect shuffles required to return the deck to its original order.

›
Example if  nCards=9 and ICut=6 then for  N=123456789 , you need 3 shuffle to get the original positions , wondering how , try it now and  ...
1 comment:
Wednesday, October 2, 2013

A circular array A[1, . . . , n] is an array such that n ≥ 3 and A[1] and A[n] are considered to be adjacent elements just like A[1] and A[2], A[2] and A[3], etc., are adjacent. We are given a circular array A[1, . . . , n] of non-negative integers. For any i, j ∈ {1, 2, . . . , n} such that i != j, dist(i, j) = max {|i − j|, n − |i − j|}. Design a linear time algorithm that computes a maximum number t such that for some i, j ∈ {1, 2, . . . , n}, i != j, t = A[i] + A[j] + dist(i, j).

›
Thursday, March 14, 2013

Assume your daily prices of a stock are 3 7 4 10 11 8 5 4 8 . You can only buy 1 share or sell 1 share a day, but you can only sell if you own the stock. You can't hold more than 1 share. write an algo that finds the strategy that has the highest pay off. Don't generate the all possible strategies and compare.

›
1 comment:
Tuesday, March 12, 2013

We're playing a game. Cards numbered from 1-10 are placed in a hat. whatever card is drawn is the paid out amount. how much should i charge you to play this game? If you can redraw by placing the first card back into the hat, what is the new price?

›
2 comments:
Thursday, August 9, 2012

d cube root of number without using any library function number can be as large as 10^1000

›

Count no of different places tommy can cover from home to school condition is one place can't be visited twice and after reaching school he can't proceed further.

›
Tommy reach school frm his home there are many places b/w their home and school connected by bidirectional paths u have to count no of dif...
Tuesday, April 24, 2012

Three tips to succeed as a programmer

›
I Found its worth to read so thought to share....... I've learned a lot of things over the years that I wish I knew before I graduate...