So far the operations using Java programs are done on a prompt/terminal which is not stored anywhere. But in the software industry, most of the… Read More »

Given an array arr[] of size n and q queries and an integer k. Each query consists of an index range [l, r] and the… Read More »

Given an integer k and a linked list, every node of which consists of a pair of integer variable first and second to hold the… Read More »

Given an array of N integers. The task is to print the elements from the array which are greater than their immediate previous and next… Read More »

Structure Chart represent hierarchical structure of modules. It breaks down the entire system into lowest functional modules, describe functions and sub-functions of each module of… Read More »

We know OpenCV is widely used to operate on images and has a wide spectrum of functions to do so. But what if we want… Read More »

Given a range [L, R], the task is to find the XOR of all the integers in the given range i.e. (L) ^ (L +… Read More »

Given an integer N, the task is to find whether fact(N) is divisible by sum(N) where fact(N) is the factorial of N and sum(N) =… Read More »

Prerequisite – Node.js What is Express? Express is a small framework that sits on top of Node.js’s web server functionality to simplify its APIs and… Read More »

Given an unsorted array arr[] of n integers and an integer k, the task is to find the kth largest element in the given index… Read More »

Given a linked list, the task is to find the sum of even and odd nodes in it separately. Examples: Input: 1 -> 2 ->… Read More »

A good system design is to organise the program modules in such a way that are easy to develop and change. Structured design techniques help… Read More »

Given a Perfect Binary Tree, the task is to reverse the alternate level nodes of the binary tree. Examples: Input: a / \ b c… Read More »

Given the 2 end points (x1, y1) and (x2, y2) of a line. The task is to determine the numer of squares that line will… Read More »

Given a binary circular array of size N, the task is to find the count maximum number of consecutive 1’s present in the circular array.… Read More »

Given two arrays arr1[] and arr2[] of sizes N and M where 0 ≤ arr1[i], arr2[i] ≤ 1000 for all valid i, the task is… Read More »

Given an array arr[] of size n. The task is to count the number of possible sub-arrays such that their elements can be re-arranged to… Read More »

Given a range [l, r], the task is to find the sum fib(l) + fib(l + 1) + fib(l + 2) + ….. + fib(r)… Read More »

The Fibonacci numbers are the numbers in the following integer sequence. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ……..… Read More »

Given an array arr[] and an integer K. The task is to sort the elements that are in between any two multiples of K. Examples:… Read More »