695 views

1 Answer

Related questions

1 votes
1 votes
1 answer
1
pC asked Jul 18, 2016
1,245 views
Implement Longest Increasing Subsequence with the help of 1-D array for dynamic programming. (Hint : MaxTill 1-D array)
1 votes
1 votes
1 answer
3
pC asked Jul 18, 2016
1,367 views
Implement a^b mod m where a,b and m can be huge. (Hint : O(log n))
0 votes
0 votes
0 answers
4
ne0n asked Apr 20, 2018
426 views
Hey Guys,How to prepare for the IITK programming test.what is the level of questions??Any sample questions from previous years?? Please guys any help wud be appreciated.T...