Skip to content
Shadow Cipher

Table Of Content for DSA

Guides lead a user through a specific task they want to accomplish, often with a sequence of steps. Writing a good guide requires thinking about what your users are trying to do.

Fundamentals

  • 💁 Introductions, Flow-chart and Pseudo code
  • 💁 Write First Program
  • 💁 Conditionals and Loops
  • 💁 Basic Questions
    • 💁 Check Prime Numbers
    • 💁 Sum of N Numbers

Pattern Questions

  • 💁 Squre pattern of *
  • 💁 Number Square Pattern
  • 💁 Another Number Squre pattern
  • 💁 Inverted Number Squre pattern
  • 💁 Counting Squre pattern
  • 💁 90 Degree Triangle pattern
  • 💁 90 Degree Counting Triangle pattern
  • 💁 90 Degree Inverted Counting Triangle pattern
  • 💁 Alphabetical Square pattern
  • 💁 Alphabetical Triangle pattern
  • 💁 Inverted Alphabetical Triangle pattern
  • 💁 Right Angel Inverted Character Triangle pattern
  • 💁 Right Angel Reverse Character Triangle pattern
  • 💁 Number Pyramid pattern
  • 💁 Dabangg pattern

Bitwise Operators

  • 💁 Bitwise Operators
  • 💁 Fibinacchi Sequence
  • 💁 Check Prime or Not
  • 💁 Calculate Sum
  • 💁 Number Of One Bit
  • 💁 Subtract Product and Sum
  • 💁 Binary to decimal
  • 💁 Decimal to Binary
  • 💁 Leetcode: Compliment of base-10
  • 💁 Leetcode: Power of 2
  • 💁 Reverse Integer

Switch statements and Functions

  • 💁 Switch statements basics
  • 💁 Calculator
  • 💁 Print Counting
  • 💁 Print Even or Odd
  • 💁 Functions basics
  • 💁 Power of two numbers
  • 💁 Check prime or not

Array

  • 💁 Array basics
  • 💁 Linear Search
  • 💁 Find Min, Max
  • 💁 Reverse Array
  • 💁 Leetcode: Find Array Intersection
  • 💁 Leetcode: Find Duplicates Array Intersection
  • 💁 Leetcode: Find Unique
  • 💁 Leetcode: Pair Sum
  • 💁 Leetcode: Sort One
  • 💁 Leetcode: Swapped Alternates

Space-Time comlexity

  • 💁 Basics
  • 💁 EvenIndex search
  • 💁 OddIndex search
  • 💁 Find Peak
  • 💁 First and Last Positions
  • 💁 Peak Index in Mountain Array
  • 💁 Pivot
  • 💁 Search in rotated Array
  • 💁 Square Root Integer
  • 💁 Aggressive Cows
  • 💁 Book Allocation Problem

Sorting

  • 💁 Selection Sort
  • 💁 Bubble Sort
  • 💁 Insertion Sort
  • 💁 Array
    • 💁 Merge Sorted Array
    • 💁 Reverse Array
    • 💁 Find Array Sum
    • 💁 Sorted Rotated Array
    • 💁 Rotate Array

Strings

  • 💁 Introduction and Basics
  • 💁 Remove Occurance
  • 💁 Replace spaces
  • 💁 Reverse String
  • 💁 Valid Palindrome

2D Array

  • 💁 Introduction and Basics
  • 💁 Search 2D Matrix 1
  • 💁 Search 2D Matrix 2
  • 💁 Spiral Print
  • 💁 Wave Print
  • 💁 Valid Palindrome

Maths

  • 💁 Introduction and Basics
  • 💁 Factors of a Number
  • 💁 GCD
  • 💁 LCM
  • 💁 Newton’s Square Root
  • 💁 Prime Number
  • 💁 Sieve Of Eratosthenes
  • 💁 Square Root of a Number
  • 💁 Fast Expo

Pointers

  • 💁 Introduction and Basics
  • 💁 Play
  • 💁 Pointer Array
  • 💁 Pointer Character Array
  • 💁 Pointer Functions
  • 💁 Double Pointer
  • 💁 Double Pointer MCQ’s

Dyanamic Allocations

  • 💁 Reference Variable
  • 💁 Dyanamic Array
  • 💁 2D Array

Macros, Gloab Variables

  • 💁 Counting
  • 💁 Default Arguments
  • 💁 Global Varible
  • 💁 Inline Functions
  • 💁 Macros

Recursion

  • 💁 Factorial
  • 💁 Power
  • 💁 Fibinacci
  • 💁 Climb Stairs
  • 💁 Say Digits
  • 💁 Walking Examples
  • 💁 Binary Search
  • 💁 Linear Search
  • 💁 Calculate Sum
  • 💁 isSorted
  • 💁 Sorted Array
  • 💁 Sum
  • 💁 Bubble Sort
  • 💁 Insertion Sort
  • 💁 Selection Sort
  • 💁 Exponent
  • 💁 Palindrome
  • 💁 Reverse String
  • 💁 Inversion Count
  • 💁 Merge Sort
  • 💁 Quick Sort
  • 💁 Sub Sequences
  • 💁 Subsets
  • 💁 Keypad

OOPs

  • 💁 Intro and Basics
  • 💁 Hero
  • 💁 Ambiguity
  • 💁 Concepts
  • 💁 Hierarchicalinheritance
  • 💁 Inheritance
  • 💁 Multi Level Inheritance
  • 💁 Multiple Inheritance
  • 💁 Polymorphism
  • 💁 SingleInheritance

Linked List

  • 💁 Circular Linked List
  • 💁 Doubly Linked List
  • 💁 Singly Linked List
  • 💁 Linked List
  • 💁 Reverse Ink Group
  • 💁 Loop
  • 💁 Duplicates
  • 💁 Merge List
  • 💁 Sort
  • 💁 Palindrome
  • 💁 Add
  • 💁 Clone
  • 💁 Merge Sort

Stack

  • 💁 Introduction
  • 💁 Two Stacks
  • 💁 Bracket Reversals
  • 💁 Delete Middle
  • 💁 Insert At Bottom
  • 💁 Redundants Brackets
  • 💁 Reverse Stack
  • 💁 Reverse String
  • 💁 Sort Stack
  • 💁 Valid Brackets
  • 💁 Area Histrogram
  • 💁 Next Smaller
  • 💁 Celebrity
  • 💁 Max Reactangle
  • 💁 N Stack
  • 💁 Special Stack
  • 💁 Circular Queue
  • 💁 Deque
  • 💁 Implementation Queue
  • 💁 Queue Intro
  • 💁 kQueue
  • 💁 circular Tour
  • 💁 Negative Integer
  • 💁 Non-Repeating
  • 💁 Reverse First K
  • 💁 Reverse Queue
  • 💁 Sum Max Min

Tree

  • 💁 Binary Tree
  • 💁 Count Leaf
  • 💁 Balanced Tree
  • 💁 Diameter
  • 💁 Height
  • 💁 Identical Tree
  • 💁 Sum Tree
  • 💁 Left View
  • 💁 Bottom View
  • 💁 Boundary Traversal
  • 💁 Right View
  • 💁 Top View
  • 💁 Vertical Traversal
  • 💁 zigzag
  • 💁 bloodline
  • 💁 kAncestor
  • 💁 kSumPaths
  • 💁 LCA
  • 💁 MaxSumNonAdjacentNodes