pcon-jsr / Data-Structures-and-Algorithms-Workshop

This repository contains references , questions and class notes prepared during the data structures and algorithms workshop by Programming Club of NIT Jamshedpur

Data-Structures-and-Algorithms-Workshop

Day 1 : Standard Template library

• Further reading
  1. http://www.cplusplus.com/reference/
  2. https://www.geeksforgeeks.org/the-c-standard-template-library-stl/
  3. Codes used during lectures
• Practice problems
  1. STL Practice
  2. Easy 1
  3. Easy 2
  4. Easy Medium 1
  5. Medium Hard 1
  6. Easy Medium 2

Day 2 : Arrays , Binary Search , Linked Lists

• Further Reading
  1. Detect loop in a linked list
  2. How Does Floyd Cycle Detection Work
  3. Check if a linked list is a Palindrome
  4. Binary Search Reference
  5. Codes used during lectures
• Practice Problems
  1. Easy 1 Linked List
  2. Easy Medium 1 Linked List
  3. Easy Medium 2 Linked List
  4. Medium Hard 1 Linked List
  5. Easy 1 Binary Search
  6. Easy 2 Binary Search(lower bound implementation)
  7. Easy 3 Binary Search
  8. Easy Medium 1 Binary Search
  9. Easy Medium 2 Binary Search
  10. Medium Hard Binary Search
  11. Easy 1 Array
  12. Easy 2 Array
  13. Medium Array

Day 3 : Stacks, Queues , Strings

• Further Reading
  1. Longest Substring with k distinct characters
  2. Maximum area in a histogram
  3. Stock Span Problem
  4. Stack using queue
  5. Minimum Element in a stack
  6. Codes used during lectures
• Practice Problems
  1. Easy 1 String
  2. Easy 2 String
  3. Easy Medium 1 String
  4. Easy 3 String
  5. Easy 1 Stack and Queue
  6. Easy 2 Stack and Queue
  7. Easy 3 Stack and Queue
  8. Easy Medium 1 Stack and Queue
  9. Easy Medium 2 Stack and Queue

Day 4 : Trees , Heaps

• Further Reading
  1. Handshaking Lemma
  2. Binary Tree Types
  3. Binary Tree Hackerearth
  4. Binary Search Tree Hackerearth
  5. Binary Search Tree Blog
  6. Distance between two nodes in a Binary Tree
  7. Diameter of Binary Tree using DFS
  8. Check for Sum path with value k
  9. Codes used during Lecture
• Practice Problems
  1. Easy 1 Tree
  2. Easy 2 Tree
  3. Easy Medium 1 Tree
  4. Easy 1 Priority Queue
  5. Easy 2 Priority Queue
  6. Easy Medium 1 Priority Queue

Day 5 : Trie , Segment Tree

• Further Reading
  1. Blog on Tries
  2. Codeforces blog on Segment Tree
  3. Blog on Segment Trees
  4. Codes used during lectures
• Practice Problems
  1. Medium 1 Trie
  2. Medium 1 Segment Tree
  3. Medium 2 Segment Tree

Day 6 : Graph Theory I

• Further Reading
  1. Breadth First Search
  2. Depth First Search
  3. Disjoint Set Union (DSU)
  4. Minimum Spanning Tree
  5. Dijkstra
  6. Codes used during lectures
• Practice Problems
  1. Easy 1 BFS
  2. Easy Medium 1 BFS
  3. Easy Medium 2 BFS
  4. Easy Medium 3 BFS
  5. Medium BFS
  6. Easy 1 DFS
  7. Easy 2 DFS
  8. Easy Medium DFS
  9. Medium DFS
  10. Medium DFS
  11. Medium DFS
  12. Easy MST(Maximum Spanning Tree)
  13. Medium DSU(Disjoint Set Union)
  14. Hard DSU
  15. Medium Hard
  16. Easy Medium

Day 7 : Graph 2

• Further Reading
  1. Strongly Connected Components
  2. Euler Tour
  3. Hamiltonian Path
  4. Articulation Points and Bridges
• Practice Problems
  1. Shortest Path Easy 1
  2. Shortest Path Easy Medium 1
  3. Shortest Path Medium 1
  4. Hamiltonian Path Easy 1
  5. Hamiltonian Path Easy 2
  6. SCC Easy 1
  7. Shortest Path Easy Medium 2
  8. Bridges and AP Easy 1
  9. Bridges and AP Easy Medium 2

Day 8 : Dynamic Programming I

• Further Reading
  1. Introduction to Dynamic Programming I
  2. Introduction to Dynamic Programming II
  3. LCA - Lowest Common Ancestor and Sparse Table
  4. Unbounded Knapsack
  5. Fractional Knapsack
• Practice Problems
  1. Maximim Sum such that no two elements are adjacent
  2. Maximum Sum sub array in an array(Kadane’s Algorithm)
  3. Longest Increasing Subsequence
  4. Longest Common Subsequence in given two Strings
  5. 0/1 Knapsach Bounded
  6. Easy Medium 1
  7. Easy Medium 2