Naman's Garden

CPP cheatsheet

Fri, 03 Oct 2025 05:45:00 GMT

Circular array

Fri, 03 Oct 2025 05:45:00 GMT

To find the min diff in a circular array diff = min(n - |a - b|, |a - b|) Note The array should be sorted.

BitSet

Fri, 03 Oct 2025 05:45:00 GMT

#include #include #include int main() { // Create a bitset of size 8 std::bitset<8> b1; // All bits initialized to 0 (00000000) std::cout << "b1: " << b1 << std::endl; // Initialize with an integer value std::bitset<...

Linked List

Fri, 03 Oct 2025 05:45:00 GMT

Custom Implementation struct List{ int val; List *nxt; List *pre; int size; }; Stl implementation #include #include #include int main() { // Create a list containing integers std::list l = {7, 5, 16, 8}; // Add an integer to the front of the...

Queue - CPP

Fri, 03 Oct 2025 05:45:00 GMT

#include #include // Required for std::queue int main() { std::queue myQueue; // Declare a queue of integers // Add elements to the queue myQueue.push(10); myQueue.push(20); myQueue.push(30); // Access elements std::cout << "Front element: " ...

Segment Tree

Fri, 03 Oct 2025 05:45:00 GMT

Segment Tree — Cheatsheet (C++) Quick facts Purpose: fast range queries and updates over an array (sum/min/max/count, etc.).

Stack - CPP

Fri, 03 Oct 2025 05:45:00 GMT

#include #include // Include the stack header int main() { std::stack numbers; // Create a stack of integers numbers.push(10); // Add 10 to the stack numbers.push(20); // Add 20 to the stack numbers.push(30); // Add 30 to the stack std::cout << "T...

Tree

Fri, 03 Oct 2025 05:45:00 GMT

Traversals 1.

Trie

Fri, 03 Oct 2025 05:45:00 GMT

Simplest struct Trie { struct Node { array nxt; bool end=false; Node(){ nxt.fill(-1); } }; vector t; Trie(){ t.emplace_back(); } void insert(const string& s){ int v=0; for(char ch: s){ int c = ch-'a'; if(t[v].nxt[c]==-1){ t[v].nxt[c]=t.size(); t.emplace_back()...

Pro tips

Fri, 03 Oct 2025 05:45:00 GMT

Check if we can use buck sort to optimize our solution and get constant time complexity.