1. Check whether a string s ends with a suffix t.
What about :
!s.empty() && s.back()=='t'
Or, before C++11 :
!s.empty() && (*s.rbegin())=='t'
2. Check whether a collection c contains an element e.
For this one, the C++ implementation makes more sense than the other too : you can immediately store, test and work on the iterator and not wasting your time checking if the element is in the container, then find it again to work on it. If you don't need to use it, you can use std::count (because your container might contain it multiple times) as :
std::count(myContainer.begin(), myContainer.end(), theValue)>0
Or if you know that the element can only be present once, you should be using a std::set as container which already has a count function which only returns 0 or 1.
Split a string s into tokens based on whitespace.
std::string is still not very high level. Good parsing almost requires regexp methods which C++ did not have until recently (in the standard).
Otherwise, the first solution given in your link is verbose but does the job.
Do you have any other good examples?