Data Structures and Algorithms (DSA) Concepts & Competitive Programming

This repository contains coding problems, key concepts, and solutions related to various DSA topics and competitive programming

Table of Contents

1. [Data Structures]
2. [Algorithms]
3. [Competitive Programming Questions]

---

Data Structures

This section covers the implementation and operations of common data structures:

Arrays

Basic

- Check if the array is sorted
- Count of odd numbers
- Reverse an array
- Sum_of_elements

Fundamentals

- Largest Element
- Left Rotate Array by K Places
- Left Rotate Array by One
- Linear Search
- Maximum Consecutive Ones
- Second Largest Element

Logic Building

- Find missing number
- Move Zeros to End
- Remove duplicates from sorted array
- Union of two sorted arrays

Basic Math

- Count of prime numbers till N
- Divisors of a number
- GCD of two numbers
- LCM of two numbers
- Check for perfect number

STL

- Sequence Containers: vector, deque, list, array, forward_list
- Associative Containers: set, multiset, map, multimap
- Unordered Containers: unordered_set, unordered_multiset, unordered_map, unordered_multimap

Sorting

- Bubble Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Recursive Bubble
- Selection Sort

Linked List

- Singly Linked List(Implementation)
- Doubly Linked List(Implementation)
- Circular Linked List(Implementation)

Stack

- Stack using arrays
- Stack using linked list

Queue

- Queue using arrays
- Queue using linked list
- Circular Queue

Trees

- Binary Tree using Class
- Binary Tree usign Structure 
- Binary Search Tree implementation 

---