Just [Array]

Nov 6, 20247 min read

ICPC Assiut University Community Newcomers Training, Do Your Best A. Summation void solve() { int n; cin>>n; ll arr[n]; ll sum = 0; ...

Segment Tree-1

Jul 14, 20242 min read

Segment Tree Basic Node Divide With Segment Tree Node Numbering (Segment Tree) // build (node, begin, end) build (1, 1, N) { L = 2xN, R = (2xN)...

Recursion & Backtracking

Jul 7, 20241 min read

1-Recursion-Basic #include "bits/stdc++.h" using namespace std; void solve(int n) { if(n==0) return; solve(n-1); cout<< n << "...

Lower & Upper Bound

Apr 22, 20241 min read

Binary Search Lower Bound #include "bits/stdc++.h" using namespace std; int main() { int n; cin>>n; int a[n]; for(int i=0; i<n; i++)...

Bit Manipulation

Apr 17, 20241 min read

Operations like AND, OR, XOR, NOT, left shift, and right shift.