Freaks City

Printing Individual Digits of an Integer The following recursive function separates and prints each digit of an unsigned integer. #include <stdio.h> void displayDigits(unsigned int num) { if (num > 9) { displayDigits(num / 10); } printf("%u ", num % 10); } int main() { unsigned int value = 0; ...

Binary Search Fundamentals Problem Statement Given a sorted array of n integers in ascending order and a target value, implement a function that searches for the target in the array. Return the index if the target exists, otherwise return -1. Constraints: All elements in the array are unique n ranges from [1, 10000] Each element falls within [ ...

Balanced String Analysis (Simple and Extended) Problem Statement We need to analyze strings composed of 0, 1, and ?. The question marks can be replaced with either 0 or 1. The goal is to compute how many valid configurations result in "balanced" strings according to a specific criterion. Simple Approach For small lengths, a brute-forc ...

Numerical proximity queries arise frequently in computational tasks. Often, the objective involves identifying the array entry situated closest to a specific target point. Various implementation strategies are available depending on whether the data is static or dynamic. Naive Iteration A fundamental approach involves calculating the absolute d ...

Mathematical Algorithms Fast Exponentiation Reduces the time complexity of computing powers to logarithmic time by leveraging binary decomposition of the exponent. long long binary_pow(long long base, long long exp, long long mod) { long long res = 1; base %= mod; while (exp > 0) { if (exp & 1) res = (res * base) % mo ...

Given a sequence of integers of length n, the objective is to identify a contiguous subarray that yields the maximum possible sum. This is a fundamental problem in computer science, solvable through several distinct algorithmic approaches. Dynamic Programming The optimal substructure for this problem can be defined by letting f(i) represent the ...

Algorithm Efficiency Algorithm efficiency is measured in two dimensions: time efficiency and space efficiency. Big O Notation Big O notation mathematically describes the asymptotic behavior of a function. It provides an estimation of an algorithm's growth rate. The rules for deriving Big O are: Replace all additive constants in the runtime fun ...

This problem requires implementing six core functions for an integer sequantial list that supports input, output, retrieval, search, insertion, and deletion operations. The sequential list structure manages integer data elements with fixed-size array storage. Function Interface Definitions: The sequential list structure is defined as: typedef s ...

To determine which edges can lie on a shortest path from source S to target T in a directed graph, compute shortest distances from S to all nodes. Then, perform a reverse BFS starting from T on the transposed graph. For each dequeued node cur and its neighbor nex in the transposed graph, if Dist[nex] == Dist[cur] - weight(cur->nex) holds, th ...

Binary search operates with O(log n) time complexity on a sorted array of n elements. The algorithm repeatedly divides the search interval in half, achieving logarithmic performance. Algorithm Fundamentals Binary search, also known as half-interval search, is an efficient algorithm for locating a target value within a sorted sequence. It compar ...