## Multiply a number by 15 without using * and / operators

Given a integer N, the task is to multiply the number with 15 without using multiplication * and division / operators. Examples: Input: N =… Read More »

- How can one become good at Data structures and Algorithms easily?
- Cracking Technical Interviews
- Print the nodes of binary tree as they become the leaf node
- Reach the numbers by making jumps of two given lengths
- Shannon-Fano Algorithm for Data Compression
- Dijkstra's shortest path with minimum edges
- Rearrange Odd and Even values in Alternate Fashion in Ascending Order
- How to write a Pseudo Code?
- Sort the array of strings according to alphabetical order defined by another string
- Longest subsequence such that adjacent elements have at least one common digit
- Code Optimization Technique (logical AND and logical OR)
- Iterative Letter Combinations of a Phone Number
- Check if it is possible to reach a number by making jumps of two given length
- Sum of similarities of string with all of its suffixes
- Dividing a Large file into Separate Modules in C/C++, Java and Python
- Smallest Pair Sum in an array
- Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
- Find the number in a range having maximum product of the digits
- Ternary Search
- Count pairs in array whose sum is divisible by K
- Length of the longest alternating subarray
- Smallest power of 2 which is greater than or equal to sum of array elements
- Largest perfect square number in an Array
- Travelling Salesman Problem implementation using BackTracking
- Count distinct substrings that contain some characters at most k times
- Number of array elements derivable from D after performing certain operations
- Count common characters in two strings
- Find alphabet in a Matrix which has maximum number of stars around it
- Choose atleast two elements from array such that their GCD is 1 and cost is minimum
- Array Manipulation and Sum

Given a integer N, the task is to multiply the number with 15 without using multiplication * and division / operators. Examples: Input: N =… Read More »

Given an integer array arr[], the task is to check if that array contains all the divisor of some integer. Examples: Input: arr[] = {… Read More »

Given a tree and the weights of all the nodes, the task is to count the number of nodes whose weights are even parity i.e.… Read More »

Given two integer N and K, the task is to find the sum of all the numbers from the range [1, N] excluding those which… Read More »

Given an alphanumeric string str, the task is to sort the string in such a way that if a position is occupied by an alphabet… Read More »

Given an array arr[] of non-negative integers. We have to delete elements from this array such that arr[i + 1] > arr[j] for each valid… Read More »

Given an array edge[][2] where (edge[i][0], edge[i][1]) defines an edge in the n-ary tree, the task is to print all the leaf nodes of the… Read More »

There are infinite people standing in a row, indexed from 1. A person having index i has strength of i2. You have strength P and… Read More »

Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose weight is a power of… Read More »

Given a string, find the repeated character present first in the string. Examples: Input : geeksforgeeks Output : g (mind that it will be g,… Read More »

Given a tree, and the weights of all the nodes, the task is to find the root of the sub-tree whose weighted sum is minimum.… Read More »

Given a positive integer n, the task is to generate all possible unique ways to represent n as sum of positive integers. Examples: Input: 4… Read More »

Given two strings s1 and s2 of same length, the task is to count the minimum number of pairs of characters (c1, c2) such that… Read More »

Given an N * N matrix mat[][] consisting of non-negative integers and some queries consisting of top-left and bottom-right corner of the sub-matrix, the task… Read More »

Given a tree, and the weights of all the nodes, the task is to find the root of the sub-tree whose weighted sum XOR with… Read More »