C++ Dynamic Memory & Logic Challenges

A collection of C++ programs focusing on manual memory management, pointer manipulation, and algorithmic efficiency.

🚀 Key Concepts Covered

Dynamic Memory: Using new and delete for 1D arrays to prevent memory leaks.
String Algorithms: Frequency counting, subsequence detection, and tokenization.
Pointer Arithmetic: Sorting and navigating arrays using pointer notation instead of indices.
Data Structures: Implementing a manual resizing logic for dynamic arrays (Vector-like behavior).

Repeated Letter Analysis: Finds the word with the highest internal character frequency.
Subsequence Checker: Efficiently checks if one string exists within another while maintaining order.
Odd-Even Stable Sort: Reorders arrays using pointer notation.
Greedy Sum Optimization: Maximizes sums based on $K$ distinct integer constraints.

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
.gitignore		.gitignore
2D_Array.cpp		2D_Array.cpp
README.md		README.md
task 1 (1).cpp		task 1 (1).cpp
task 1 (2).cpp		task 1 (2).cpp
task 2 (1).cpp		task 2 (1).cpp
task 2 (2).cpp		task 2 (2).cpp
task 2 (4).cpp		task 2 (4).cpp
task 2 (6).cpp		task 2 (6).cpp
task 2(3).cpp		task 2(3).cpp
task 2(5).cpp		task 2(5).cpp