Freaks City

Array Fundamentals Storing data in memory requires allocating space first. To hold 4 integers, you allocate 4 separate int memory blocks: int data[4]; This allocates 16 bytes total (4 × 4 bytes) and assigns the name data to this collection. This structure is called an array. Each individual value is an element, and the total count of values is ...

An array represents a linear data structure that utilizes a contiguous block of memory to store elements of the same data type. Linear Data Structures Linear data structures organize elements in a sequential manner where each element has at most one predecessor and one successor. Besides arrays, common linear structures include linked lists, qu ...

For Loops The for loop syntax in C mirrors that of JavaScript: for (initialization; condition; increment/decrement) { // loop body } Arrays Time Complexity Operation Average Case Worst Case Acess O(1) O(1) Search O(n) O(n) Insert O(n) O(n) Delete O(n) O(n) Multidimensional Arrays C++ stores multidimensional arrays as a cont ...

Stacks and queue are foundational linear data structures governed by LIFO and FIFO principles, respectively. This article demonstrates how to implement both using static arrays in C, C#, and C++—with redesigned logic, renamed identifiers, and structural variations while preserving correctness and clarity. Array-Based Stack Implementation A stac ...

Given N assignments each with a maximum score a_i, two studeents (Ke and Do) score b_i% and c_i% of the maximum respetcively. Compute total weighted scores and detemrine who has the higher total.

Given an array where every element appears twice except two elements that appear only once, find those two unique numbers. Approach 1: Frequency Counting with Index Mapping This method uses a temporary array to count occurrences by treating the original values as indices in the counting array. #include <stdio.h> int main() { int arr[ ...

Convert Array to List with asList The Arrays.asList method wraps an array into a fixed-size list, enabling collection-based operations like iteration or passing to methods expecting a List. Signature: public static <T> List<T> asList(T... a) Example: import java.util.Arrays; import java.util.List; public class ArrayConversion { ...

Given two sorted integer arrays nums1 and nums2 in non-decreasing order, with lengths m and n respectively, merge them into nums1 while maintaining sorted order. Implementation Code function merge(nums1, m, nums2, n) { let i = nums1.length - 1; m--; n--; while(n >= 0) { while(m >= 0 && nums1[m] > nums2[n ...

Array Algorithms Binary Search Fundamentals Binary search operates on sorted sequences with distinct elements. The algorithm halves the search space repeatedly until locating the target or exhausting the range. Critical Implementation Details: Midpoint Calculation: Use mid = lo + (hi - lo) // 2 instead of (lo + hi) // 2 to prevent integer ove ...

Bitwise Operators Binary Operatinos int output = 12 & 3; System.out.println(output); // Output: 0 // AND operation: both bits must be 1 to produce 1 output = 12 & 11; System.out.println(output); // Output: 8 output = 12 | 11; System.out.println(output); // Output: 15 // OR operation: at least one bit is 1 to produce 1 output = 12 ^ 1 ...