Algorithm Problem-Solving Techniques
Prefix Sum Algorithm
Example 1: Interstellar Cake Problem
Approach: Brute Force to Prefix Sum + Binary Search Optimization
#include <algorithm>
#include <iostream>
using namespace std;
int result;
const int N = 200005;
long long n, q, arr[N], countFactor[N], prefixSum[N], x;
int main()
{
scanf("%lld", &n);
...
Posted on Thu, 15 Oct 2026 16:12:57 +0000 by ridckie_rich
Converting Infix Expressions to Postfix and Evaluating Them
The problem involves processing arithmetic expressions, specifically transforming an infix expression into its postfix equivalent and then evaluating the resulting postfix expression. This is a common application of stack data structures.
Infix to Postfix Conversion
The conversion from infix to postfix notation requires careful handling of oper ...
Posted on Fri, 15 May 2026 20:33:28 +0000 by vietnamese
Data Structures: A Comprehensive Technical Overview
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 ...
Posted on Sun, 10 May 2026 02:12:24 +0000 by slick101