HimanshuP
BAN USER
Questions (4)
Comments (6)
Reputation 80
- 3of 3 votes
AnswersGiven an array and an integer k, find the maximum for each and every contiguous subarray of size k.(Using DP)
- HimanshuP in United States| Report Duplicate | Flag | PURGE
SDE1 Algorithm - 0of 0 votes
AnswersI'm not able to think, how to code any questions.
- HimanshuP in United States
How improve myself for coding ??| Report Duplicate | Flag | PURGE
- 0of 0 votes
AnswersHow can I count frequencies of all elements of an array?
- HimanshuP in United States| Report Duplicate | Flag | PURGE
Algorithm
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Hi zr.roman, I think you are able to think
- HimanshuP January 23, 2016Examples:
Input :
arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6}
k = 3
Output :
3 3 4 5 5 5 6
Input :
arr[] = {8, 5, 10, 7, 9, 4, 15, 12, 90, 13}
k = 4
Output :
10 10 10 15 15 90 90