Skip to content
This repository was archived by the owner on May 25, 2025. It is now read-only.

nomaannm/DS-ALGO-Sheets

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

223 Commits
Algorithms
Algorithms
 
 
Approaches/Two Pointers
Approaches/Two Pointers
 
 
Arrays
Arrays
 
 
Backtracking
Backtracking
 
 
Bits Manipulation
Bits Manipulation
 
 
Combinatorics
Combinatorics
 
 
CrackingACodingInterview
CrackingACodingInterview
 
 
DYNAMIC PROGRAMMING
DYNAMIC PROGRAMMING
 
 
Divide & Conquer
Divide & Conquer
 
 
Graphs
Graphs
 
 
Greedy Algorithms
Greedy Algorithms
 
 
Linked Lists
Linked Lists
 
 
Maths (Basic, Advanced)
Maths (Basic, Advanced)
 
 
Number Theory
Number Theory
 
 
Queues
Queues
 
 
Recursion
Recursion
 
 
Searching
Searching
 
 
Sliding Window
Sliding Window
 
 
Sorting
Sorting
 
 
Stacks
Stacks
 
 
Stoney Codes
Stoney Codes
 
 
TopSWE 100
TopSWE 100
 
 
.gitattributes
.gitattributes
 
 
1512(to be revised).cpp
1512(to be revised).cpp
 
 
1920.cpp
1920.cpp
 
 
1929.cpp
1929.cpp
 
 
2011.cpp
2011.cpp
 
 
485.cpp
485.cpp
 
 
997.cpp
997.cpp
 
 
AddDigits.cpp
AddDigits.cpp
 
 
Buy&SellStock.cpp
Buy&SellStock.cpp
 
 
ClimbingStairs.cpp
ClimbingStairs.cpp
 
 
DividieWithoutDivide.java
DividieWithoutDivide.java
 
 
DuplicateElemsFrmSortedArray.cpp
DuplicateElemsFrmSortedArray.cpp
 
 
FirstAndLastIndex.cpp
FirstAndLastIndex.cpp
 
 
FirstBadVersion.cpp
FirstBadVersion.cpp
 
 
FizzBuzz.cpp
FizzBuzz.cpp
 
 
GCD.cpp
GCD.cpp
 
 
HappyNumber.java
HappyNumber.java
 
 
HouseRobber.cpp
HouseRobber.cpp
 
 
LargestConsecutiveSequence.cpp
LargestConsecutiveSequence.cpp
 
 
LeadersInArray.cpp
LeadersInArray.cpp
 
 
Leetcode(2149).cpp
Leetcode(2149).cpp
 
 
LengthofLastWord.cpp
LengthofLastWord.cpp
 
 
LongestCommonPrefix.java
LongestCommonPrefix.java
 
 
LongestSubArrayWithSumK.cpp
LongestSubArrayWithSumK.cpp
 
 
MinimumInRSorted.cpp
MinimumInRSorted.cpp
 
 
MissingNumber.cs
MissingNumber.cs
 
 
MovingZeroes.cs
MovingZeroes.cs
 
 
NegativePositive.java
NegativePositive.java
 
 
NumberOfCommonFactors.swift
NumberOfCommonFactors.swift
 
 
PadovanSequence(GFG).cpp
PadovanSequence(GFG).cpp
 
 
PeakElement.cpp
PeakElement.cpp
 
 
PlusOne.cpp
PlusOne.cpp
 
 
PowerOf2.java
PowerOf2.java
 
 
PowerOfThree.cpp
PowerOfThree.cpp
 
 
README.md
README.md
 
 
RemoveElement.cpp
RemoveElement.cpp
 
 
RemovingDuplicates.cpp
RemovingDuplicates.cpp
 
 
ReverseArray.cpp
ReverseArray.cpp
 
 
ReverseVowelsInAString.cpp
ReverseVowelsInAString.cpp
 
 
RotateArray.cpp
RotateArray.cpp
 
 
SQrt.cpp
SQrt.cpp
 
 
SearchInRotatedSortedArr(Duplicates).cpp
SearchInRotatedSortedArr(Duplicates).cpp
 
 
SearchInRotatedSortedArr.cpp
SearchInRotatedSortedArr.cpp
 
 
SearchIndexPosition.cpp
SearchIndexPosition.cpp
 
 
SearchInsertPosition.cpp
SearchInsertPosition.cpp
 
 
SingleNumber.cpp
SingleNumber.cpp
 
 
SmallestEvenMultiple.py
SmallestEvenMultiple.py
 
 
SortThePeople.swift
SortThePeople.swift
 
 
Triplets.cpp
Triplets.cpp
 
 
TypeOfTriangle.cpp
TypeOfTriangle.cpp
 
 
factorialNumsInArr.cpp
factorialNumsInArr.cpp
 
 
intersectionArr.cpp
intersectionArr.cpp
 
 
lowerBound(BSversion).cpp
lowerBound(BSversion).cpp
 
 
minMaxSum.cpp
minMaxSum.cpp
 
 
missingNumber.cpp
missingNumber.cpp
 
 
movingZeroes.cpp
movingZeroes.cpp
 
 
powerOf4.cpp
powerOf4.cpp
 
 
reverseArray(twoPtrRecur).cpp
reverseArray(twoPtrRecur).cpp
 
 
romantoint.cpp
romantoint.cpp
 
 
romantoint.java
romantoint.java
 
 
unionArr.cpp
unionArr.cpp
 
 

Repository files navigation

Strivers A2Z DSA Sheet

Welcome to the Strivers A2Z DSA Sheet! This resource is designed to guide you through the essential data structures and algorithms topics, providing a structured approach to mastering DSA.

Table of Contents

  1. Introduction
  2. How to Use This Sheet
  3. Topics Covered
  4. Resources
  5. Contributing
  6. License

Introduction

The Strivers A2Z DSA Sheet is a comprehensive guide that covers a wide range of topics in data structures and algorithms. It is intended to help learners systematically cover and understand key concepts, providing a solid foundation for coding interviews and competitive programming.

How to Use This Sheet

  1. Follow the Order: The sheet is organized in a structured manner. Start from the beginning and work your way through the topics.
  2. Practice Regularly: Consistent practice is crucial. Make sure to solve problems related to each topic to reinforce your understanding.
  3. Review and Revise: Periodically review the topics you've covered to keep your skills sharp.

Topics Covered

The sheet includes the following key areas:

  • Arrays and Strings

    • Basic operations
    • Sliding window technique
    • Two pointers approach

  • Linked Lists

    • Singly linked list
    • Doubly linked list
    • Circular linked list

  • Stacks and Queues

    • Implementation and applications
    • Problems related to stack and queue

  • Trees

    • Binary trees
    • Binary search trees
    • AVL trees
    • Segment trees

  • Graphs

    • Graph representations
    • Depth-first search (DFS)
    • Breadth-first search (BFS)
    • Shortest path algorithms

  • Dynamic Programming

    • Knapsack problems
    • Longest common subsequence
    • Matrix chain multiplication

  • Greedy Algorithms

    • Activity selection
    • Huffman coding
    • Minimum spanning tree

  • Sorting and Searching

    • Basic sorting algorithms
    • Advanced sorting algorithms
    • Searching techniques

  • Miscellaneous

    • Bit manipulation
    • Backtracking
    • Number theory

Resources

Contributing

If you find any errors or have suggestions for improvements, feel free to contribute by opening an issue or a pull request. Your feedback is valuable and helps in improving this resource.

License

This sheet is provided under the MIT License.

About

These are leetcode problems , I solved or studies while in college..

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages