* @brief Computes a/b using only additions. * @note Complexity: O(max(|a|,|b|)) in time, O(1) in space. */

* @brief Finds the k-th number of type (3^a)*(5^b)*(7^c) using brute force. * @note Complexity: O(k²) in time, O(k) in space. */

* @brief Finds the k-th number of type (3^a)*(5^b)*(7^c) using three queues, * each one containing numbers which must still be multiplied by

* @brief Finds a missing integer among the n given integers using a histogram. * @note Complexity: O(n) in time, O(1) in space. * @note This funct

* @brief Returns an array containing all words in a given dictionary with * distance one from a given word. * @note Complexity: O(d) in bot

* @brief Returns a bitset indicating which numbers in an array of size n are * duplicates, where the array numbers are in the range [0,32000)

* @brief Returns the m largest elements of an array using quick-select. * @note Complexity: O(m) in time (on average), O(n) in space, where n is the

* @brief Returns the m largest elements of an array using a min-heap. * @note Complexity: O(n*log(m)) in time, O(m) in space, where n is the number

* @brief Returns the m largest elements of an array by sorting it first. * @note Complexity: O(n*log(n)) in time (on average), O(n) in space, where

* @brief Determines a path between word1 and word2 which defines a series of * steps to transform word1 into word2 such that each step involv

* @brief Inserts a word into the dictionary. * @note Complexity: O(n²) in both time and space, where n is the length * of the word.

* @brief Returns true if two words word1 and word2 have the same length and * differ by exactly one character, false otherwise. * @note Com

* @brief Returns true if n is an integer whose prime factors are only 3, 5 * and 7, false otherwise. * @note Complexity: O(log(n)) in time,

* @brief Returns true if the rectangle rows and columns form words in the given * dictionary, false otherwise. * @note Complexity: O(width*

* @brief Returns the length of the longest word in the dictionary. * @note Complexity: O(1) in both time and space. */

* @brief Determines the line which crosses the largest number of points using * brute-force (build all possible lines and then determine whic

* @brief Determines the line which crosses the largest number of points using * sorting (build all possible lines, sort them and then determi

* @brief Computes a*b using only additions. * @note Complexity: O(|a|) in time, O(1) in space. */

* @brief Generates a random graph with n nodes and returns a pointer to the * first generated node (a root node). * @note Complexity: O(n)

* @brief Returns an array with n distinct random points with coordinates (i,j), * where i and j are integer values in [0,9]. * @note This m

* @brief Returns a random vector containing n integer values in [0,32000). * @note Complexity: O(n) in both time and space. */

* @brief Marks the cell at the i-th row and j-th column as "undefined" * (i.e., sets it to '\0'). * @note Complexity: O(1) in both