Learn C graph
Catalog preview0%
100%
Strings: walking and searching
A string is an array of bytes plus its terminator, and nothing more.
Required exercises0 / 6
6 required exercises7 optionalDifficulty 2 to 40 / 224 XP
Exercises · 13
ExerciseLevelXPStatus
find_nScan a string argument and print the first 'n' character found+12Newstrlensize_t strlen(const char *s)+16Newwrite_strvoid write_str(char *str)+16Newstrchrchar *strchr(const char *s, int c)+16Newstrcspnsize_t strcspn(const char *s, const char *reject)+16Newstrstrchar *strstr(const char *haystack, const char *needle)+24Newfind_last_eOptionalDisplay the last lowercase 'e' found in a string+12NewstrrchrOptionalchar *strrchr(const char *s, int c)+16Newfind_any_charOptionalchar *find_any_char(const char *text, const char *needles)+16Newprefix_spanOptionalsize_t prefix_span(const char *text, const char *allowed)+16Newseq_scanOptionalCheck if the first string is a case-insensitive ordered subsequence of the second+16Newsubseq_checkOptionalCheck whether the first string is an ordered subsequence of the second, printing yes or no+16Newlongest_palindromeOptionalPrint the longest palindromic substring contained in a string passed on the command line+32New