Naresh Namani
  • Home
  • Tags
  • Learn
  • About me

Home TagsLearnAbout me
Theme
  • Dark
  • Light
Introduction
Roadmap
Programming languages
Number Systems
Binary Number SystemDecimal Number SystemOctal Number SystemHexaDecimal Number System
Binary Operations
IntroductionBinary AdditionBinary SubstractionBinary MultiplicationBinary Division
Bit Manipulation
Time Complexity and space
Linear Data Structures
Arrays
BasicsInsertionRemovingSearchingReplacingDynamic Arrays
Linked Lists
IntroductionBasicsTypes of Linked ListAdding LastAdding FirstFinding Node and Element indexRemoving FirstRemoving LastFinding SizeConverting Linked List to ArraysReversing a Linked List Finding Kth Node from the end
Stacks
What are stacks & usage Stack implementation using arrays Stack implementation using linked listsReverse String
Queues
What are Queues & usage Building Queues using arrays Building Queues using StacksPriority QueuesImplementing Circular Queues using Arrays
Hash Tables
IntroductionHash Functions CollionsChainingLinear ProbingBuilding Hash tables using ArrayInsertingFinding an elementRemoving an element
Non-Linear Data Structures
Graphs
What are Graphs and Usages
Trees
What are Trees and Usages

Roadmap to DSA


  • Introduction
  • Choosing programming language
  • Introduction
  • Binary Number Systems
  • Decimal Number Systems
  • Octal Number Systems
  • HexaDecimal Number Systems
  • Introduction
  • Binary Addition
  • Binary Substraction
  • Binary Multiplication
  • Binary Division
  • Bit Manipulation
  • Time Complexity and space
  • What are Linear Data Structures
  • Basics
  • Operations
    • Insertion
    • Deletion
    • Replacing
    • Searching
  • Dynamic Arrays
  • Introduction
  • Basics
  • Types
    • Single Linked List
    • Double Linked List
    • Circler Linked List
  • Adding First
  • Adding Last
  • Finding Node and index
  • Removing First
  • Removing Last
  • Converting Linked List to Arrays
  • Reversing an Linked List
  • Find Kth Node from the End.
  • What are Stacks
  • Why we use Stacks
  • Stack Implementation using Arrays
  • Stack Implementation using Linked Lists
  • Reversing String
  • What are Queues
  • Why we use Queues
  • Building Queues using Array
  • Building Queues using Stack
  • Priority Queues
  • Implementing Circular Queues using Arrays
  • Introduction
  • What are Hash Tables
  • Hash Functions
  • Collions
  • Chaining
  • Linear Probing
  • Building Hash tables using Array
  • Inserting
  • Finding an element
  • Removing an element
  • What are Non-Linear Data Structures
  • What are Graphs
  • What are Trees

Introduction
Roadmap
Programming languages
Number Systems
Binary Number SystemDecimal Number SystemOctal Number SystemHexaDecimal Number System
Binary Operations
IntroductionBinary AdditionBinary SubstractionBinary MultiplicationBinary Division
Bit Manipulation
Time Complexity and space
Linear Data Structures
Arrays
BasicsInsertionRemovingSearchingReplacingDynamic Arrays
Linked Lists
IntroductionBasicsTypes of Linked ListAdding LastAdding FirstFinding Node and Element indexRemoving FirstRemoving LastFinding SizeConverting Linked List to ArraysReversing a Linked List Finding Kth Node from the end
Stacks
What are stacks & usage Stack implementation using arrays Stack implementation using linked listsReverse String
Queues
What are Queues & usage Building Queues using arrays Building Queues using StacksPriority QueuesImplementing Circular Queues using Arrays
Hash Tables
IntroductionHash Functions CollionsChainingLinear ProbingBuilding Hash tables using ArrayInsertingFinding an elementRemoving an element
Non-Linear Data Structures
Graphs
What are Graphs and Usages
Trees
What are Trees and Usages

Naresh Namani
Facebook
Twitter
Instagram
Github
dribble

Made with