Data Structures and Algorithms - Java

This repository contains my solutions and implementations of fundamental Data Structures and Algorithms as I prepare for technical interviews at top-tier companies.

Overview

The goal of this project is to build a solid foundation in computational logic and efficient problem-solving. Each implementation focuses on achieving optimal Time and Space complexity.

Topics Covered

1. Arrays & Strings

• Two Pointers Technique
• Sliding Window Patterns
• Prefix Sums

2. HashMaps

• Frequency Counting
• Space-Time Tradeoffs (O(1) lookups)
• Mapping index-to-value logic

3. Matrices (2D Arrays)

• Row and Column Traversal
• Matrix Transformations (Transpose)
• Diagonal Summation

4. Bit Manipulation

• XOR, AND and OR Operations
• use less memory, and uncover elegant solutions to tricky problems like subsets, parity checks, and optimization.

Project Structure

• Files are named according to the specific problem or pattern.
• Each solution is implemented in Java.

Complexity Goals

• Time Complexity: Aiming for O(n) or O(log n) where possible.
• Space Complexity: Aiming for O(1) in-place modifications.