HexOps LogoGO CHECKPOINTSBY HEXOPS.PRO

Official 01-edu Go piscine roadmap & subject index powered by hexops.pro.

Go Piscine Exercises Catalog (62)

Search, filter, and inspect all subjects across the 01-edu Go Piscine curriculum.

Filter Level:
Only AString

Write a program that displays a single 'a' character followed by a newline.

Levels: 1
Only ZString

Write a program that displays a single 'z' character followed by a newline.

Levels: 1
Only FString

Write a program that displays a single 'f' character followed by a newline.

Levels: 1
Only 1String

Write a program that displays a single '1' character followed by a newline.

Levels: 1
Only BString

Write a program that displays a single 'b' character followed by a newline.

Levels: 1

Calculate and return the perimeter of a rectangle given length and width.

Levels: 2

Count the occurrences of a specific character within a string.

Levels: 2

Determine if a given string contains only numeric digit characters.

Levels: 2

Count the number of alphabetic characters in a given string.

Levels: 2
Print IfString

Print characters or strings conditionally based on length or content criteria.

Levels: 2

Print output when specific condition checks fail or negate condition matches.

Levels: 2

Return or output only the first half of a given string slice.

Levels: 2

Calculate the total number of digits in an integer given a specific base.

Levels: 3

Print "fish", "chips", or "fish and chips" depending on divisibility by 2 and 3.

Levels: 3

Convert a string from camelCase naming convention to snake_case format.

Levels: 3

Compute the greatest common divisor of two non-negative integers using Euclidean algorithm.

Levels: 3
Hash CodeAlgorithm

Generate an integer hash value for a string based on character positional weight.

Levels: 3
Last WordString

Extract and display the last word from a string separated by spaces or tabs.

Levels: 3

Extract and display the first word of a sentence.

Levels: 3

Repeat each alphabetical character by its index in the alphabet (a=1, b=2, etc.).

Levels: 3

Replace all occurrences of a target character in a string with a replacement character.

Levels: 3

Find the largest prime number smaller than or equal to a given integer.

Levels: 4

Extract every 3rd character from a string sequence.

Levels: 4

Print all combinations of 3 distinct digits in descending reverse order.

Levels: 4

Display raw bytes of a memory block in hexadecimal notation alongside ASCII characters.

Levels: 4
We Are UniqueAlgorithm

Count characters that appear in one string or the other, but not both.

Levels: 4
ItoaString

Convert an integer value to a null-terminated ASCII string representation.

Levels: 4

Check whether every word in a string starts with an uppercase letter or digit.

Levels: 4

Generate a formatted number sequence strictly stepping from start number to end number.

Levels: 4
Zip StringAlgorithm

Compress consecutive repetitive characters into count-character run-length encoded pairs.

Levels: 4

Format a string by adding exactly 3 spaces between words with no leading or trailing whitespace.

Levels: 4
Clean StrString

Trim leading and trailing whitespace and condense internal spacing down to single spaces.

Levels: 4

Interleave elements of two arrays or strings alternately into a single result.

Levels: 5

Capitalize only the last letter of every word and lowercase all other letters.

Levels: 5
WdmatchAlgorithm

Check if the first string can be formed by characters in the second string in matching order.

Levels: 5
HiddenpAlgorithm

Determine whether string s1 is hidden as a subsequence inside string s2.

Levels: 5
Concat SliceData Structure

Safely concatenate multiple slice inputs into a single continuous slice.

Levels: 5
InterAlgorithm

Display without double entries the characters that appear in both input strings in order of appearance.

Levels: 5
UnionAlgorithm

Display without double entries all unique characters that appear in either of two input strings.

Levels: 5

Slice string by taking N characters then skipping N characters iteratively.

Levels: 5
ChunkData Structure

Split a slice into sub-slices of a specified fixed chunk size.

Levels: 5

Calculate the sum of all prime numbers less than or equal to a given positive integer.

Levels: 5
FprimeMath

Find and display the prime factors of a positive integer in ascending order separated by asterisk.

Levels: 5
Can JumpAlgorithm

Determine if you can reach the final index of an array starting from index 0 given max jump lengths.

Levels: 5

Remove decimal points from float strings and scale output integers accordingly.

Levels: 6
SliceData Structure

Re-implement Python-like string slicing with start, end, and optional step bounds.

Levels: 6

Format string into blocks of 5 characters separated by single spaces while skipping every 6th character.

Levels: 6

Concatenate two slices in reverse order while alternating elements.

Levels: 6
Reduce IntAlgorithm

Apply an accumulator function over an integer slice returning a single reduced value.

Levels: 7
Fold IntAlgorithm

Fold an array of integers with a binary operation function and an initial seed value.

Levels: 7
Word FlipString

Reverse the order of words in a string while preserving individual word character sequences.

Levels: 7
Rev WstrString

Print words of a sentence in reverse order with single space separators.

Levels: 7
RostringString

Rotate a sentence by moving its first word to the very end of the line.

Levels: 7
Find PairsAlgorithm

Find all unique index pairs in an array whose values sum to a target integer.

Levels: 7
OptionsBitwise

Parse command-line option flags (-abc) into a 32-bit bitfield integer representation.

Levels: 8

Convert integers to Roman numerals (I, V, X, L, C, D, M) and print evaluation steps.

Levels: 8
Pig LatinString

Translate words into Pig Latin format according to vowel and consonant placement rules.

Levels: 8

Convert an integer into a string representation in any arbitrary number base from 2 to 16.

Levels: 8
RPN CalcData Structure

Evaluate Reverse Polish Notation (postfix) arithmetic expressions using a stack.

Levels: 9
BracketsData Structure

Validate properly matched and balanced parenthesis, brackets, and braces (), [], {}.

Levels: 9
GroupingAlgorithm

Evaluate complex regex capture groups and pattern matches without using standard regex packages.

Levels: 10

Write an interpreter for the esoteric Brainfuck programming language (><+-.,[]).

Levels: 10