Please can someone help
Write an algorithm (choose the language you prefer) that given a character
string, for instance {‘c’,’a’,’i’,’o’,’p’,’a’}, will print out the list of
characters appearing at least 2 times. In this specific example, it would
return {‘a’}. Afterwards, comment out the cost in terms of space and time.
Write a bash/python script that takes a directory as an argument and output the
total lines of code in *.cpp files recursively.
Thanks Daley
--
https://mail.python.org/mailman/listinfo/python-list
