This project provides a C++ implementation of an in-place string compression algorithm, which reduces the size of strings by encoding consecutive repeating characters with the character followed by its repetition count.

This Java program efficiently removes duplicate elements from a sorted array in-place, ensuring the original order of elements is maintained. It's designed to optimize space and time complexity while handling various array scenarios, including empty arrays and arrays with consecutive or non-consecutive duplicates.

A short C++ program that reorganizes an integer array by moving all zeros to the end while preserving the order of non-zero elements, demonstrating an in-place algorithm with a two-pointer technique.