Gblog GeeksforGeeks True Geek Tournament – 7 Days Marathon to Earn the ‘True Geek’ Title!
Do you remember the childhood days, when cricket was the major reason for living to you and how excited you used to be for that… Read More
Given a singly linked list of 0s and 1s find its decimal equivalent. Input : 0->0->0->1->1->0->0->1->0 Output : 50 Input : 1->0->0 Output : 4… Read More
Online Written Test 20 MCQ + 5 Coding Questions F2F 1 1. There are two sorted arrays . Find the median of array obtained by… Read More
Given K sorted linked lists of size N each, merge them and print the sorted output. Examples:  Input: k = 3, n = 4 list1… Read More
Given a singly linked list, find if the linked list is circular or not. A linked list is called circular if it is not NULL-terminated… Read More
Given two numbers ‘a’ and ‘b’. Find the minimum difference between any terms in shifted infinite tables of ‘a’ and ‘b’, given shifts ‘x’ and… Read More
Given a set of n integers where n <= 40. Each of them is at most 1012, determine the maximum sum subset having sum less… Read More
Given an array a[0 . . . n-1]. We should be able to efficiently find the GCD from index qs (query start) to qe (query… Read More
Decidable Problems A problem is decidable if we can construct a Turing machine which will halt in finite amount of time for every input… Read More
Sameer asks his friend Kartik a question to test his intelligence.  Sameer – You have been given a right-angled triangle ABC, right-angled at B. The… Read More
Given a number positive number n, find value of f0 + f1 + f2 + …. + fn where fi indicates i’th Fibonacci number. Remember… Read More
Given a Binary Search Tree, convert it into a Min-Heap containing the same elements in O(n) time. Do this in-place.   Input: Binary Search Tree 8… Read More
Bitonic Sequence A sequence is called Bitonic if it is first increasing, then decreasing. In other words, an array arr[0..n-i] is Bitonic if there exists… Read More
Bitonic Sequence A sequence is called Bitonic if it is first increasing, then decreasing. In other words, an array arr[0..n-i] is Bitonic if there exists… Read More
Bitonic Sequence A sequence is called Bitonic if it is first increasing, then decreasing. In other words, an array arr[0..n-i] is Bitonic if there exists… Read More
Bitonic Sequence A sequence is called Bitonic if it is first increasing, then decreasing. In other words, an array arr[0..n-i] is Bitonic if there exists… Read More