Programs Code

  Given a Directed Acyclic Graph (DAG) with V vertices and E edges, Find any Topological Sorting of that Graph. Example 1: Input: Output: 1 Explanation : The output 1 denotes that the order is valid. So, if you have, implemented your function correctly, then output would be 1 for all test cases. One possible Topological order for the graph is 3, 2, 1, 0. Example 2: Input: Output: 1 Explanation: The output 1 denotes that the order is valid. So, if you have, implemented your function correctly, then output would be 1 for all test cases. One possible Topological order for the graph is 5, 4, 2, 1, 3, 0. Your Task: You don't need to read input or print anything. Your task is to complete the function  topoSort()     which takes the integer V denoting the number of vertices and adjacency list as input parameters   and returns an array consisting of the vertices in Topological order. As there are multiple Topological orders possible, you may return any of them. ...

  Given an array  A  of size  N . The elements of the array consist of positive integers. You have to find the largest element with minimum frequency. Example 1: Input: 5 2 2 5 50 1 Output: 50 Explanation : All elements are having frequency 1 except 2. 50 is the maximum element with minimum frequency. Example 2: Input: 4 3 3 5 5 Output: 5 Explanation: Both 3 and 5 have the same frequency, so 5 should be returned. User Task: Your task is to complete the provided function  LargButMinFreq(A, n)  which accepts array  A  and  n . Hence you have to return the largest element with minimum frequency. Expected Time Complexity:  O(N) Expected Space Complexity:  O(N) Constraints: 1 <= N <= 10 5 1 <= A[i] <= 10 6 SOLUTION(in C++) - //{ Driver Code Starts // Initial Template for C++ #include <bits/stdc++.h> using namespace std; // } Driver Code Ends // User function Template for C++ class Solution{ public:    ...