Go Piscine Exercises Catalog (62)
Search, filter, and inspect all subjects across the 01-edu Go Piscine curriculum.
Write a program that displays a single 'a' character followed by a newline.
Write a program that displays a single 'z' character followed by a newline.
Write a program that displays a single 'f' character followed by a newline.
Write a program that displays a single '1' character followed by a newline.
Write a program that displays a single 'b' character followed by a newline.
Calculate and return the perimeter of a rectangle given length and width.
Count the occurrences of a specific character within a string.
Determine if a given string contains only numeric digit characters.
Count the number of alphabetic characters in a given string.
Print characters or strings conditionally based on length or content criteria.
Print output when specific condition checks fail or negate condition matches.
Return or output only the first half of a given string slice.
Calculate the total number of digits in an integer given a specific base.
Print "fish", "chips", or "fish and chips" depending on divisibility by 2 and 3.
Convert a string from camelCase naming convention to snake_case format.
Compute the greatest common divisor of two non-negative integers using Euclidean algorithm.
Generate an integer hash value for a string based on character positional weight.
Extract and display the last word from a string separated by spaces or tabs.
Extract and display the first word of a sentence.
Repeat each alphabetical character by its index in the alphabet (a=1, b=2, etc.).
Replace all occurrences of a target character in a string with a replacement character.
Find the largest prime number smaller than or equal to a given integer.
Extract every 3rd character from a string sequence.
Print all combinations of 3 distinct digits in descending reverse order.
Display raw bytes of a memory block in hexadecimal notation alongside ASCII characters.
Count characters that appear in one string or the other, but not both.
Convert an integer value to a null-terminated ASCII string representation.
Check whether every word in a string starts with an uppercase letter or digit.
Generate a formatted number sequence strictly stepping from start number to end number.
Compress consecutive repetitive characters into count-character run-length encoded pairs.
Format a string by adding exactly 3 spaces between words with no leading or trailing whitespace.
Trim leading and trailing whitespace and condense internal spacing down to single spaces.
Interleave elements of two arrays or strings alternately into a single result.
Capitalize only the last letter of every word and lowercase all other letters.
Check if the first string can be formed by characters in the second string in matching order.
Determine whether string s1 is hidden as a subsequence inside string s2.
Safely concatenate multiple slice inputs into a single continuous slice.
Display without double entries the characters that appear in both input strings in order of appearance.
Display without double entries all unique characters that appear in either of two input strings.
Slice string by taking N characters then skipping N characters iteratively.
Split a slice into sub-slices of a specified fixed chunk size.
Calculate the sum of all prime numbers less than or equal to a given positive integer.
Find and display the prime factors of a positive integer in ascending order separated by asterisk.
Determine if you can reach the final index of an array starting from index 0 given max jump lengths.
Remove decimal points from float strings and scale output integers accordingly.
Re-implement Python-like string slicing with start, end, and optional step bounds.
Format string into blocks of 5 characters separated by single spaces while skipping every 6th character.
Concatenate two slices in reverse order while alternating elements.
Apply an accumulator function over an integer slice returning a single reduced value.
Fold an array of integers with a binary operation function and an initial seed value.
Reverse the order of words in a string while preserving individual word character sequences.
Print words of a sentence in reverse order with single space separators.
Rotate a sentence by moving its first word to the very end of the line.
Find all unique index pairs in an array whose values sum to a target integer.
Parse command-line option flags (-abc) into a 32-bit bitfield integer representation.
Convert integers to Roman numerals (I, V, X, L, C, D, M) and print evaluation steps.
Translate words into Pig Latin format according to vowel and consonant placement rules.
Convert an integer into a string representation in any arbitrary number base from 2 to 16.
Evaluate Reverse Polish Notation (postfix) arithmetic expressions using a stack.
Validate properly matched and balanced parenthesis, brackets, and braces (), [], {}.
Evaluate complex regex capture groups and pattern matches without using standard regex packages.
Write an interpreter for the esoteric Brainfuck programming language (><+-.,[]).
