## Count All Palindromic Subsequence in a given String

Find how many palindromic subsequence (need not necessarily be distinct) can be formed in a given string. Note that the empty string is not considered… Read More »

- Must do Math for Competitive Programming
- Array of Vectors in C++ STL
- Breadth First Search without using Queue
- Minimize the maximum difference between adjacent elements in an array
- How is the time complexity of Sieve of Eratosthenes is n*log(log(n))?
- Shortest Path Faster Algorithm
- Maximum sum path in a Matrix
- Basic Algorithm Techniques Not Taught in Academics
- Count of subarrays having exactly K distinct elements
- Maximum number of unique values in the array after performing given operations
- Role of SemiColon in various Programming Languages
- Knapsack with large Weights
- Sum of GCD of all possible sequences
- Why Data Structures and Algorithms Are Important to Learn?
- Traveling Salesman Problem using Genetic Algorithm
- Minimum Cost Graph
- Maximum LCM among all pairs (i, j) from the given Array
- Minimum possible travel cost among N cities
- Longest subsequence having difference atmost K
- Count of subarrays which start and end with the same element
- Huffman Coding using Priority Queue
- Find lexicographically smallest string in at most one swaps
- Median of an unsorted array using Quick Select Algorithm
- Word Break Problem | DP-32 | Set - 2
- Operator Overloading '<<' and '>>' operator in a linked list class
- Longest Mountain Subarray
- Sort an Array which contain 1 to N values in O(N) using Cycle Sort
- Find last remaining element after reducing the Array
- Minimum increment or decrement required to sort the array | Top-down Approach
- Find maximum subset sum formed by partitioning any subset of array into 2 partitions with equal sum

Find how many palindromic subsequence (need not necessarily be distinct) can be formed in a given string. Note that the empty string is not considered… Read More »

Given two non-negative long integers, x and y given x <= y, the task is to find bit-wise and of all integers from x and… Read More »

Given a number n, the task is to find the XOR from 1 to n. Examples : Input : n = 6 Output : 7… Read More »

You are given two strings.Now you have to print all longest common sub-sequences in lexicographical order? Examples: Input : str1 = “abcabcaa”, str2 = “acbacba”… Read More »

Given a number n, the task is to check whether this number is a multiple of 4 or not without using +, -, * ,/… Read More »

Given a matrix of integers where every element represents weight of the cell. Find the path having the maximum weight in matrix [N X N].… Read More »

We have N coins which need to arrange in form of a triangle, i.e. first row will have 1 coin, second row will have 2… Read More »

Given an array arr[] such that 1 <= arr[i] <= 10^12, the task is to find prime factors of LCM of array elements. Examples: Input… Read More »

Given a large number as a string, find the remainder of number when divided by 7. Examples : Input : num = 1234 Output :… Read More »

Given three integers x, y, z, the task is to compute the value of GCD(LCM(x,y), LCM(x,z)). Where, GCD = Greatest Common Divisor, LCM = Least… Read More »

Given a directed graph and a source node and destination node, we need to find how many edges we need to reverse in order to… Read More »

Given a number, the task is to multiply it with 10 without using multiplication operator? Examples: Input : n = 50 Output: 500 // multiplication… Read More »

Given an array, an inversion is defined as a pair a[i], a[j] such that a[i] > a[j] and i < j. We are given two… Read More »

We are given coordinates of a triangle. The task is to classify this triangle on the basis of sides and angle. Examples: Input: p1 =… Read More »

Given a number “n”, find if it is Disarium or not. A number is called Disarium if sum of its digits powered with their respective… Read More »