Welcome to the DSA Problem Solutions repository! This repository contains solutions to various Data Structures and Algorithms (DSA) problems from platforms like LeetCode and Scaler Academy. Whether you're a beginner looking to learn DSA or an experienced coder practising problem-solving skills, this repository can be a valuable resource for you.
- Problem-solving is an essential skill for any software developer, and mastering DSA is a significant part of it. This repository aims to provide clear and concise solutions to a wide range of DSA problems to help you understand various techniques, algorithms, and data structures.
The problems in this repository are organized into several categories, including but not limited to:
-
old.AdvanceLevelQuestions:
- Arrays
- Add One To Number
- Continuous Sum Query K Begger problem
- Find The Difference Of Two Arrays
- Insert Intervals
- Integer To Roman
- Max Sub Array Sum
- Maximum Absolute Difference
- Merge Interval LeetCode
- Rain Water Trapped
- BinarySearch
- Ath Magical Number
- Binary Search
- Find Floor Value of Given Target In Array
- Find Single Element By Binary Search
- Find Square Root Of N By Binary Search
- Find The Frequency Of K
- Find The Peak Element
- Median Of Array
- Median Of The Matrix
- Median Of Two Sorted Arrays
- Rotated Sorted Array Search
- Search In Matrix
- Sorted Insert Position
- Special Integer
- Bit Manipulations
- Add Binary Strings
- Basics Of Right Set Bit Mask
- Different Bits Sum Pair wise scaler
- GrayCode leetcode
- Interesting Array Scaler
- Min XOR Value scaler
- Single Number1
- Single Number3
- Smallest XOR scaler
- Sum of XOR of all Pairs In An Array GFG
- Xor Property And Question
- Hashing
- Concept of Collection and Collections
- Count Retangles
- Distinct Numbers In Window
- Longest Continuous Sequence
- Relative Sort Array
- Roman To Integer
- Sub Array With Zero Sum
- Linked list
- AddTwoNumbers
- Mathematics
- GCD
- Divisior Game
- Find Original Num From GCD Given
- Find LCM
- GCD of more than two numbers
- GCD OR HCF
- Largest Co-prime Divisor
- Maximise GCD by Deleting Only One Element
- Modulo Operator
- A B and Modulo
- Count No Of Pairs Very Good Ques
- Find Factorial
- How to handle mod 1e7
- Implement Power Function With Modulus
- Modular Multiplicative Inverse
- LeetCode Count Array Pairs Divisible by K
- Rearrange An Array Facebook Amazon
- Very Large Power
- Prime Number Questions
- Distinct Primes
- Find Prime Factors Of GivenNumber
- is Prime Number
- is Prime Number using Fermat Little Algorithm
- Sieve Of Eratothenes Questions
- Count_Of_divisors
- Count_Of_divisors
- FindAllPrimeNumberTill_N
- LuckyNumbers
- NumberOfOpenDoors
- PrimeSum
- Find Square Root Of N
- GCD
- Recursion
- Find Factorial Using Recursion
- Find Fibonacci Nth Element
- Is Magical Number
- Modified Fabonacci Pattern
- N Bit Gray Code
- Reverse String Using Recursion
- Sum Of Digits
- Sorting
- Selection Sort
- Array With Consecutive Elements
- Kth Smallest Element
- Max Mod
- Selection
- Sort
- Theory
- Selection Sort
- Bubble sort
- Bubble Sort Theory
- Bubble Sort
- Merge sort
- Count Inversion
- Merge Sort
- Merge Sort_II
- Merge Two Sorted Arrays
- Quick Sort
- Quick Sort Explaination
- Quick Sort
- CountTheNumberOfPairs
- LargestNumber
- Stable and Unstable Algorithm
- Selection Sort
- TwoPointers
- CountOfPairsWithGivenSum
- PairsWithGivenDifference
- PairsWithGivenSum_II
- SubarrayWithGivenSum
- TheeSumZero
- Arrays
-
Android Developer Practice Questions
- Distribute Candies To People
- Two Sum