## Find if a number is even or odd without using any conditional statement

Given a number, find out if it is even or odd without using any conditional statement (if-else) or ternary operator.

Coding made easy

Given a number, find out if it is even or odd without using any conditional statement (if-else) or ternary operator.

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.

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.

The Data Encryption Standard (DES) is a symmetric-key algorithm for the encryption of electronic data. Although now considered insecure, it was highly influential in the advancement of modern cryptography.

Given a graph, check if given graph is bipartite graph or not. A bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint sets U and V such that every edge connects a vertex in U to one in V.

Given a linked list, write a function which deletes any duplicate nodes from the list by traversing the list only once.

Find all N-digit numbers with equal sum. N varies from [1 to 9] and sum < = 81 (Maximum possible sum in a 9-digit number)

Convert a given binary tree to BST (Binary Search Tree) by keeping original structure of the binary tree intact.