Skip to content
/ pythonDataStructureAndAlgorithm Public

This tutorial is for python developer from Basic to Advance. And it is divided into two sections; data structure section and algorithms section.

2 stars 1 fork Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

triplee12/pythonDataStructureAndAlgorithm

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits

AVLTree

AVLTree

 
 

TreeDataStructure

TreeDataStructure

 
 

Trie

Trie

 
 

arrays

arrays

 
 

bigONotation

bigONotation

 
 

binarySearchTree

binarySearchTree

 
 

dictionary

dictionary

 
 

divideAndConquer

divideAndConquer

 
 

graph

graph

 
 

greedy

greedy

 
 

hashing

hashing

 
 

introduction

introduction

 
 

linkedList

linkedList

 
 

lists

lists

 
 

queue

queue

 
 

recursion

recursion

 
 

sorting

sorting

 
 

stack

stack

 
 

tuples

tuples

 
 

README.md

README.md

 
 

Repository files navigation

CURRICULUM

This tutorial is for python developer from Basic to Advance. And it is divided into two sections; data structure section and algorithms section.

Data Structure

  1. Introduction
  • What is data structure?
  • What is algorithms?
  1. Recursion
  • Every important section before diving into data structure and algorithm.

  1. Cracking Recursion Job Interview Questions

  2. Big O Notation

  3. Cracking Big O Notation Job Interview Questions

  4. Arrays

  • One dimensional arrays
  • Two dimensional arrays
  • How arrays are structured in memory?

  1. Python List

  2. Cracking Arrays And List Job Interview Questions

  3. Dictionaries

  4. Tuples

  5. Linked List

  • Singly linked list
  • Circular singly linked list
  • Double linked list
  • Circular doubly linked list

  1. Cracking Linked List Job Interview Questions

  2. Stack

  3. Queue

  4. Cracking Stack And Queue Job Interview Questions

  5. Tree / Binary Tree

  • PreOrder Traversal
  • InOrder Traversal
  • PostOrder Traversal
  • LevelOrder Traversal

  1. Binary Search Tree

  2. AVL Tree

  • Left Left condition
  • Left Right condition
  • Right Right condition
  • Right Left condition

  1. Binary Heap

  2. Trie

  3. Hashing

Algorithms

  1. Sort Algorithms
  • Bubble sort
  • Selection sort
  • Insertion sort
  • Bucket sort
  • Merge sort
  • Quick sort
  • Heap sort
  1. Graph Algorithms
  • Breadth First Search
  • Depth First Search
  • Topological sort
  • Single Source Shortest Path Problem
  • All Pair Shortest Path Problem

  1. Dijkstra Algorithm

  2. Bellman Ford Algorithm

  3. Ford Warshall Algorithm

  4. Minimum Spanning Tree

  • Prim's Algorithm
  • Kruskal's Algorithm
  1. Greedy Algorithms
  • Activity selection problem
  • Coin change problem
  • Fractional Knapsack problem
  1. Divide And Conquer Algorithms
  • Number Factor Problem
  • House Robber Problem
  • Convert one string to another string
  • Zero one Knapsack problem
  • Long common subsequence
  • Longest Palindromic subsequence / subsring
  • Minimum cost path problem
  1. Dynamic Programming Algorithms
  • Main properties
  • Optimal substructure
  • Overlapping subproblems
  • Top Down - memoization
  • Bottom Up - Tabulation
  • Common DC problems
    • Number factor
    • House Robber
    • Convert one string to another string
    • Zero one Knapsack using DC
  1. The Wild West

About

This tutorial is for python developer from Basic to Advance. And it is divided into two sections; data structure section and algorithms section.

Resources

Readme
Activity

Stars

2 stars

Watchers

2 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

No packages published

Languages