Skip to content

Sharmavicky/Dsa_Array

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

74 Commits
.gitattributes
.gitattributes
 
 
Best_time_to_buy_stock.cpp
Best_time_to_buy_stock.cpp
 
 
Binary_Search.cpp
Binary_Search.cpp
 
 
Can_Place_Flower.cpp
Can_Place_Flower.cpp
 
 
Chk_Array_Is_Sorted.cpp
Chk_Array_Is_Sorted.cpp
 
 
Container_With_Most_Water.cpp
Container_With_Most_Water.cpp
 
 
ContainsDuplicate_2.cpp
ContainsDuplicate_2.cpp
 
 
Contains_duplicate.cpp
Contains_duplicate.cpp
 
 
Count_Elements_with_MaxFrequency.cpp
Count_Elements_with_MaxFrequency.cpp
 
 
Count_Negative_Numbers.cpp
Count_Negative_Numbers.cpp
 
 
Diagonal_Sum.cpp
Diagonal_Sum.cpp
 
 
Difference_Two_Arrays.cpp
Difference_Two_Arrays.cpp
 
 
Equal_Rows_Cols_Pairs.cpp
Equal_Rows_Cols_Pairs.cpp
 
 
Find_All_Duplicates_inArray.cpp
Find_All_Duplicates_inArray.cpp
 
 
Find_Closest_Person.cpp
Find_Closest_Person.cpp
 
 
Find_Disappeared_Number.cpp
Find_Disappeared_Number.cpp
 
 
Find_Duplicate.cpp
Find_Duplicate.cpp
 
 
Find_Highest_Altitude.cpp
Find_Highest_Altitude.cpp
 
 
Find_Kth_Largest_Element.cpp
Find_Kth_Largest_Element.cpp
 
 
Find_MinimumInRotatedSorted_Array.cpp
Find_MinimumInRotatedSorted_Array.cpp
 
 
Find_Peak_Element.cpp
Find_Peak_Element.cpp
 
 
Find_Pivot_Index.cpp
Find_Pivot_Index.cpp
 
 
Find_Smallest_Letter_Greater_Target.cpp
Find_Smallest_Letter_Greater_Target.cpp
 
 
Find_TriangularSum_of_Array.cpp
Find_TriangularSum_of_Array.cpp
 
 
Find_firstAndLast_Pos.cpp
Find_firstAndLast_Pos.cpp
 
 
Four_Sum.cpp
Four_Sum.cpp
 
 
Intersection_of_two_arrays.cpp
Intersection_of_two_arrays.cpp
 
 
Intersecton_of_two_arrays_2.cpp
Intersecton_of_two_arrays_2.cpp
 
 
Kids_With_Greatest_NumberOfCandies.cpp
Kids_With_Greatest_NumberOfCandies.cpp
 
 
Longest_Common_Prefix.cpp
Longest_Common_Prefix.cpp
 
 
Majority_Element.cpp
Majority_Element.cpp
 
 
Max_Average_Subarray.cpp
Max_Average_Subarray.cpp
 
 
Max_Consecutives_Ones.cpp
Max_Consecutives_Ones.cpp
 
 
Max_NumberOfK_SumPairs.cpp
Max_NumberOfK_SumPairs.cpp
 
 
Maximum_Row_Sum.cpp
Maximum_Row_Sum.cpp
 
 
Maximum_Subarray.cpp
Maximum_Subarray.cpp
 
 
Median_of_two_sorted_array.cpp
Median_of_two_sorted_array.cpp
 
 
Merge_Sorted_Array.cpp
Merge_Sorted_Array.cpp
 
 
Missing_Number.cpp
Missing_Number.cpp
 
 
MoveZeroes.cpp
MoveZeroes.cpp
 
 
PascalTriangle_2.cpp
PascalTriangle_2.cpp
 
 
Pascal_Triangle.cpp
Pascal_Triangle.cpp
 
 
Peak_Element.cpp
Peak_Element.cpp
 
 
PlusOne.cpp
PlusOne.cpp
 
 
ProductOfArray_ExceptSelf.cpp
ProductOfArray_ExceptSelf.cpp
 
 
README.md
README.md
 
 
RotateArray.cpp
RotateArray.cpp
 
 
Search_In_Rotated_Array.cpp
Search_In_Rotated_Array.cpp
 
 
Search_In_Rotated_Array_2.cpp
Search_In_Rotated_Array_2.cpp
 
 
Search_In_a_2D_matrix.cpp
Search_In_a_2D_matrix.cpp
 
 
Search_Insert_Position.cpp
Search_Insert_Position.cpp
 
 
Search_in_a_2D_Matrix_2.cpp
Search_in_a_2D_Matrix_2.cpp
 
 
Second_Largest.cpp
Second_Largest.cpp
 
 
SingleNumber.cpp
SingleNumber.cpp
 
 
Single_Element_In_Sorted_Array.cpp
Single_Element_In_Sorted_Array.cpp
 
 
Smallest_Num_Inifinite_Set.cpp
Smallest_Num_Inifinite_Set.cpp
 
 
Sort_Colors.cpp
Sort_Colors.cpp
 
 
Spiral_Matrix_2.cpp
Spiral_Matrix_2.cpp
 
 
Sprial_Matrix.cpp
Sprial_Matrix.cpp
 
 
Subarray_Sum_Equals_to_K.cpp
Subarray_Sum_Equals_to_K.cpp
 
 
Subsets
Subsets
 
 
Third_Maximum.cpp
Third_Maximum.cpp
 
 
Three_Sum.cpp
Three_Sum.cpp
 
 
Two_Sum.cpp
Two_Sum.cpp
 
 
Unique_NumOfOccurrences.cpp
Unique_NumOfOccurrences.cpp
 
 
removeDuplicates.cpp
removeDuplicates.cpp
 
 
removeElement.cpp
removeElement.cpp
 
 

Repository files navigation

📂 DSA Array Problems

This repository contains solutions to common Array problems in Data Structures & Algorithms (DSA).
Each problem is implemented in C++ with multiple approaches — from Brute Force to Optimal — along with time and space complexity analysis.

🚀 Features

  • Multiple approaches (Brute Force, Better, Optimal).
  • Well-commented C++ solutions.
  • Time and Space Complexity mentioned for each solution.
  • Covers common array problem patterns:
    • Searching & Sorting
    • Prefix/Suffix techniques
    • Two pointers
    • Hashing & Frequency maps
    • Sliding Window
    • Mathematical tricks

📘 Example Problems

Here are some of the problems solved in this repo:

  1. Product of Array Except Self

    • Brute Force, Division Method, Prefix & Suffix (Optimal).

  2. Count Pairs with Sum Equal to K

    • Brute Force, Sorting + Two Pointers, Hash Map (Optimal).

  3. Search in Rotated Sorted Array

    • Linear Search, Binary Search (Optimal).

  4. Remove Duplicates from Sorted Array

    • Brute Force, Two-Pointer Technique.

…and more.

🛠️ How to Run

Clone the repository and compile any file using g++:

# Clone repo
git clone https://github.com/<your-username>/DSA_array.git

# Go into repo
cd DSA_array

# Compile a file
g++ problemfile_name.cpp -o output_file

# Run the program
./output

About

This repo contains 'dsa' problems of array.

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages