Next greater element in same order as input. Sliding Window Maximum (Maximum of all subarrays of size k) using stack in O(n) time.Sliding Window Maximum (Maximum of all subarrays of size k).Given an array arr, find the maximum j – i such that arr > arr.Maximum difference between two elements such that larger element appears after the smaller number.Maximum profit by buying and selling a share at most k times.Maximum profit by buying and selling a share at most twice.Count possible ways to construct buildings.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |