Given a sorted array containing duplicates, efficiently find frequency of each element in it without traversing the whole array.
Given a number, find out if it is even or odd without using any conditional statement (if-else) or ternary operator.
In this post, we will discuss how to shuffle or randomize a List in Java using Fisher–Yates shuffle algorithm and shuffle() method provided by the Collections class.
In this post, we will discuss how to measure elapsed time of a C++ program in seconds, milliseconds, microseconds and nanoseconds using chrono library.
Given an array of integers, duplicates are present in it in such a way that all duplicates appear even number of times except one which appears odd number of times. Find that odd appearing element in linear time and without using any extra memory.
Quickselect is a selection algorithm to find the kth smallest element in an unordered list. It is closely related to the quicksort sorting algorithm.
The longest decreasing subsequence problem is to find a subsequence of a given sequence in which the subsequence’s elements are in sorted order, highest to lowest, and in which the subsequence is as long as possible.
In cryptography, Triple DES (3DES) is a symmetric-key block cipher, which applies the Data Encryption Standard (DES) cipher algorithm three times to each data block.
In this post, we will discuss how to determine if two integers are equal without using comparison operators (==, !=, < , >, < =, >=) & arithmetic operators (+, -, *, /, %).
Write an algorithm to generate random numbers from 1 to 12 with equal probability using a given function which generates random numbers from 1 to 6 with equal probability.
Given an unsorted array of integers, print all distinct four elements tuple (Quadruplets) in it having given sum.
Given an unsorted array of integers, check if it contains four elements tuple (Quadruplets) having given sum.