STL Cheatsheet

 STL CHEATSHEET


Link: Click here to get the detailed cheat sheet for C++ STL Library.


Comments

Post a Comment

Popular posts from this blog

Contains Duplicates

 Leetcode - 217/219/220 Contains Duplicate - I/II/III 1. Contains Duplicate - I https://leetcode.com/problems/contains-duplicate/ For example given an array [1,2,3,4,1] return true as 1 is repeated , return false all the elements in the array are unique.  Solution 1: Brute-Force method - O(n 2 ) time, O(1) space [TLE] While iterating the array check if the element  is repeated by comparing it with the rest of elements, if the values compared are equal return true. If the whole the array is traversed that means no element is repeated ,hence return false.                bool bruteForce(vector<int>& nums) {               for(int i = 0; i < nums.size(); ++i) {                   for(int j = i + 1; j < nums.size(); ++
Read more

MEDIAN FROM DATA STREAM

Image
 Leetcode - 295 Find Median From Data Stream Problem:  https://leetcode.com/problems/find-median-from-data-stream/ For a given stream of integers we need to return the median. Median is the middle value in a sorted integer list with odd number of elements and if the list has even number of elements then median is mean of  two middle values. Solution 1: Brute-force - O(nlogn), O(1) time, O(1) space [TLE] In this method we follow the most trivial method to find the median. We sort the container which stores the input from the stream. From the sorted container find the middle value(s) to find the median. The container can a vector as we can sort it easily, insert at the end in constant time and elements are indexed to find the middle value(s).           vector<int> arr; MedianFinder() { } void addNum(int num)
Read more