Skip to content

Commit

Permalink
study sources updated up to week 6
Browse files Browse the repository at this point in the history
  • Loading branch information
@BedirT
BedirT committed Sep 23, 2022
1 parent 916fb69 commit 1114d05
Show file tree
Hide file tree
Showing 3 changed files with 60 additions and 87 deletions.
46 changes: 18 additions & 28 deletions Week04/README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -2,55 +2,45 @@

## Merge Sort

#### [Tutorial]()

#### Other Study Sources
#### Video Sources
- [Youtube - Michael Sambol (3 min)](https://www.youtube.com/watch?v=4VqmGXwpLqc)
- [Hackerrank](https://www.youtube.com/watch?v=KF2j-9iSf4Q)
- [CS50](https://www.youtube.com/watch?v=Pr2Jf83_kG0)

#### Written Sources
- [CommonLounge - Nicetut](https://www.commonlounge.com/discussion/fe6ac441785c44d6a959eab662f15adc)
- [GeeksforGeeks](https://www.geeksforgeeks.org/merge-sort/)
- [Hackerrank (Video)](https://www.youtube.com/watch?v=KF2j-9iSf4Q)
- [Youtube - Michael Sambol (3 min)](https://www.youtube.com/watch?v=4VqmGXwpLqc)
- [CS50 (Video)](https://www.youtube.com/watch?v=Pr2Jf83_kG0)

#### Source Codes

#### Questions

- [MERGESORT](http://www.spoj.com/problems/MERGSORT/)
- [Merge Sort](https://www.codechef.com/problems/MRGSRT)
- [Counting Inversions in an Array](https://www.spoj.com/problems/INVCNT/)
- [Java solution](https://github.com/rajat123456/General-Competitive-Programming-Questions/blob/master/SPOJ(INVCNT).java)
- [Maximum SubArray](https://leetcode.com/problems/maximum-subarray/description/)
- [Java solution](https://github.com/rajat123456/General-Competitive-Programming-Questions/blob/master/(LeetCode)Maximum%20Sum%20Subaray.java)
- [Counting Inversions in an Array](https://www.spoj.com/problems/INVCNT/) | [Java](https://github.com/rajat123456/General-Competitive-Programming-Questions/blob/master/SPOJ(INVCNT).java)
- [Maximum SubArray](https://leetcode.com/problems/maximum-subarray/description/) | [Java](https://github.com/rajat123456/General-Competitive-Programming-Questions/blob/master/(LeetCode)Maximum%20Sum%20Subaray.java)



## Binary Search

#### [Tutorial]()
#### Video Sources
- [Youtube - Reallearning](https://www.youtube.com/watch?v=vohuRrwbTT4)

#### Other Study Sources
- [Youtube - Reallearning](https://www.youtube.com/watch?v=vohuRrwbTT4) (_Recommended_)
#### Written Sources
- [Topcoder](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-search/)
- [Wikipedia](https://en.wikipedia.org/wiki/Binary_search_algorithm)
- [Interview Cake](https://www.interviewcake.com/concept/java/binary-search)

#### Source Codes
- Bedir - [C++](https://github.com/BedirT/AlgorithmsL/blob/master/Algorithms/Searching/binarySearch.cpp)
- Nadide- [C](https://github.com/nadide/ACM-ICPC/blob/master/codes/search_binarySearch.c)
- C++ | [s0](https://github.com/BedirT/AlgorithmsL/blob/master/Algorithms/Searching/binarySearch.cpp)
- C | [s0](https://github.com/nadide/ACM-ICPC/blob/master/codes/search_binarySearch.c)

#### Questions
- Small interview question that will make you practice this topic: [Ordered Set](https://www.interviewcake.com/question/python/find-in-ordered-set)
- ( _Solution is as same as the normal source code_ )
- [Search Insert Position](https://leetcode.com/problems/search-insert-position/)
- [Bedir's Solution](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/Curriculum%20Q's/Week%203/Search%20Insert%20Position.cpp)
- [Nadide's Solution](https://github.com/nadide/ACM-ICPC/blob/master/problems/other/insertPosition.c)
- [10 beautiful practice question](http://www.infoarena.ro/blog/binary-search-shortlist)
- [Bedir's Solutions](https://github.com/BedirT/AlgorithmsL/tree/master/Problems/Curriculum%20Q's/Week%203/Binary%20Search%20Shortlist)
- [Ice Cream Parlor](https://www.hackerrank.com/challenges/icecream-parlor)
- [Bedir's solution](https://github.com/NAU-ACM/Competitive-Programming/blob/master/HackerRank/Practices/Algorithms/Search/Ice%20Cream%20Parlor.cpp)
- [Nadide's solution](https://github.com/nadide/ACM-ICPC/blob/master/problems/hackerrank/X_iceCreamParlor.c)
- [Maximum Subarray Sum](https://www.hackerrank.com/challenges/maximum-subarray-sum)
- [Nadide's solution](https://github.com/nadide/ACM-ICPC/blob/master/problems/hackerrank/X_maximumSubarraySum.cpp)
- [Aggressive Cows](https://www.spoj.com/problems/AGGRCOW/)
- [Java solution](https://github.com/rajat123456/General-Competitive-Programming-Questions/blob/master/(SPOJ)Aggressive%20Cows.java)
- ( _Solution is same as the normal source code_ )
- [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [C++](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/Curriculum%20Q's/Week%203/Search%20Insert%20Position.cpp), [C](https://github.com/nadide/ACM-ICPC/blob/master/problems/other/insertPosition.c)
- [10 beautiful practice question](http://www.infoarena.ro/blog/binary-search-shortlist) | [C++](https://github.com/BedirT/AlgorithmsL/tree/master/Problems/Curriculum%20Q's/Week%203/Binary%20Search%20Shortlist)
- [Ice Cream Parlor](https://www.hackerrank.com/challenges/icecream-parlor) | [C++](https://github.com/NAU-ACM/Competitive-Programming/blob/master/HackerRank/Practices/Algorithms/Search/Ice%20Cream%20Parlor.cpp), [C](https://github.com/nadide/ACM-ICPC/blob/master/problems/hackerrank/X_iceCreamParlor.c)
- [Maximum Subarray Sum](https://www.hackerrank.com/challenges/maximum-subarray-sum) | [C++](https://github.com/nadide/ACM-ICPC/blob/master/problems/hackerrank/X_maximumSubarraySum.cpp)
- [Aggressive Cows](https://www.spoj.com/problems/AGGRCOW/) | [Java](https://github.com/rajat123456/General-Competitive-Programming-Questions/blob/master/(SPOJ)Aggressive%20Cows.java)
47 changes: 20 additions & 27 deletions Week05/README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -2,67 +2,60 @@

## Stack & Queue

#### [Tutorial]()
#### Video Sources
- [HackerRank - Video](https://www.youtube.com/watch?v=wjI1WNcIntg)

#### Other Study Sources
#### Written Sources
- [GeeksforGeeks - Queue](https://www.geeksforgeeks.org/queue-set-1introduction-and-array-implementation/)
- [GeeksforGeeks - Stack](https://www.geeksforgeeks.org/stack-data-structure-introduction-program/)
- [HackerRank - Video](https://www.youtube.com/watch?v=wjI1WNcIntg)

#### Questions
- [Redundant Brackets](https://careercup.com/question?id=5769760746766336)
- [Java Solution](https://github.com/rajat123456/Stacks-And-Queues/blob/master/Redundant%20Brackets%20Teaser.java)
- [Redundant Brackets](https://careercup.com/question?id=5769760746766336) | [Java](https://github.com/rajat123456/Stacks-And-Queues/blob/master/Redundant%20Brackets%20Teaser.java)
- [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/description/)
- [Stock Span Problem](https://www.geeksforgeeks.org/the-stock-span-problem/)


## Breadth First Search

#### [Tutorial]()

#### Other Study Sources
#### Video Sources
- [Youtube - abhinav tripathi](https://www.youtube.com/watch?v=bIA8HEEUxZI)

#### Written Sources
- [KhanAcademy](https://www.khanacademy.org/computing/computer-science/algorithms/breadth-first-search/a/the-breadth-first-search-algorithm)
- [GeeksforGeeks](https://www.geeksforgeeks.org/breadth-first-traversal-for-a-graph/)
- [HackerEarth](https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/tutorial/)
- [Topcoder](https://www.topcoder.com/community/competitive-programming/tutorials/introduction-to-graphs-and-their-data-structures-section-2/#breadth)

#### Source Codes
- Bedir
- [C++](https://github.com/BedirT/AlgorithmsL/blob/master/Algorithms/Graph/bfs.cpp)
- [C++ (Simpler version)](https://github.com/BedirT/Algorithms_and_DS/blob/master/Algorithms/Graph/bfs_simple.cpp)
- Nadide - [C](https://github.com/nadide/ACM-ICPC/blob/master/codes/graph_BFS.c)
- C++ | [s0](https://github.com/BedirT/AlgorithmsL/blob/master/Algorithms/Graph/bfs.cpp), [s1](https://github.com/BedirT/Algorithms_and_DS/blob/master/Algorithms/Graph/bfs_simple.cpp)
- C | [s0](https://github.com/nadide/ACM-ICPC/blob/master/codes/graph_BFS.c)

#### Questions
- [BFS Shortest Reach](https://www.hackerrank.com/challenges/bfsshortreach)
- [Bedir's Solution](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/HackerRank/Algorithms/Graph%20Theory/Breadth%20First%20Search%20_%20Shortest%20Reach.cpp)
- [Nadide's Solution](https://github.com/nadide/ACM-ICPC/blob/master/problems/hackerrank/graph/breadthFirstSearchShortestPath.c)
- [BFS Shortest Reach](https://www.hackerrank.com/challenges/bfsshortreach) | [C++](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/HackerRank/Algorithms/Graph%20Theory/Breadth%20First%20Search%20_%20Shortest%20Reach.cpp), [C](https://github.com/nadide/ACM-ICPC/blob/master/problems/hackerrank/graph/breadthFirstSearchShortestPath.c)
- [Hike](http://www.spoj.com/problems/HIKE/)
- [Herding](http://www.spoj.com/problems/HERDING/)



## Depth First Search

#### [Tutorial]()

#### Other Study Sources
- [Youtube - Michael Seery](https://www.youtube.com/watch?v=bkROCj-BTWE) [Youtube - Nathaniel Fan](https://www.youtube.com/watch?v=mE_PCK0oFyo)
#### Video Sources
- [Youtube - Michael Seery](https://www.youtube.com/watch?v=bkROCj-BTWE)
- [Youtube - Nathaniel Fan](https://www.youtube.com/watch?v=mE_PCK0oFyo)
- [Youtube - Joe James](https://www.youtube.com/watch?v=tlPuVe5Otio)

#### Written Sources
- [GeeksForGeeks](http://www.geeksforgeeks.org/depth-first-traversal-for-a-graph/)
- [VisualAlgo](http://visualgo.net/dfsbfs)
-[Topcoder](https://www.topcoder.com/community/competitive-programming/tutorials/introduction-to-graphs-and-their-data-structures-section-2/#depth)
- [Topcoder](https://www.topcoder.com/community/competitive-programming/tutorials/introduction-to-graphs-and-their-data-structures-section-2/#depth)

#### Source Codes
- Bedir - [C++](https://github.com/BedirT/AlgorithmsL/blob/master/Algorithms/Graph/dfs.cpp)
- Nadide - [C](https://github.com/nadide/ACM-ICPC/blob/master/codes/graph_DFS.c)
- C++ | [s0](https://github.com/BedirT/AlgorithmsL/blob/master/Algorithms/Graph/dfs.cpp)
- C | [s0](https://github.com/nadide/ACM-ICPC/blob/master/codes/graph_DFS.c)

#### Questions
- [ALL iz Wel](http://www.spoj.com/problems/ALLIZWEL/)
- [Bedir's Solution](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/Curriculum%20Q's/Week%205/ALLIZZWELL.cpp)
- [Nadide's Solution](https://github.com/nadide/ACM-ICPC/blob/master/problems/spoj/X_allIzzWell.c)
- [Prayatna](http://www.spoj.com/problems/CAM5/)
- [Bedir's Solution](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/Curriculum%20Q's/Week%205/Prayatna.cpp)
- [ALL iz Wel](http://www.spoj.com/problems/ALLIZWEL/) | [C++](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/Curriculum%20Q's/Week%205/ALLIZZWELL.cpp), [C](https://github.com/nadide/ACM-ICPC/blob/master/problems/spoj/X_allIzzWell.c)
- [Prayatna](http://www.spoj.com/problems/CAM5/) | [C++](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/Curriculum%20Q's/Week%205/Prayatna.cpp)
- [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)
- [Count Luck](https://www.hackerrank.com/challenges/count-luck)
- [Connected Cell in a Grid](https://www.hackerrank.com/challenges/connected-cell-in-a-grid)
Expand Down
54 changes: 22 additions & 32 deletions Week06/README.md
View file
Original file line number Diff line number Diff line change
@@ -1,15 +1,14 @@
# Week 6


## Linked List

#### [Tutorial]()
#### Video Sources
- [Youtube - Hackerrank](https://www.youtube.com/watch?v=njTh_OwMljA)

#### Other Study Sources
#### Written Sources
- [GeeksForGeeks - Introduction to Linked List](https://www.geeksforgeeks.org/linked-list-set-1-introduction/)
- [CS CMU](https://www.cs.cmu.edu/~adamchik/15-121/lectures/Linked%20Lists/linked%20lists.html)
- [Tutorialpoint](https://www.tutorialspoint.com/data_structures_algorithms/linked_list_algorithms.htm)
- [Youtube - Hackerrank](https://www.youtube.com/watch?v=njTh_OwMljA)

#### Questions
- [Print the Elements of a Linked List](https://www.hackerrank.com/challenges/print-the-elements-of-a-linked-list/problem)
Expand All @@ -29,71 +28,62 @@

## Dijkstra’s Shortest Path

#### [Tutorial]()

#### Other Study Sources
#### Video Sources
- [Youtube - Santitham Prom-on](https://www.youtube.com/watch?v=WN3Rb9wVYDY)
- [Youtube - distanceedjohn](https://www.youtube.com/watch?v=8Ls1RqHCOPw)
-
#### Written Sources
- [GeeksForGeeks](http://www.geeksforgeeks.org/greedy-algorithms-set-6-dijkstras-shortest-path-algorithm/)
- [Topcoder](https://www.topcoder.com/community/competitive-programming/tutorials/introduction-to-graphs-and-their-data-structures-section-3/#dijkstra)

#### Source Codes
- Bedir - [C++](https://github.com/BedirT/AlgorithmsL/blob/master/Algorithms/Graph/dijkstra.cpp)
- Nadide - [C](https://github.com/nadide/ACM-ICPC/blob/master/codes/graph_Dijkstra.c)
- C++ | [s0](https://github.com/BedirT/AlgorithmsL/blob/master/Algorithms/Graph/dijkstra.cpp)
- C | [s0](https://github.com/nadide/ACM-ICPC/blob/master/codes/graph_Dijkstra.c)

#### Questions
- [Djikstra Shortest Reach](https://www.hackerrank.com/challenges/dijkstrashortreach)
- [Nadide's Solution](https://github.com/nadide/ACM-ICPC/blob/master/problems/hackerrank/graph/dijkstraShortestPath.c)
- [Bedir's Solution](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/HackerRank/Algorithms/Graph%20Theory/Dijkstra_Shortest%20Reach%202.cpp)
- [Travel cost](http://www.spoj.com/problems/TRVCOST/)
- [Bedir's Solution](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/Curriculum%20Q's/Week%205/TRVCOST%20-%20Travelling%20cost.cpp)
- [Djikstra Shortest Reach](https://www.hackerrank.com/challenges/dijkstrashortreach) | [C](https://github.com/nadide/ACM-ICPC/blob/master/problems/hackerrank/graph/dijkstraShortestPath.c), [C++](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/HackerRank/Algorithms/Graph%20Theory/Dijkstra_Shortest%20Reach%202.cpp)
- [Travel cost](http://www.spoj.com/problems/TRVCOST/) | [C++](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/Curriculum%20Q's/Week%205/TRVCOST%20-%20Travelling%20cost.cpp)
- [Small Quiz by GeeksForGeeks](http://quiz.geeksforgeeks.org/algorithms/graph-shortest-paths/)



## Prim's Minimum Spanning Tree (MST)

#### [Tutorial](http://nadide.github.io/Minimum-Spanning-Tree-Algo/)

#### Other Study Sources
#### Written Sources
- [GeeksForGeeks](http://www.geeksforgeeks.org/greedy-algorithms-set-2-kruskals-minimum-spanning-tree-mst/)

#### Source Codes
- Nadide - [C++, Prim's Algo](https://github.com/nadide/ACM-ICPC/blob/master/codes/graph_primMST2.cpp)
- Bedir - [C++, Kruskal's Algo](https://github.com/BedirT/Algorithms_and_DS/blob/master/Algorithms/Graph/MST%20-%20Kruskal's%20Algo.cpp)
- C++, Prim's Algo | [s0](https://github.com/nadide/ACM-ICPC/blob/master/codes/graph_primMST2.cpp)
- C++, Kruskal's Algo | [s0](https://github.com/BedirT/Algorithms_and_DS/blob/master/Algorithms/Graph/MST%20-%20Kruskal's%20Algo.cpp)

#### Questions
- [Prim's (MST) : Special Subtree](https://www.hackerrank.com/contests/master/challenges/primsmstsub?h_r=internal-search)


## Floyd Warshall (All Pairs Shortest Path)

#### [Tutorial]()

#### Other Study Sources
- [GeeksForGeeks](http://www.geeksforgeeks.org/dynamic-programming-set-16-floyd-warshall-algorithm/)
#### Video Sources
- [Youtube - Romesh Malinga Perera](https://www.youtube.com/watch?v=9QV6QpyhN0o)
- [Youtube - Quinston Pimenta](https://www.youtube.com/watch?v=K6rI0umX-28)

#### Written Sources
- [GeeksForGeeks](http://www.geeksforgeeks.org/dynamic-programming-set-16-floyd-warshall-algorithm/)
- [Topcoder](https://www.topcoder.com/community/competitive-programming/tutorials/introduction-to-graphs-and-their-data-structures-section-3/#floydWarshall)

#### Source Codes
- Bedir - [C++](https://github.com/BedirT/Algorithms_and_DS/blob/master/Algorithms/Dynamic/Floyd%20Warshall.cpp)
- Nadide - [C](https://github.com/nadide/ACM-ICPC/blob/master/codes/graph_FloydWarshall.c)
- C++ | [s0](https://github.com/BedirT/Algorithms_and_DS/blob/master/Algorithms/Dynamic/Floyd%20Warshall.cpp)
- C | [s0](https://github.com/nadide/ACM-ICPC/blob/master/codes/graph_FloydWarshall.c)

#### Questions
- [Floyd City of Lights](https://www.hackerrank.com/challenges/floyd-city-of-blinding-lights?h_r=internal-search)
- [Nadide's solution](https://github.com/nadide/ACM-ICPC/blob/master/problems/hackerrank/graph/floydCityOfBlindingLights.c)
- [Bedir's solution](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/HackerRank/Algorithms/Graph%20Theory/Floyd%20City%20of%20Blinding%20Lights.cpp)
- [Floyd City of Lights](https://www.hackerrank.com/challenges/floyd-city-of-blinding-lights?h_r=internal-search) | [C](https://github.com/nadide/ACM-ICPC/blob/master/problems/hackerrank/graph/floydCityOfBlindingLights.c), [C++](https://github.com/BedirT/AlgorithmsL/blob/master/Problems/HackerRank/Algorithms/Graph%20Theory/Floyd%20City%20of%20Blinding%20Lights.cpp)
- [Arbitrage](https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=40)
- [API-Maelstrom](https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=364)

## Extra - Cycle Detection (Union Find)

#### [Tutorial]()

#### Other Study Sources
#### Written Sources
- [GeeksForGeeks - Part 1, Implementing](http://www.geeksforgeeks.org/union-find/)
- [GeeksForGeeks - Part 2, Improving](http://www.geeksforgeeks.org/union-find-algorithm-set-2-union-by-rank/)

#### Source Codes
- [Source Code, BedirT(C++)](https://github.com/BedirT/Algorithms_and_DS/blob/master/Algorithms/Graph/Cycle%20Detection%20-%20Union%20Find%20(Improved).cpp)
- C++ | [s0](https://github.com/BedirT/Algorithms_and_DS/blob/master/Algorithms/Graph/Cycle%20Detection%20-%20Union%20Find%20(Improved).cpp)

0 comments on commit 1114d05

Please sign in to comment.