I have four starts out of 7 on String 2. Tough, but almost done!
I don't have anything special to say for today, to be honest. I didn't learn or use any new methods, and there wasn't a particularly special problem that was very interesting. It was a regular class, where I used all of my known methods, and nothing else besides that.
Here is one of my problems from today :
----------------------------------------------------------------------------------------------------------------------------------
Given a string and an int N, return a string made of N repetitions of the last N characters of the string. You may assume that N is between 0 and the length of the string, inclusive. repeatEnd("Hello", 3) → "llollollo" repeatEnd("Hello", 2) → "lolo" repeatEnd("Hello", 1) → "o" |
I know this is a short blog, but it's all I have to say for today. See you next class ! |
No comments:
Post a Comment