retagged by
457 views

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
radha gogia asked Apr 10, 2016
2,150 views
According to me first we sort the array in O(nlogn) time and then in O(k) time , find the product , so total time complexity is O(nlogn) , so am I right or can it be done...
2 votes
2 votes
2 answers
2
Arjun asked Jul 3, 2016
3,068 views
Given an array of $n$ elements find the maximum continuous sum in it. For example consider the below array of $n=6$.23 4 -10 2 15 1Answer is 35.
0 votes
0 votes
0 answers
3
Arjun asked Jun 6, 2016
1,082 views
Given an arithmetic expression involving *, + only write an object oriented code for its representation and evaluation
2 votes
2 votes
1 answer
4
Arjun asked Apr 9, 2016
1,395 views
You are given a number lock of 4 digits and it accepts a serial input. What should be the minimum length of an input string so that the lock is guaranteed to open assumin...