## Given a string, print all possible palindromic partitions

Given a string, find all possible palindromic partitions of given string. Example: Recommended: Please try your approach on {IDE} first, before moving on to the… Read More »

- Recursively Reversing a linked list (A simple implementation)
- Print the last k nodes of the linked list in reverse order
- Check if a word exists in a grid or not
- Program to check if an array is palindrome or not using Recursion
- Print all permutations of a string in Java
- Generating subarrays using recursion
- Count ways to reach a score using 1 and 2 with no consecutive 2s
- Recursive program to print all subsets with given sum
- Java Program to print distinct permutations of a string
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Generating all possible Subsequences using Recursion
- Printing all subsets of {1,2,3,...n} without using array or loop
- Check whether the two Binary Search Trees are Identical or Not
- Print all paths from top left to bottom right in a matrix with four moves allowed
- Count all possible position that can be reached by Modified Knight
- Find Nth term (A matrix exponentiation example)
- Print all subsequences of a string using ArrayList
- Longest Ordered Subsequence of Vowels
- Count of Numbers in a Range divisible by m and having digit d in even positions
- Algorithms | Recurrences | Set 1
- Maximum length of segments of 0's and 1's
- Number of Binary Strings of length N with K adjacent Set Bits
- Find the value of ln(N!) using Recursion
- Check if the given binary tree has a sub-tree with equal no of 1's and 0's | Set 2
- Product of 2 numbers using recursion | Set 2
- Double Knapsack | Dynamic Programming
- Split the array into equal sum parts according to given conditions
- Number of balanced bracket expressions that can be formed from a string
- Recursive Program for Binary to Decimal

Given a string, find all possible palindromic partitions of given string. Example: Recommended: Please try your approach on {IDE} first, before moving on to the… Read More »

Accolite visited our campus for full time Software development. First round: MCQ round consists of 30 questions 30 minutes. Questions on C aptitude, four to… Read More »

Walmart Labs Interview Experience – On campus 1st round (Online Test) It was an online test of 90 minutes and was conducted on Hackerearth. It… Read More »

Given a number line from -infinity to +infinity. You start at 0 and can go either to the left or to the right. The condition… Read More »

Given two sorted arrays A and B, generate all possible arrays such that first element is taken from A then from B then from A… Read More »

Round 1 1) There are M chocolate packets each packet can have variable number of chocolates in each packet. There are N students (N <… Read More »

This is a famous interview question asked in Google, Paytm and many other company interviews. Below is the problem statement. Imagine you have a special… Read More »

Given a matrix where every element is either ‘O’ or ‘X’, replace ‘O’ with ‘X’ if surrounded by ‘X’. A ‘O’ (or a set of… Read More »

Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. Input: str[]… Read More »

Consider lines of slope -1 passing between nodes (dotted lines in below diagram). Diagonal sum in a binary tree is sum of all node’s data… Read More »

In MS-Paint, when we take the brush to a pixel and click, the color of the region of that pixel is replaced with a new… Read More »

Given two positive integers n and k, print all increasing sequences of length k such that the elements in every sequence are from first n… Read More »

Before advent of QWERTY keyboards, texts and numbers were placed on the same key. For example 2 has “ABC” if we wanted to write anything… Read More »

What is tail recursion? A recursive function is tail recursive when recursive call is the last thing executed by the function. For example the following… Read More »

The problem is to count all the possible paths from top left to bottom right of a mXn matrix with the constraints that from each cell… Read More »