Data-Structures-and-Algorithms-Workshop

KO | EN

gitlite — search

#javascript #hacktoberfest #typescript #go #machine-learning #rust #linux #awesome #cli #vue #pytorch #security #ios #open-source

Data-Structures-and-Algorithms-Workshop

(★ 30)

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 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Data-Structures-and-Algorithms-Workshop

## Day 1 : Standard Template library
* Further reading
  1. [http://www.cplusplus.com/reference/](http://www.cplusplus.com/reference/)
  2. [https://www.geeksforgeeks.org/the-c-standard-template-library-stl/](https://www.geeksforgeeks.org/the-c-standard-template-library-stl/)
  3. [Codes used during lectures](https://github.com/pcon-jsr/Data-Structures-and-Algorithms-Workshop/tree/master/Workshop%20Day1)
* Practice problems
  1. [STL Practice](https://www.hackerrank.com/domains/cpp?filters%5Bsubdomains%5D%5B%5D=stl)
  2. [Easy 1](https://www.hackerearth.com/practice/data-structures/hash-tables/basics-of-hash-tables/practice-problems/algorithm/frequency-of-students/)
  3. [Easy 2](https://www.hackerearth.com/practice/data-structures/hash-tables/basics-of-hash-tables/practice-problems/algorithm/the-electric-type/)
  4. [Easy Medium 1](https://www.hackerearth.com/practice/data-structures/hash-tables/basics-of-hash-tables/practice-problems/algorithm/mind-palaces-3/)
  5. [Medium Hard 1](https://www.hackerrank.com/challenges/sherlock-and-anagrams/problem?h_l=interview&playlist_slugs%5B%5D%5B%5D=interview-preparation-kit&playlist_slugs%5B%5D%5B%5D=dictionaries-hashmaps)
  6. [Easy Medium 2](https://practice.geeksforgeeks.org/problems/relative-sorting/0)
  
## Day 2 : Arrays , Binary Search , Linked Lists
 * Further Reading
   1. [Detect loop in a linked list](https://www.geeksforgeeks.org/detect-loop-in-a-linked-list/)
   2. [How Does Floyd Cycle Detection Work](https://www.geeksforgeeks.org/how-does-floyds-slow-and-fast-pointers-approach-work/)
   3. [Check if a linked list is a Palindrome](https://www.geeksforgeeks.org/function-to-check-if-a-singly-linked-list-is-palindrome/)
   4. [Binary Search Reference](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-search/)
   5. [Codes used during lectures](https://github.com/pcon-jsr/Data-Structures-and-Algorithms-Workshop/tree/master/Workshop%20Day%202)
 * Practice Problems
   1. [Easy 1 Linked List](https://www.hackerrank.com/challenges/reverse-a-doubly-linked-list/problem)
   2. [Easy Medium 1 Linked List](https://www.hackerrank.com/challenges/find-the-merge-point-of-two-joined-linked-lists/problem)
   3. [Easy Medium 2 Linked List](https://www.hackerrank.com/challenges/delete-duplicate-value-nodes-from-a-sorted-linked-list/problem)
   4. [Medium Hard 1 Linked List](https://practice.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1)
   5. [Easy 1 Binary Search](https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/monks-encounter-with-polynomial/)
   6. [Easy 2 Binary Search(lower bound implementation)](https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/the-soap-mystery/)
   7. [Easy 3 Binary Search](https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/highest-average-64bdd761/)
   8. [Easy Medium 1 Binary Search](https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/the-enlightened-ones/)
   9. [Easy Medium 2 Binary Search](https://www.spoj.com/problems/AGGRCOW/)
   10. [Medium Hard Binary Search](https://www.hackerrank.com/contests/practice-1-pcon/challenges/little-geometry/problem)
   11. [Easy 1 Array](https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/long-atm-queue-3/)
   12. [Easy 2 Array](https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/can-you-solve-it/)
   13. [Medium Array](http://codeforces.com/problemset/problem/224/B)
   
## Day 3 : Stacks, Queues , Strings
 * Further Reading
   1. [Longest Substring with k distinct characters](https://www.geeksforgeeks.org/find-the-longest-substring-with-k-unique-characters-in-a-given-string/)
   2. [Maximum area in a histogram](https://www.geeksforgeeks.org/largest-rectangle-under-histogram/)
   3. [Stock Span Problem](https://www.geeksforgeeks.org/the-stock-span-problem/)
   4. [Stack using queue](https://www.geeksforgeeks.org/implement-stack-using-queue/)
   5. [Minimum Element in a stack](https://www.geeksforgeeks.org/design-a-stack-that-supports-getmin-in-o1-time-and-o1-extra-space/)
   6. [Codes used during lectures](https://github.com/pcon-jsr/Data-Structures-and-Algorithms-Workshop/tree/master/Workshop%20Day%203)
 * Practice Problems
   1. [Easy 1 String](https://www.hackerrank.com/challenges/pangrams/problem)
   2. [Easy 2 String](https://www.hackerrank.com/challenges/reduced-string/problem)
   3. [Easy Medium 1 String](https://www.hackerearth.com/practice/algorithms/string-algorithm/basics-of-string-manipulation/practice-problems/algorithm/make-the-cheapest-palindrome-1/)
   4. [Easy 3 String](https://www.hackerearth.com/practice/algorithms/string-algorithm/basics-of-string-manipulation/practice-problems/algorithm/secret-messages/)
   5. [Easy 1 Stack and Queue](https://www.hackerearth.com/practice/data-structures/stacks/basics-of-stacks/practice-problems/algorithm/stakth-1-e6a76632/)
   6. [Easy 2 Stack and Queue](https://www.hackerearth.com/practice/data-structures/stacks/basics-of-stacks/practice-problems/algorithm/sniper-shooting/)
   7. [Easy 3 Stack and Queue](https://www.hackerearth.com/practice/data-structures/stacks/basics-of-stacks/practice-problems/algorithm/staque-1-e790a29f/)
   8. [Easy Medium 1 Stack and Queue](https://www.hackerrank.com/challenges/game-of-two-stacks/problem)
   9. [Easy Medium 2 Stack and Queue](https://www.hackerrank.com/challenges/castle-on-the-grid/problem)

## Day 4 : Trees , Heaps
  * Further Reading
    1. [Handshaking Lemma](https://www.geeksforgeeks.org/handshaking-lemma-and-interesting-tree-properties/)
    2. [Binary Tree Types](https://www.geeksforgeeks.org/binary-tree-set-3-types-of-binary-tree/)
    3. [Binary Tree Hackerearth](https://www.hackerearth.com/practice/data-structures/trees/binary-and-nary-trees/tutorial/)
    4. [Binary Search Tree Hackerearth](https://www.hackerearth.com/practice/data-structures/trees/binary-search-tree/tutorial/)
    5. [Binary Search Tree Blog](http://sleepincode.blogspot.com/2017/06/all-about-binary-search-trees.html?m=1)
    6. [Distance between two nodes in a Binary Tree](https://www.geeksforgeeks.org/find-distance-between-two-nodes-of-a-binary-tree/)
    7. [Diameter of Binary Tree using DFS](https://www.geeksforgeeks.org/diameter-tree-using-dfs/)
    8. [Check for Sum path with value k](https://www.geeksforgeeks.org/root-to-leaf-path-sum-equal-to-a-given-number/)
    9. [Codes used during Lecture](https://github.com/pcon-jsr/Data-Structures-and-Algorithms-Workshop/tree/master/Workshop%20Day%204)
  * Practice Problems
    1. [Easy 1 Tree](https://practice.geeksforgeeks.org/problems/vertical-sum/1)
    2. [Easy 2 Tree](https://www.hackerearth.com/practice/data-structures/trees/binary-and-nary-trees/practice-problems/algorithm/mirror-image-2/)
    3. [Easy Medium 1 Tree](https://www.hackerearth.com/practice/data-structures/trees/binary-and-nary-trees/practice-problems/algorithm/mancunian-and-colored-tree/)
    4. [Easy 1 Priority Queue](https://www.hackerearth.com/practice/data-structures/trees/heapspriority-queues/practice-problems/algorithm/monk-and-multiplication/)
    5. [Easy 2 Priority Queue](https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes/0)
    6. [Easy Medium 1 Priority Queue](https://practice.geeksforgeeks.org/problems/merge-k-sorted-arrays/1)
    
## Day 5 : Trie , Segment Tree
 * Further Reading
   1. [Blog on Tries](https://threads-iiith.quora.com/Tutorial-on-Trie-and-example-problems)
   2. [Codeforces blog on Segment Tree](https://codeforces.com/blog/entry/18051)
   3. [Blog on Segment Trees](https://kartikkukreja.wordpress.com/2014/11/09/a-simple-approach-to-segment-trees/)
   4. [Codes used during lectures](https://github.com/pcon-jsr/Data-Structures-and-Algorithms-Workshop/tree/master/Workshop%20Day%205)
* Practice Problems
   1. [Medium 1 Trie](https://www.hackerearth.com/practice/data-structures/advanced-data-structures/trie-keyword-tree/practice-problems/algorithm/registration-system/)
   2. [Medium 1 Segment Tree](https://www.spoj.com/problems/HORRIBLE/)
   3. [Medium 2 Segment Tree](https://www.hackerearth.com/practice/data-structures/advanced-data-structures/segment-trees/practice-problems/algorithm/little-deepu-and-array/)
   
## Day 6 : Graph Theory I
  * Further Reading
    1. [Breadth First Search](https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/tutorial/)
    2. [Depth First Search](https://www.hackerearth.com/practice/algorithms/graphs/depth-first-search/tutorial/)
    3. [Disjoint Set Union (DSU)](https://www.hackerearth.com/practice/data-structures/disjoint-data-strutures/basics-of-disjoint-data-structures/tutorial/)
    4. [Minimum Spanning Tree](https://www.hackerearth.com/practice/algorithms/graphs/minimum-spanning-tree/tutorial)
    5. [Dijkstra](https://www.hackerearth.com/practice/algorithms/graphs/shortest-path-algorithms/tutorial/)
    6. [Codes used during lectures](https://github.com/pcon-jsr/Data-Structures-and-Algorithms-Workshop/tree/master/Workshop%20Day%206)
  * Practice Problems
    1. [Easy 1 BFS](https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/practice-problems/algorithm/monk-and-the-islands/)
    2. [Easy Medium 1 BFS](https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/practice-problems/algorithm/the-circular-jump-9515a45c/)
    3. [Easy Medium 2 BFS](https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/practice-problems/algorithm/the-witches-of-hegwarts-1/)
    4. [Easy Medium 3 BFS](https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/practice-problems/algorithm/dhoom-4/)
    5. [Medium BFS](https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/practice-problems/algorithm/connected-horses-10/)
    6. [Easy 1 DFS](https://www.hackerearth.com/practice/algorithms/graphs/depth-first-search/practice-problems/algorithm/aryas-stunt-63b3da17/)
    7. [Easy 2 DFS](https://www.hackerearth.com/practice/algorithms/graphs/depth-first-search/practice-problems/algorithm/monk-and-graph-problem/)
    8. [Easy Medium DFS](https://www.hackerearth.com/practice/algorithms/graphs/depth-first-search/practice-problems/algorithm/easylife/description/)
    9. [Medium DFS](https://www.hackerearth.com/practice/algorithms/graphs/depth-first-search/practice-problems/algorithm/sg-and-trees/)
    10. [Medium DFS](https://www.hackerearth.com/practice/algorithms/graphs/depth-first-search/practice-problems/algorithm/prison-break-5/)
    11. [Medium DFS](https://www.hackerearth.com/practice/algorithms/graphs/depth-first-search/practice-problems/algorithm/comrades-i-3/)
    12. [Easy MST(Maximum Spanning Tree)](https://www.hackerearth.com/practice/algorithms/graphs/depth-first-search/practice-problems/algorithm/maximum-spanning-tree/)
    13. [Medium DSU(Disjoint Set Union)](https://code.google.com/codejam/contest/3254486/dashboard#s=p1)
    14. [Hard DSU](http://codeforces.com/contest/1027/problem/F)
    15. [Medium Hard](http://codeforces.com/contest/1037/problem/E)
    16. [Easy Medium](https://www.hackerrank.com/challenges/torque-and-development/problem)
  ## Day 7 : Graph 2
   * Further Reading
      1. [Strongly Connected Components](https://www.hackerearth.com/practice/algorithms/graphs/strongly-connected-components/tutorial/)
      2. [Euler Tour](https://www.geeksforgeeks.org/euler-tour-tree/)
      3. [Hamiltonian Path](https://www.hackerearth.com/practice/algorithms/graphs/hamiltonian-path/tutorial/)
      4. [Articulation Points and Bridges](https://www.hackerearth.com/practice/algorithms/graphs/articulation-points-and-bridges/practice-problems/)
  * Practice Problems
    1. [Shortest Path Easy 1](https://www.hackerearth.com/practice/algorithms/graphs/shortest-path-algorithms/practice-problems/algorithm/mittal-wants-to-go-to-play/)
    2. [Shortest Path Easy Medium 1](https://www.hackerearth.com/practice/algorithms/graphs/shortest-path-algorithms/practice-problems/algorithm/irctc/)
    3. [Shortest Path Medium 1](https://www.hackerrank.com/challenges/dijkstrashortreach/submissions)
    4. [Hamiltonian Path Easy 1](https://www.hackerearth.com/practice/algorithms/graphs/hamiltonian-path/practice-problems/algorithm/micro-and-coins/)
    5. [Hamiltonian Path Easy 2](https://www.hackerearth.com/practice/algorithms/graphs/hamiltonian-path/practice-problems/algorithm/micro-and-permutations/)
    6. [SCC Easy 1](https://www.hackerearth.com/practice/algorithms/graphs/strongly-connected-components/practice-problems/algorithm/a-walk-to-remember-qualifier2/)
    7. [Shortest Path Easy Medium 2](https://www.hackerearth.com/practice/algorithms/graphs/shortest-path-algorithms/practice-problems/algorithm/booze-first-76e979dd/)
    8. [Bridges and AP Easy 1](https://www.hackerearth.com/practice/algorithms/graphs/articulation-points-and-bridges/practice-problems/algorithm/rhezo-and-destructive-mind/)
    9. [Bridges and AP Easy Medium 2](https://www.hackerearth.com/practice/algorithms/graphs/articulation-points-and-bridges/practice-problems/algorithm/sg-and-graphs/)
## Day 8 : Dynamic Programming I
  * Further Reading
    1. [Introduction to Dynamic Programming I](https://www.youtube.com/watch?v=OQ5jsbhAv_M&feature=youtu.be&list=PLfMspJ0TLR5HRFu2kLh3U4mvStMO8QURm)
    2. [Introduction to Dynamic Programming II](https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/lecture-videos/MIT6_006F11_lec19.pdf)
    3. [LCA - Lowest Common Ancestor and Sparse Table](https://www.topcoder.com/community/data-science/data-science-tutorials/range-minimum-query-and-lowest-common-ancestor/#Lowest%20Common%20Ancestor%20(LCA))
    4. [Unbounded Knapsack](https://www.geeksforgeeks.org/unbounded-knapsack-repetition-items-allowed/)
    5. [Fractional Knapsack](https://www.geeksforgeeks.org/fractional-knapsack-problem/)
  * Practice Problems
    1. [Maximim Sum such that no two elements are adjacent](https://www.geeksforgeeks.org/maximum-sum-such-that-no-two-elements-are-adjacent/)
    2. [Maximum Sum sub array in an array(Kadane’s Algorithm)](https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/)
    3. [Longest Increasing Subsequence](https://www.geeksforgeeks.org/longest-increasing-subsequence-dp-3/)
    4. [Longest Common Subsequence in given two Strings](https://www.geeksforgeeks.org/longest-common-subsequence-dp-4/)
    5. [0/1 Knapsach Bounded](https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/)
    6. [Easy Medium 1](https://www.hackerearth.com/practice/algorithms/dynamic-programming/introduction-to-dynamic-programming-1/practice-problems/algorithm/coin-problem-2/)
    7. [Easy Medium 2](https://www.hackerearth.com/practice/algorithms/dynamic-programming/2-dimensional/practice-problems/algorithm/largest-subsequence-c554fb8c/)

Data-Structures-and-Algorithms-Workshop

Data-Structures-and-Algorithms-Workshop 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Data-Structures-and-Algorithms-Workshop

Data-Structures-and-Algorithms-Workshop 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README