Skip to content

skyricksarkar/Data_Structure_And_Algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

38 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Before you start:

If you are face any issue or want to add anything new, then I request you to raise an issue in the issue section Issues Section link

Data Structures and Algorithms (DSA)

Welcome to the Data Structures and Algorithms (DSA) repository! This repository serves as a comprehensive guide to understanding and implementing various data structures and algorithms. I will be updating the repository on a daily basis as I cover all the topics. Whether you're preparing for coding interviews or simply want to enhance your programming skills, this repository provides valuable resources. (In C programming language)

Things covered till now

  1. Linked List
    • Singly linked list using single pointer
    • Singly linked list using double pointer
    • Singly linked list using global declaration
    • Singly linked list All Operation
    • Doubly linked list using single pointer
    • Doubly linked list using double pointer
    • Doubly linked list All Operation
    • Circular linked list
    • Circular linked list All Operation

Table of Contents

  1. Introduction
  2. Data Structures
  3. Algorithms
  4. Complexity Analysis

Introduction

This repository serves as a comprehensive guide to understanding and implementing various data structures and algorithms. Whether you're preparing for coding interviews or just want to enhance your programming skills, this repository provides valuable resources.

Data Structures

Arrays

  • Definition
  • Operations (Insertion, Deletion, Traversal)
  • Use cases

Linked Lists

  • Singly Linked List
  • Doubly Linked List
  • Circular Linked List
  • Operations (Insertion, Deletion, Traversal)

Stacks

  • Definition
  • Operations (Push, Pop, Peek)
  • Applications (Expression evaluation, Backtracking)

Queues

  • Definition
  • Circular Queue
  • Priority Queue
  • Operations (Enqueue, Dequeue, Front)

Trees

  • Binary Trees
  • Binary Search Trees (BST)
  • AVL Trees
  • B-Trees
  • Tree Traversals (Inorder, Preorder, Postorder)

Graphs

  • Representation (Adjacency Matrix, Adjacency List)
  • Graph Traversals (DFS, BFS)

Hash Tables

  • Definition
  • Operations (Insertion, Deletion, Lookup)
  • Collision resolution techniques (Chaining, Open Addressing)

Algorithms

Sorting Algorithms

  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort

Searching Algorithms

  • Linear Search
  • Binary Search

Dynamic Programming

  • Principles
  • Examples (Fibonacci, Knapsack Problem)

Backtracking

  • Principles
  • Examples (N-Queens, Sudoku Solver)

Greedy Algorithms

  • Principles
  • Examples (Activity Selection, Huffman Coding)

Complexity Analysis

  • Time Complexity
  • Space Complexity
  • Big O Notation

Thank you for reading

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages