Posts

Topological sort | GeeksForGeeks Problem of the Day | 1 June

Image
  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. ...
Post a Comment
Read more

Frequency Game | GeeksForGeeks Problem of the Day | 31May

  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:    ...
Post a Comment
Read more

WAP that finds the sum of min and max of a mxn matrix

Image
Here is your code :- #include <stdio.h> int main() {     int m, n, matrix[10][10], i, j, max, min;     printf("Enter the order of the matrix : ");     scanf("%d%d", &m, &n);     printf("Enter the Element of Matrix: ");   // Input of elements of matrix.     for (i=0; i<m; i++) {         for (j=0; j<n; j++) {             scanf("%d", &matrix[i][j]);         }     } // Initialisation of max and min to be     max = matrix[0][0];     min = matrix[0][0];     for (i=0; i<m; i++) {         for (j=0; j<n; j++) {             if (max < matrix[i][j]){             m...
Post a Comment
Read more

WAP to find frequency of element in C

Image
 Here is your code in C - #include <stdio.h> int main() {     int a[5], i, freq=0, key;          printf("Enter the elements of array: ");          for (i=0; i<5; i++) {         scanf("%d", &a[i]);     }          printf("Enter the element whose frequency you want to find: ");          scanf("%d", &key);          for (i=0; i<5; i++) {         if (key == a[i])         freq ++;     }          printf("\nFrequency of %d is %d", key, freq);       return 0; } Output -
Post a Comment
Read more

CodeChef ATM Problem

 Q.  Pooja would like to withdraw  X  $US from an ATM. The cash machine will only accept the transaction if  X  is a multiple of 5, and Pooja's account balance has enough cash to perform the withdrawal transaction (including bank charges). For each successful withdrawal the bank charges 0.50 $US. Calculate Pooja's account balance after an attempted transaction. Input Positive integer 0 <  X  <= 2000 - the amount of cash which Pooja wishes to withdraw. Nonnegative number 0<=  Y  <= 2000 with two digits of precision - Pooja's initial account balance. Output Output the account balance after the attempted transaction, given as a number with two digits of precision. If there is not enough money in the account to complete the transaction, output the current bank balance. Example - Successful Transaction Input: 30 120.00 Output: 89.50 Example - Incorrect Withdrawal Amount (not multiple of 5) Input: 42 120.00 Output: 120.00 Exa...
Post a Comment
Read more

GCD IN ARRAY

Image
 Here is Your code :- #include <stdio.h> #include <string.h> #include <math.h> #include <stdlib.h> int main() {     int arr[50], size, max1, max2, gcd, i, j, temp;     scanf("%d", &size);     for (i=0; i<size; i++) {         scanf("%d", &arr[i]);     }     for (i=0; i<size; i++) {         for (j=i; j<size; j++) {             if (arr[i]>arr[j]) {                 temp = arr[i];                 arr[i] = arr[j];                 arr[j] = temp;             }   ...
Post a Comment
Read more

WAP to find the minimum and maximum element of the array by using functions.

  #include <stdio.h> int max(int arr[], int n) {     int max = arr[0];     for(int i=0; i<n; i++) {         if (max < arr[i])         max = arr[i];     }     return max; } int min(int arr[], int n) {     int min = arr[0];     for(int i=0; i<n; i++) {         if (min > arr[i])         min = arr[i];     }     return min; } int main() {     int n, arr[50], i;     printf("Enter the number of element in an array: ");     scanf("%d", &n);     printf("Enter the elements in the array: ");     for (i=0; i<n; i++)     scanf("%d", &arr[i]);     printf("The maximum element of array is %d\nThe minimum elemen...
Post a Comment
Read more