Basic Maths

This folder contains basic mathematical concepts implemented in C++.

• 01_extractDigits.cpp: Extracting digits from a number.
• 02_pallin&armst.cpp: Palindrome and Armstrong numbers.
• 03_noOfDivisions.cpp: Counting number of divisions.
• 04_primeNo.cpp: Prime number check.
• 05_gcdHcf.cpp: Calculating GCD and HCF.

Recursion

Programs demonstrating the power of recursion.

• 01_recursion_basics.cpp: Introduction to recursion.
• 02_problems_recursion.cpp: Recursion problems.
• 03_parameterized_recursion.cpp: Parameterized recursion.
• 04_functional_recursion.cpp: Functional recursion.
• 05_multiple_recursion_calls.cpp: Multiple recursive calls.

Hashing & Maps

Hashing techniques and map implementations in C++.

• 01_introduction.cpp: Introduction to hashing.
• 02_Hashing_in_characters.cpp: Hashing techniques for characters.
• 03_map_and_unordered_map.cpp: Maps and unordered maps in C++.

Sorting Techniques

Implementation of various sorting algorithms.

• 01_selection_sort.cpp: Selection sort.
• 02_bubble_sort.cpp: Bubble sort.
• 03_insertion_sort.cpp: Insertion sort.
• 04_merge_sort.cpp: Merge sort.
• 05_quick_sort.cpp: Quick sort.
• 06_recursive_insertion_bubble.cpp: Recursive implementation of insertion and bubble sort.

Arrays in C++

Basic Array Operations

• 01_basics_of_arrays.cpp: Introduction to arrays in C++.
• 02_largest_element.cpp: Finding the largest element in an array.
• 03_second_largest_element.cpp: Finding the second largest element in an array.
• 04_check_if_array_sorted.cpp: Checking if the array is sorted.
• 05_remove_dupli_from_sorted.cpp: Removing duplicates from a sorted array.

Array Rotation and Manipulation

• 06_left_rotate_array_1.cpp: Left rotate an array by 1 position.
• 07_left_rotate_array_n.cpp: Left rotate an array by N positions.
• 08_move_zeros_to_end.cpp: Moving zeros to the end of an array.

Search Algorithms

• 09_linear_search.cpp: Linear search algorithm to find an element in an array.
• 10_union_of_sorted_arrays.cpp: Finding the union of two sorted arrays.
• 11_intersection_of_sorted_arrays.cpp: Finding the intersection of two sorted arrays.
• 12_find_missing_no_in_array.cpp: Finding the missing number in an array.

Special Problems and Techniques

• 13_maximum_consecutive_ones.cpp: Finding the maximum number of consecutive ones in a binary array.
• 14_number_appearing_once.cpp: Finding the element that appears only once in an array.
• 15_longest_subarray_given_sum.cpp: Finding the longest subarray with a given sum (considering both positive and negative elements).
• 16_two_sum_problem.cpp: Finding two numbers in an array that add up to a given sum.

Sorting and Rearrangement

• 17_sort_0s_1s_2s_array.cpp: Sorting an array containing only 0s, 1s, and 2s.
• 18_majority_element.cpp: Finding the majority element in an array (element that appears more than n/2 times).

Advanced Array Algorithms

• 19_kadanes_algo_max_subarray_sum.cpp: Implementing Kadane's Algorithm to find the maximum subarray sum.
• 20_dp_on_stocks.cpp: Dynamic programming approach to solving the Stock Buy-Sell Problem for maximum profit.

Array Rearrangement and Permutations

• 21_rearrange_elements_by_sign.cpp: Rearranging elements of an array by separating positive and negative numbers.
• 22_next_permutation.cpp: Finding the next lexicographical permutation of an array.
• 23_leaders_in_array.cpp: Finding the leaders in an array (elements greater than or equal to all elements to their right).

Sequence and Matrix Problems

• 24_longest_consecutive_seq.cpp: Finding the longest consecutive sequence in an array.
• 25_set_matrix_zeros.cpp: Setting matrix rows and columns to zero if an element is zero.
• 26_rotate_matrix.cpp: Rotating a matrix 90 degrees.
• **[27_print_matrix_in_spiral.cpp](https://github.com/YashChavanWeb/DSA_Complete_Notes/blo

Leetcode-daily

🚀 Consistently solving LeetCode problems to master Data Structures & Algorithms for technical interviews. This repository contains structured C++ solutions covering arrays, trees, graphs, DP, binary search, greedy, and more — documenting my journey of becoming a better problem solver every day.