Skip to content

abhishek2chikun/200daysofdsa

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

48 Commits
38-39 Min Heap Construction.py
38-39 Min Heap Construction.py
 
 
44 Nth Fibonacci.py
44 Nth Fibonacci.py
 
 
Day 11(Find the loop and make a loop on a linked list).ipynb
Day 11(Find the loop and make a loop on a linked list).ipynb
 
 
Day 12 Nth node from last.ipynb
Day 12 Nth node from last.ipynb
 
 
Day 13 Find and count N node in Linked List.ipynb
Day 13 Find and count N node in Linked List.ipynb
 
 
Day 14(Circular linked list Insertion).ipynb
Day 14(Circular linked list Insertion).ipynb
 
 
Day 15 Double Linked List.py
Day 15 Double Linked List.py
 
 
Day 16 Stack as Array and Linkedlist.py
Day 16 Stack as Array and Linkedlist.py
 
 
Day 17 BalanceBracket.py
Day 17 BalanceBracket.py
 
 
Day 17 MinMaxStack using array.py
Day 17 MinMaxStack using array.py
 
 
Day 17MinmaxStack using Linked list.py
Day 17MinmaxStack using Linked list.py
 
 
Day 18 Circular queue.py
Day 18 Circular queue.py
 
 
Day 18 Queue in Linked List.py
Day 18 Queue in Linked List.py
 
 
Day 18 Queue in array.py
Day 18 Queue in array.py
 
 
Day 19 deque as Linked List.py
Day 19 deque as Linked List.py
 
 
Day 19 priority queue as linked list.py
Day 19 priority queue as linked list.py
 
 
Day 20 hash.py
Day 20 hash.py
 
 
Day 22 Tree traversal without recursion.py
Day 22 Tree traversal without recursion.py
 
 
Day 22 Tree traversal without(stack and recursion).py
Day 22 Tree traversal without(stack and recursion).py
 
 
Day 22 Tree traversal.py
Day 22 Tree traversal.py
 
 
Day 23 Complete Binary tree.py
Day 23 Complete Binary tree.py
 
 
Day 23 Full binary tree.py
Day 23 Full binary tree.py
 
 
Day 23 Perfect binary tree.py
Day 23 Perfect binary tree.py
 
 
Day 24 Size of a Tree.py
Day 24 Size of a Tree.py
 
 
Day 24Maximum value of a tree.py
Day 24Maximum value of a tree.py
 
 
Day 25 Height of node.py
Day 25 Height of node.py
 
 
Day 25 print K node.py
Day 25 print K node.py
 
 
Day 27 Flatten a Binary Teee.py
Day 27 Flatten a Binary Teee.py
 
 
Day 28 Level order traversal.py
Day 28 Level order traversal.py
 
 
Day 29 Binary Tree from inorder and preorder.py
Day 29 Binary Tree from inorder and preorder.py
 
 
Day 29Least Common Ancestor.py
Day 29Least Common Ancestor.py
 
 
Day 36 hashmap.py
Day 36 hashmap.py
 
 
Day 37 Rehashing.py
Day 37 Rehashing.py
 
 
Day 4(Text to speech).ipynb
Day 4(Text to speech).ipynb
 
 
Day 40 Continous Median.py
Day 40 Continous Median.py
 
 
Day 41 Priority queue using Heap.py
Day 41 Priority queue using Heap.py
 
 
Day 45 Power set.py
Day 45 Power set.py
 
 
Day 45 Product Sum.py
Day 45 Product Sum.py
 
 
Day 46 Three Largest Number.py
Day 46 Three Largest Number.py
 
 
Day 5(Time complexity).pdf
Day 5(Time complexity).pdf
 
 
Day 6(Linked List).ipynb
Day 6(Linked List).ipynb
 
 
Day 7 Linked list operation.py
Day 7 Linked list operation.py
 
 
Day 8(linked list problem).ipynb
Day 8(linked list problem).ipynb
 
 
Day 9(Linked list push and simpler swap).ipynb
Day 9(Linked list push and simpler swap).ipynb
 
 
Day1.ipynb
Day1.ipynb
 
 
Day10(Reverse and Merge on Linked List).ipynb
Day10(Reverse and Merge on Linked List).ipynb
 
 
Day2.ipynb
Day2.ipynb
 
 
Day3(Numpy,CP).ipynb
Day3(Numpy,CP).ipynb
 
 
README.md
README.md
 
 

Repository files navigation

200 days of Code(In Python).

Here I upload my daily practise of code of Data Structure and Algorithm in Python Programming language .

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

4 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages