mittalrishabh
BAN USER
Comments (4)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
we need to take difference of price of two consecutive days and store it in a array. For ex
array[0] = price[0]-price[1]
array[1]=price[1]-price[2]
array[2]=price[2]-price[3]
Then we need to take all the subsets of this array whose maximum contiguous sum is more then the fees.
Comment hidden because of low score. Click to expand.
0
of 0 vote
assign the prime number to each letter and calculate the multiplication of each word. If multipication is same for two numbers then it means it has the same string. If a word has multiple same letters then don't multiply it again with the same prime number.
- mittalrishabh March 15, 2017Comment hidden because of low score. Click to expand.
0
of 0 vote
why can't we find window of maximum sum with k numbers 3 times and omitting those numbers from the list in each iteration. It would have the complexity of O(3n)
- mittalrishabh March 15, 2017Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
XOR all the characters on one side and send it other. And then XOR it again with all the characters in a file. It will give a character which is not identical
- mittalrishabh March 17, 2017