In this tutorial, we will be discussing a program to find queries to find whether a number has exactly four distinct factors or not.For this we will be provided with Q queries each containing a number N. Our task is to find if the given number have exactly four divisors.Example Live ... Read More

In this tutorial, we will be discussing a program to find queries to find the last nonrepeating character in the sub-string of a given string.For this we will be provided with a string with Q queries. Our task is to find the last non-repeating character in the given range.Example Live Demo#include<bits/stdc++.h> ... Read More

In this tutorial, we will be discussing a program to find queries to find maximum product pair in range with updates.For this we will be provided with an array containing integers. Our task is to perform Q queries (printing the maximum pair product, updating array[i] with given value).Example Live Demo#include <bits/stdc++.h> ... Read More

In this tutorial, we will be discussing a program to find queries to find distance between two nodes of a Binary tree – O(logn) method.For this we will be provided with a binary tree with no parent pointers. Our task is to find the distance between two keys in the ... Read More

In this tutorial, we will be discussing a program to find queries to count the number of unordered co-prime pairs from 1 to N.For this we will be provided with an integer N. Our task is to find the number of unordered co-prime pairs from 1 to N.Example Live Demo#include <bits/stdc++.h> ... Read More

In this tutorial, we will be discussing a program to find queries to check whether a given digit is present in the given Range.For this we will be provided with an array, and Q queries. Our task is to find whether the given number is present between the given indices ... Read More

In this tutorial, we will be discussing a program to find queries to check if it is possible to join boxes in a circle.For this we will be provided with a circle of boxes running from 1 to n. Our task is to find whether box i can be connected ... Read More

In this tutorial, we will be discussing a program to find queries to check if a number lies in N ranges of L-R.For this we will be provided with a list of ranges and queries. Our task is to find whether the number provided in each query lies in any ... Read More

In this tutorial, we will be discussing a program to find queries to answer the X-th smallest sub-string lexicographically.For this we will be provided with a string and Q queries. Our task is to print the smallest sub-string lexicographically at the given position in the query.Example Live Demo#include <bits/stdc++.h> using namespace ... Read More

In this tutorial, we will be discussing a program to find distance between two nodes of a Binary Tree.For this we will be provided with a binary tree with no parent pointers. Our task is to find the distance between two keys in the tree counting the edges.Example Live Demo#include <iostream> ... Read More