gfg

[Solved] Negative Prefix C++,Java, Python

Given an array A[] of N integers. In each operation, Geek can increase the ith element by 1 (i.e set A[i] = A[i]+1 where 1 < i < N).The task is to calculate the minimum number of operations required such that there is no prefix in the array A[] whose sum…

Saransh Saurav
October 19, 2023

C++, Java, Python

[Solved] Level them All! Contest Problem

Level them All!: You are given a binary tree and an integer L. Count the number of nodes on that level.Note: L may be greater than maximum possible level. In such case answer is 0 nodes. Input Format:The first line of input…

Saurav Hathi
July 10, 2022

C++, Java, Python

[Solved] Strange Median Contest Problem

Strange Median!: You are given a binary search tree. You task is to find the median of sub tree of Kth smallest node of the tree. Input Format:The first line of input contains T denoting the number of testcases. T testcases follow.…

Saurav Hathi
July 10, 2022

C++, Java

[Solved] Alternate Leaf Nodes Sum Contest Problem

Alternate Leaf Nodes Sum: You need to build a BST from the given array A of size N. The array contains distinct elements. You need to build the tree using the Array elements in the order of their arrival (A[0]…

Saurav Hathi
July 10, 2022

Python

[Solved] find the minimum swaps required to make string beautiful GFG Contest

Minimum Swaps: Geek has a string S consisting of lowercase english alphabet characters. Geek wants string to look beautiful which is only possible when all the vowels present in the string forms a consecutive chain of characters in the string.…

Saurav Hathi
June 26, 2022

Data Structure, C++

[Solved] Rolling Hash Contest Problem

You are given a string S and a Pattern P. You need to find all matches of hash of P in string S. Also, print the index (0 based) at which the pattern’s hash is found. If no match is found, print -1. Note: All the matches should have same length as pattern P.…

Saurav Hathi
June 16, 2022

Data Structure, C++, Java, Python

[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…

Saurav Hathi
June 16, 2022

Data Structure, C++, Java

[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…

Saurav Hathi
June 16, 2022

Data Structure, C++, Java

[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.…

Saurav Hathi
June 16, 2022

Java

[Solved] Without Adjacent Contest Problem

Without Adjacent: Given an array arr[] of N positive integers. The task is to find a subsequence with maximum sum such that there should be no adjacent elements from the array in the subsequence. Without Adjacent Contest Input:First line of…

Saurav Hathi
June 9, 2022