Freaks City

Squares of a Sorted Array (LeetCode 977) The challenge in squaring a sorted array that contaisn negative numbers is that the largest squares can appear at both ends of the array. While a naive solution involves squaring every element and then sorting the array in $O(n \log n)$ time, a more efficient $O(n)$ approach utilizes the two-pointer tech ...

Stack and Queue Fundamentals Stacks and queues share the trait that insertion and deletion occur solely at their endpoints. Typical stack storage models are sequential arrays and linked lists. A stack exhibits last-in-first-out behavior. Linked lists lack random access; elemants must be traversed sequentially. Linked representation simplifies ...

Understanding Dynamic Programming Dynamic programming (DP) is an optimization technique used to solve complex problems by breaking them into simpler subproblems. It stores the results of subproblems to avoid redundant computations, thereby improving efficiency. This article explores fundamental DP concepts and implementations through various al ...

Problem Link Approach: For this problem, we need to calculate the perimeter of a shape formed by moving right and up. The perimeter can be determined using the formula: ((steps_up + width) + (steps_right + width)) * 2. This accounts for the outer boundaries of the shape. Solution Code: #include <iostream> using namespace std; typedef lo ...

Introduction to LFU Caching LFU (Least Frequently Used) is a caching algorithm that removes the least frequently accessed items when the cache reaches its capacity. Unlike LRU (Least Recently Used), which considers only recency, LFU prioritizes access frequency. Comparison of LFU and LRU Consider a cache with capacity 3 and the following access ...

Algorithm OverviewQuick Sort, often referred to as Hoare Sort, operates on a divide-and-conquer principle similar to the pre-order traversal of a binary tree. The core objective is to place a selected pivot element into its final sorted position while ensuring all elements to its left are smaller and all elements to its right are larger. This p ...

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 ...