readme.md

DS ALGO With Python

Data Structure And Algorithm Implementation in Python

Topics:

Arrays:

• Dynamic Array Implementation
• Adding an element at specific location and removing a particular value
• Cryptography Problem
• Tic Tac Toe Game
• Buildin Function in Array

Link To Work:here

Stack:

• Implementing a Stack Using a Python List.
• Avoiding Amortization by Reserving Capacity
• Matching Parentheses and HTML Tags
• Matching Tags in a Markup Language Link To Work:here

Queue:

• FIFO Queue using queue module
• LIFO queue using queue module (technically call stack)
• Array Based Queue Implementation
• DEQUE
• priority queue

Link To Work:here

Linked List:

• Implenetation of stack using linked list.
• Implementation of queue using linked list.
• Circular Queue Implementation
• Doubly Linked List

Link To Work:here

Tree:

• Tree Implementation using Array.
• Insertion in a Binary Tree in level order
• Height of Tree
• Traversing a tree through level order
• Tree Traversal(preorder postorder, inorder)
• Expression Tree
• Printing the level order in reverse order
• Finding max element in binary tree

Link To Work:here

Bitwise Programming:

• checking kth bit is set or not
• setting the kth bit
• toggling the kth bit
• clearing the kth bit
• toggling right most one bit
• Modifying kth bit (0-1,1-0)
• counting no of 1's in no
• checking wheather no is power of 2 or not

Link To Work:here

Heap:

• priority queue using heap (min heap)
• Bottom-Up Heap Construction
• heapq Module
• HeapSort
• Adaptable Heap Priority queue

Link To Work:here

Dynamic Programming and Tries(Basics):

• Fibnoccii series
• Rod Cutting Problem(Top Down and Bottom Up Approach)
• Longest Common Subsequence
• 0/1 Knapsack
• Fraction KnapSack Problem
• Subset Sum Problem
• Coin Changing Problem
• Tries(intro code)
• Matrix Chain Multiplication
• Job Scheduling (greedy Approach)

Link To Work:here