Hi All,
We are a seed funded startup working on an app only product for
professional networking.
We have 2 immediate openings the links of which are shared as follows
https://angel.co/fairmont-technologies/jobs/91715-android-developer
bfs
On Tue, Sep 13, 2011 at 5:59 PM, JITESH KUMAR jkhas...@gmail.com wrote:
I guess you have misunderstood the problem.
We are not concerning about the length of path. We just have to find the
path.
But in the efficient way. suppose first person is having 500 friends and
each of them again
are all the numbers in a range?? say from (1 to n) and is there atleast one
occurence of each??
On Fri, Sep 9, 2011 at 5:25 PM, shady sinv...@gmail.com wrote:
O(kN)
where k is the length of the numbers which are assumed to be integers, so
for even k = 100
it is O(N).
On Fri, Sep 9, 2011
check the case 63 62 46 71 28 39 43 24 36 12
You have to find 3rd largest 62
your case you will miss 62 in your first iteration
On Wed, Sep 7, 2011 at 9:41 AM, Anup Ghatage ghat...@gmail.com wrote:
Here is another one. Pardon me if it goes by some other name.
Divide the array in K parts.
use xor inplace of a swap...u wont require extra space or memory...
printing isnt a solution...
On Mon, Aug 29, 2011 at 6:15 PM, Dheeraj Sharma dheerajsharma1...@gmail.com
wrote:
void rev_str(int i)
{
if(i==((length/2)))
return ;
rev_str(i+1);
