🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← All topics

Quiz: STL Algorithms: questions with answers

10 questions, each with the answer and a short explanation.

Take the timed quiz + get a certificate →
  1. Q1. What does this print? (code)
  2. Q2. What must you do before calling unique to remove all duplicates?
  3. Q3. What does this print? (code)
  4. Q4. Which sorts a vector v in DESCENDING order?
  5. Q5. Why use ios::syncwithstdio(false) in contests?
  6. Q6. What does this print? (code)
  7. Q7. What does this print? (code)
  8. Q8. What does binarysearch require of the range it searches?
  9. Q9. What is the time complexity of sort on n elements?
  10. Q10. Why is accumulate(v.begin(), v.end(), 0) risky for a vector of large long long values?