Empowering coders, one solution at a time
Empowering coders, one solution at a time
![[Solved] The BFS traversal Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-The-BFS-traversal-Contest-Problem.png "[Solved] The BFS traversal Contest Problem")
The BFS traversal: You are given a graph G with edges E. You have to perform BFS on this graph. Note: Perform BFS in the order the elements appear in the adjacency list (left to right). The BFS traversal Contest Problem Input Format:The first…
![[Solved] Kth Maximum element of Max-Heap Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Kth-Maximum-element-of-Max-Heap-Contest-Problem.png "[Solved] Kth Maximum element of Max-Heap Contest Problem")
Kth Maximum element of Max-Heap: Given a max heap array mHeap of positive integers of size N and a positive integer k. The task is to find the kth maximum element of the heap. Kth Maximum element of Max-Heap Contest Problem Input:First line of input contains T, denoting the…
![[Solved] Total Strongly Connected Components Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Total-Strongly-Connected-Components-Contest-Problem.png "[Solved] Total Strongly Connected Components Contest Problem")
Total Strongly Connected Components: You are given a graph G with V vertices and E edges. You need to find total number of strongly connected components. Note: A strongly connected component (SCC) of a directed graph is a maximal strongly connected subgraph.…
![[Solved] Copy Arrays Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Copy-Arrays-Contest-Problem.png "[Solved] Copy Arrays Contest Problem")
Copy Arrays: Given an Array ‘Arr’ of size ‘N’, a subarray is called a copy array if it contains at least 1 element that occurs more than once. Find the maximum number of copy arrays that can be formed by…