Graph Algorithms and Tasks

Table of Contents

graphs:

1. Bellman-Ford Algorithm
2. Dijkstra's Algorithm
3. Breadth-First Search (BFS)
4. Depth-First Search (DFS)
5. Graph Creation
   • Unweighted & Undirected Graph
   • Weighted & Undirected Graph
6. Graph Representation
   • Adjacency Matrix
   • Adjacency List
7. Print All Paths
8. Topological Sorting
9. Cycle Detection
   • Cycle Detection in Directed Graph
   • Cycle Detection in Undirected Graph
10. GraphCreationUsing2DArray
11. [Prim's algo](#Prim's algo)
12. [Kosaraju's algo](#Kosaraju's algo)
13. [Edge converter](#Edge converter)
14. [getBridge Problem](#getBridge Problem)
15. [Tarjan's algorithm](#Tarjan's algorithm)

Stack:

1. BuiltInStack
2. StackImplementation
3. StackImplementationUsingArrayList

Queue:

1. QueueImplementationArray
2. CircularQueueImplementationArray
3. QueueUsingLinkedList
4. BuiltInQueue

LinkedList:

1. LinkedListImplementation
2. BuiltInLinkedList
3. ReverseALinkedList
4. ReverseLLRecursive
5. Q. Find and delete the nth node from the LL.
6. Q. Linked list is palindrome or not?
7. Q. Detect a cycle in a Linked List.
8. Q. Remove a cycle in a Linked List.

binaryTree:

1. Building Binary Tree
2. Preorder traversal
3. Inorder traversal
4. Postorder traversal
5. Level order traversal
6. Count Of Nodes
7. Sum Of Nodes
8. Height Of Tree
9. Diameter Of Tree
10. Maximum Sum Path

binarySearchTree:

1. Insert a Node in BST
2. Inorder traversal in BST
3. Search Node in BST
4. Delete Node in BST
5. Inorder Successor

Trie:

1. TrieSmallExample
2. Insertion In Trie
3. search In Trie
4. Q. Word break problem(pending)

List:

1. ArrayList

sorting:

1. Bubble Sort
2. Insertion Sort
3. Merge Sort
4. Quick Sort
5. Selection Sort

String:

1. StringToCharArr
2. String Palindrome Check
3. CharacterArrToString

Arrays:

1. Array and operations on array
2. BinarySearch On Array
3. 1D array
4. 2D array
5. Variable Length ArgumentList

HashShing(google has soft spot for it):

1. HashSet(notes are in the form of code+dsa notes)
2. HashMap(notes are in code + dsa notes)
3. NormalSet
4. [HashMap implementation](#HashMap implementation)
5. [Q.Majority Elements](#Majority Elements)
6. [Q.Union of two arrays](#Union of two arrays)
7. [Q.Intersection Of TwoArr](#Intersection Of TwoArr)
8. Q.Find Itinerary(path) from Tickets
9. Q.SubArray Sum equal to k
10. Q.

Dynamic Programming:

Heaps:

Greedy:

BackTracking:

Bit manipulation:

Segment Trees: