Skip to content

Tag Archives: Searching Quiz

Interactive Problems are those problems in which our solution or code interacts with the judge in real time. When we develop a solution for an… Read More
Given an array, the task is to check whether a certain element is present in this Array or not, in Java. Examples: Input: arr[] =… Read More
Given a string str and a matrix mat[][] of lowercase English alphabets, the task is to find whether the string str appears in the matrix… Read More
Pre-requisite: Convert an Array to a Circular Doubly Linked List, Doubly Circular Linked List Given a Doubly circular linked list. The task is to find… Read More
Given a string array of M words and a dictionary of N words. The task is to check if the given string of words can… Read More
Given a very large number, print all the 3 digit repeating numbers with their frequency. If a 3 digit number appears more then once, print… Read More
Given K arrays of different size. The task is to check if there exist any two arrays which have the same sum of elements after… Read More
Given a Binary Search Tree and a number N, the task is to find the smallest number in the binary search tree that is greater… Read More
You are given a list of 5 integers and these integers are in the range from 1 to 6. There are no duplicates in list.… Read More
In the above question, the correction needed in the program to make it work properly is (GATE CS 2008) (A) Change line 6 to: if… Read More
Consider the following C program that attempts to locate an element x in an array Y[] using binary search. The program is erroneous. (GATE CS… Read More
Given a sorted array of integers, what can be the minimum worst case time complexity to find ceiling of a number x in given array?… Read More
Which of the following is correct recurrence for worst case of Binary Search? (A) T(n) = 2T(n/2) + O(1) and T(1) = T(0) = O(1)… Read More
What is the output of following program? #include <stdio.h>    void print(int n, int j) {    if (j >= n)       return;    if (n-j > 0… Read More