Laddar uppgiften…
In camelCase, several words are written together: the first starts with a lowercase letter, and each next word starts with an uppercase letter. The function camelcase receives a string s in this format. Count the words in the string: the first word is already present, and every uppercase letter starts a new one. Return that count.
"saveChangesInTheEditor"5"oneWord"2"word"1def camelcase(s: str) -> int:
Logga in för att se historik över inskick
Logga inLogga in för att använda AI-mentorn
Logga inThey run when you press "Submit" — your whole solution is checked against them so you can't hard-code answers for the visible cases.