Skip to main content

STL APIs in C++

Here is the most used of the many functions that STL provides:

 sort(first_iterator, last_iterator)
          - It sorts the elements in ascending order by default. To sort it in descending order we have to pass comparison function as the third parameter. greater<int>() can be used to achieve that purpose.

reverse(first_iterator, last_iterator)
         - It reverses the vector
*max_element(first_iterator, last_iterator)
         - It returns the maximum element of the vector
*min_element(first_iterator, last_iterator)
         - It returns the minimum element of the vector
accumulate(first_iterator, last_iterator, initial sum value)
         - It returns the sum of the elements plus the initial sum value
count(first_iterator, last_iterator, element)
        - It returns the number of times element occurred in the given vector
find(first_iterator, last_iterator, element)
       - It returns the element if found else end of the vector
binary_search(first_iterator, last_iterator, element)
      -  It performs binary search and finds out whether the element is present in vector or not(vector must be sorted beforehand)
lower_bound(first_iterator, last_iterator, x)
      - returns an iterator pointing to the first element in the range [first, last) which has a value not less than ‘x’. 
upper_bound(first_iterator, last_iterator, x)
      - returns an iterator pointing to the first element in the range [first, last) which has a value greater than ‘x’.
array.erase( index to be deleted)
      - It will remove the element at given index and resizes the array
copy_n(source_array,  no_of_elements_to_copy,  destination_array)
      - It will copy no_of_elements_to_copy from source array to destination array.

Comments

Popular posts from this blog

Leet Code: Problem #710 Random Pick with Blacklist

Given a blacklist  B containing unique integers from [0, N) , write a function to return a uniform random integer from [0, N) which is NOT  in B . Optimize it such that it minimizes the call to system’s Math.random() . Note: 1 <= N <= 1000000000 0 <= B.length < min(100000, N) [0, N)  does NOT include N. See interval notation . Example 1: Input: ["Solution","pick","pick","pick"] [[1,[]],[],[],[]] Output: [null,0,0,0] Example 2: Input: ["Solution","pick","pick","pick"] [[2,[]],[],[],[]] Output: [null,1,1,1] Example 3: Input: ["Solution","pick","pick","pick"] [[3,[1]],[],[],[]] Output: [null,0,0,2] Example 4: Input: ["Solution","pick","pick","pick"] [[4,[2]],[],[],[]] Output: [null,1,3,1] Explanation of Input Syntax: The input is two lists: the subroutines called and their argume...

Leet Code: Problem: 355. Design Twitter

Problem Statement: Design basic twitter which lets user follow and unfollow other users and show the latest new feed related to the current user and the user followers. Implement the following APIs void postTweet(int userId, int tweetId):     Stores the tweetId against the user ID. void follow(int followerId, int followeeId):     Marks that follower ID as following followee ID void unfollow(int followerId, int followeeId):     Marks that follower ID as unfollowing followee ID vector<int> getNewsFeed(int userId):     Returns the set of the latest 10 tweetIDs which include the current user tweetIDs and tweetIDs of the user that the follower if following. Approach to the problem: First we need to store the user IDs of the people a particular user is following To store that we can use map. To optimize things instead of storing list of followers, it is better to store them in a set for quicker access. So the followers data str...

LeetCode: Problem #1402. Reducing Dishes

Problem Statement: A chef has collected the data on the review for his dishes. Our Chef will take just 1 unit of time to prepare a dish. Our job is to tell him the dishes he has to make in the order to achieve maximum benefit. The maximum benefit is calculated using the formula time[i] * (review ratings). Example 1: Input: reviews = [-1, -10, -9, 0, 5] Output: 14 Explanation: Considering the dishes in the order of -1, 0 ,5 the calculation will be (-1 * 1 + 0 * 2 + 5 * 3) = 14 Example 2: Input: reviews = [6,5,4] Output: 32 Explanation: Considering the dishes in the order of 4, 5, 6 the calculation will be (4 * 1 + 5 * 2 + 6 * 3) = 32 Approach to the solution: Sort the given reviews so that we can concentrate only on maximum benefited reviews. Make cumulative sums from the end. This will help in deciding till which we have to consider the summation. Now start from the end at add the previous array of cumulative sums until a negative number is encountered. We have to iterate in reverse or...