## Minimum removal to make palindrome permutation

Given a string S, we have to find minimum characters that we can remove to make any permutation of the string S a palindrome. In… Read More »

Given a string S, we have to find minimum characters that we can remove to make any permutation of the string S a palindrome. In… Read More »

Given inorder and level-order traversals of a Binary Tree, construct the Binary Tree. Following is an example to illustrate the problem. Examples: Input: Two arrays… Read More »

Given a linked list of characters. The task is to find the maximum occurring character in the linked list. if their are multiple answer return… Read More »

In previous post i.e. Set 1 we have discussed that implements these below functions: insert(H, k): Inserts a key ‘k’ to Binomial Heap ‘H’. This… Read More »

Given first term (a), common difference (d) and a integer N of the Arithmetic Progression series, the task is to find Nthterm of the series.… Read More »

In this article, given the value of n(length of the alphabet) and k(width of the alphabet) we will learn how to print the pattern “GFG”… Read More »

systemctl is used to examine and control the state of “systemd” system and service manager. systemd is system and service manager for Unix like operating… Read More »

We have a simple binary tree and we have to print the top 3 largest elements present in the binary tree. Examples: Input : 1… Read More »

Given two numbers, find floor of their average without using division. Input : x = 10, y = 12 Output : 11 Input : x… Read More »

Round 1: Telephonic round. Find max 1 in a row of a 2D array.https://www.geeksforgeeks.org/find-the-row-with-maximum-number-1s/ Find the biggest square in a 2D array.https://www.geeksforgeeks.org/maximum-size-sub-matrix-with-all-1s-in-a-binary-matrix/ Round 2: On… Read More »

Round 1: Telephonic: 1) Remove duplicate numbers from a very large file. 2) Print anagrams of a string found in a very large file 3)… Read More »

Partition given string in such manner that i’th substring is sum of (i-1)’th and (i-2)’nd substring. Examples: Input : “11235813” Output : [“1”, “1”, “2”,… Read More »

In the earlier days of computing, octal numbers and the octal numbering system was very popular for counting inputs and outputs because as it works… Read More »

We are given n-processes with their completion times in form of an array. We need to find the time instant when a given process p… Read More »

Double hashing is a collision resolving technique in Open Addressed Hash tables. Double hashing uses the idea of applying a second hash function to key… Read More »