DataStructures And Algorithms

My Study of DataStructures and Algorithms

Resource

• Techiedelight
• programiz.com cpp-programming
• Tutorials Point - youtube
• Sources - Gaurav Sen,Rachit Jain - competitive programming

DataStructures & Algorithm Courses

• In JavaScript :

  • The Coding Interview Bootcamp: Algorithms + Data Structures - Stephen Grider [JavaScript]
  • JavaScript Algorithms and Data Structures Masterclass - Colt Steele
  • Master the Coding Interview: Data Structures + Algorithms - Andrei Neagoie

• In C,C++ :

  • Learn C++ Programming -Beginner to Advance- Deep Dive in C++ - Abdul Bari
  • Mastering Data Structures & Algorithms using C and C++ - Abdul Bari
  • Data Structures and Algorithms Through C In Depth - Deepali Srivastava
  • Beginning C++ Programming - From Beginner to Beyond - Tim Buchalka
  • Beginning Modern C++ (C++11/C++14) - Umar Lone
  • C/C++ Pointers & Applications - Umar Lone
  • Detecting Memory Leaks in C/C++ Applications - Umar Lone
  • Advanced C++ Programming Training Course - Infinite Skills

• In Python :

  • Python for Data Structures, Algorithms, and Interviews! - Jose Portilla
  • Complete Python Bootcamp: Go from zero to hero in Python 3 -Jose Portilla
  • Python for Data Science and Machine Learning Bootcamp - Jose Portilla
  • Python and Django Full Stack Web Developer Bootcamp - Jose Portilla
  • Learn Python Programming Masterclass - Tim Buchalka
  • The Python Mega Course: Build 10 Real World Applications - Ardit Sulce

• From Geek youtube channel

  • [96]Arrays()
  • [56]LinkedList()
  • [21]Stack()
  • [8]Queue()
  • [28]Graph()
  • [199]Trees
  • [8]Hashing()
  • [2]Trie()
  • [4]Matrix()
  • [60]Amazon
  • [35]Microsift()
  • [4]Google
  • [14]Samsung()
  • [13]Adobe
  • [4]Facebook()
  • [10]Oracle()
  • [8]GoldMan()
  • [14]Flipkart()
  • [9]Cisco()
  • [9]Morgan
  • [7]Visa

1. Arrays - Dynamic
2. Recursion
3. Searching Algorithm
4. Sorting Algorithm
5. Linked Lists
6. Stacks
7. Queues
8. Binary Search Trees
9. Tree Traversal
10. Binary Heaps
11. Hash Tables
12. Graphs
13. Graph Traversal
14. Dijkstra's algorithm

• Dynamic Programming - developed by Richard Bellman in the 1950s
  1. Many string algorithms including
     • Longest_common_subsequence_problem
     • Longest_increasing_subsequence
     • Longest_common_substring_problem
  2. Many algorithmic problems on graphs can be solved efficiently using dynamic programming on a tree decomposition of the graph
     • graphs of bounded treewidth
     • graphs of bounded clique-width
  3. Knuth's word wrapping algorithm that minimizes raggedness when word wrapping text

1. []()      
   - [1]()
     - [2]()
       - [3]()              
1. []()

   
   
   - []()
   - []()
   - []()
   - []()
   - []()

• Heading
  • Sub-heading
    • Sub-sub-heading

• Dynamic Programming:
  • Overlapping Subproblems Property
  • Optimal Substructure Property
  • Longest Increasing Subsequence
  • Longest Common Subsequence
  • Edit Distance
  • Min Cost Path
  • Coin Change
  • Matrix Chain Multiplication
  • Binomial Coefficient
  • 0-1 Knapsack Problem
  • Egg Dropping Puzzle
  • Longest Palindromic Subsequence
  • Cutting a Rod
  • Maximum Sum Increasing Subsequence
  • Longest Bitonic Subsequence
  • Floyd Warshall Algorithm
  • Palindrome Partitioning
  • Partition problem
  • Word Wrap Problem
  • Maximum Length Chain of Pairs
  • Variations of LIS
  • Box Stacking Problem
  • Program for Fibonacci numbers
  • Minimum number of jumps to reach end
  • Maximum size square sub-matrix with all 1s
  • Ugly Numbers
  • Largest Sum Contiguous Subarray
  • Longest Palindromic Substring
  • Bellman–Ford Algorithm for Shortest Paths
  • Optimal Binary Search Tree
  • Largest Independent Set Problem
  • Subset Sum Problem
  • Maximum sum rectangle in a 2D matrix
  • Count number of binary strings without consecutive 1's
  • Boolean Parenthesization Problem
  • Count ways to reach the n’th stair
  • Minimum Cost Polygon Triangulation
  • Mobile Numeric Keypad Problem
  • Count of n digit numbers whose sum of digits equals to given sum
  • Minimum Initial Points to Reach Destination
  • Total number of non-decreasing numbers with n digits
  • Find length of the longest consecutive path from a given starting character
  • Tiling Problem
  • Minimum number of squares whose sum equals to given number n
  • Find minimum number of coins that make a given value
  • Collect maximum points in a grid using two traversals
  • Shortest Common Supersequence
  • Compute sum of digits in all numbers from 1 to n
  • Count possible ways to construct buildings
  • Maximum profit by buying and selling a share at most twice
  • How to print maximum number of A’s using given four keys
  • Find the minimum cost to reach destination using a train
  • Vertex Cover Problem | Set 2 (Dynamic Programming Solution for Tree)
  • Count number of ways to reach a given score in a game
  • Weighted Job Scheduling
  • Longest Even Length Substring such that Sum of First and Second Half is same