DSA-30 is now live!

DSA-30

GitHubGitHub
  • Home
  • Getting Started
    • TODO
    • Introduction
    • Practice Questions
    • TODO
    • Introduction
      • Introduction
      • Memory Representation
      • Declaration & Initialization
      • Basic Operations
      • Algorithms
        • Problem List
        • Two Sum
        • Reverse an Array
        • Find Kth Max and Min Element
        • Sort 0s, 1s, and 2s
        • Move Negatives to One Side
        • Cyclically Rotate Array
        • Union & Intersection
        • Kadane's Algorithm
        • Buy & Sell Stock
        • Merge Intervals
      • Introduction
      • Basic Operations
      • Algorithms
        • Problem List
        • Reverse a String
        • Valid Palindrome
        • Valid Anagram
        • Longest Common Prefix
        • String to Integer (atoi)
        • Longest Palindromic Substring
        • Count and Say
        • Longest Substring Without Repeating
    • Overview
    • Introduction
    • Singly Linked List
    • Circular Linked List
    • Doubly Linked List
    • Circular Doubly Linked List
      • Problem List
      • Middle of the Linked List
      • Linked List Cycle
      • Convert Binary Number in a Linked List to Integer
      • Remove Duplicates from Sorted List
      • Merge Two Sorted Lists
      • Multiply Two Numbers Represented as Linked Lists
      • Intersection of Two Linked Lists
      • Delete Node in a Linked List
      • Palindrome Linked List
    • Overview
    • Introduction
      • Introduction
      • Basic Operations
      • Applications
        • Overview
        • Valid Parentheses
        • Min Stack
        • Queue using Stacks
        • Next Greater Element
        • Evaluate RPN
        • Daily Temperatures
      • Introduction
      • Basic Operations
      • Variants
      • Applications
        • Overview
        • Stack using Queues
        • Design Circular Queue
        • Number of Recent Calls
        • Sliding Window Maximum
        • First Non-Repeating (Stream)
        • Rotting Oranges
    • Overview
    • Introduction
    • Thinking Recursively
    • Basic Questions
    • Memoization
      • Overview
      • Climbing Stairs
      • Pow(x, n)
      • Tower of Hanoi
      • Generate Parentheses
      • Subsets (Power Set)
      • Permutations
    • TODO
    • Introduction
    • Basic Questions
      • Problem List
      • Balanced Binary Tree
      • Convert Sorted Array to Binary Tree
      • Same Tree
      • Symmetric Tree
    • TODO
    • Introduction
    • Basic Questions
      • Problem List
    • TODO
    • Introduction
    • Basic Questions
      • Problem List
    • TODO
    • Introduction
    • Basic Questions
      • Problem List
    • TODO
    • Introduction
    • Basic Questions
      • Problem List
    • Overview
    • Introduction
    • Bubble Sort
    • Selection Sort
    • Insertion Sort
    • Merge Sort
      • Overview
      • Sort Colors
      • Merge Sorted Array
      • Count Inversions
    • Overview
    • Quick Sort
    • Heap Sort
    • Linear-Time Sorts
    • Choosing a Sort
      • Overview
      • Kth Largest Element
      • Top K Frequent Elements
      • Sort by Frequency
    • TODO
    • Introduction
    • Deep Dive
    • Basic Questions
      • Problem List
      • Search Insert Position
      • Search in Rotated Sorted Array
    • Overview
    • Overview
    • Overview
    • Overview
    • Introduction
    • Bit Tricks
    • Basic Questions
      • Overview
      • Single Number
      • Number of 1 Bits
      • Power of Two
      • Missing Number
      • Counting Bits
      • Reverse Bits
    • Overview
    • Overview
    • Overview
    • Overview
    • Overview
    • Overview
    • Overview
    • Overview
    • Overview
    • Overview
    • Overview
    • Overview
    • Overview
  • DSA-30

On This Page

  • Definition

DSA-30 is yet to be an open-source project. If you find a bug or want to suggest a feature, please mail me.

Edit this page
Day 9 - Graphs (Basics)Introduction

Graphs (Basics)

Definition

GIF
void func() {
    // Some code
    func(); // Function call
    // Some code
}
TODOBasic Questions

MIT 2026 © Nextra.