Skip to content

Repository contains implementation of different data structures and problems related to them.

License

Notifications You must be signed in to change notification settings

prakharjadaun/DSA

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation


Markdownify
Master Data Structures and Algorithms with ease

Arrays • Strings • Bitwise Manip. • Linked List • Queue • Stack • Hash Table • Sorting

Searching • Recursion • Binary Tree • Binary Search Tree • Graph • Dynamic Programming

Numbers • Favorites
Count : 471

Numbers

Arrays

Basic Programs

Problems

Matrix

Strings

Bitwise Operations

Linked List

Basic Programs

  • Insertion at the end.
  • Insertion at the beginning.
  • Insertion at the middle of the linked list.
  • Deleting the last node.
  • Deleting the first node.
  • Deleting the middle node.
  • Calculating the length of list using iteration and the recursion.
  • Searching an item using iteration and recursion.
  • Implementation of doubly linked list.

Circular Linked List

  • Creating a circular linked list from scratch.
  • Inserting at end and beginning of the circular linked list
  • Deleting the last and the first element of the circular linked list.

Problems

Queue

Basic Program

  • Basic operations of queue
  • Queue using stack.
  • Priority Queue using STL.
  • Priority Queue using linked list.

Problems

Hash Table

Basic Programs

Problems

Stack

Basic programs

  • Basic operations of stack.
  • Implementing stack using queues.
  • Reverse a string using stack.

Problems

Sorting

Types of Sorting Algo and their uses

Problems

Searching

  • Unordered Linear Search
  • Ordered Linear Search
  • Binary Search
  • Interpolation search

Problems

  • Maximum frequency of an element in array

Recursion

Basic Programs

  • Factorial using recursion
  • Print numbers 1 to N in backwards
  • Fibonacci Series
  • Binary Search

Problems

Backtracking

Problems

Binary Tree

Basic Operations

Problems

Binary Search Tree

Basic Operations

  • Creating a binary search tree.
  • Find the maximum and the minimum element of the binary search tree
  • Searching in the binary search tree
  • Printing the InOrder Predecessor and Successor of an element.

Problems

Graph

Basic programs

Problems

Dynamic Programming

Problems

Favorites