Check if mirror image of a number is same if displayed in seven segment display
Given a positive number n. The task is to check if the mirror image of the number is equal to given number or not if displayed on Seven Line Segment. A mirror image of a number is a reflected duplication of the number that appears almost identical but is reversed in the direction perpendicular to the mirror surface.Examples:...
read more
Make a lexicographically smallest palindrome with minimal changes
Given a string S. Print the lexicographically smallest string possible. You can make minimal changes to the characters in the string and you can permute the string. Examples:...
read more
Check if Binary representation is Palindrome in Python
Given an integer ‘n’, write a Python function that returns true if binary representation of x is palindrome else return false. Examples:...
read more
Nth Even length Palindrome
Given a number n as a string, find the nth even-length positive palindrome number ....
read more
Minimum insertions to form a palindrome with permutations allowed
Given a string of lowercase letters. Find minimum characters to be inserted in the string so that it can become palindrome. We can change the positions of characters in the string....
read more
Count of Palindromic substrings in an Index range
Given a string str of small alphabetic characters other than this we will be given many substrings of this string in form of index tuples. We need to find out the count of the palindromic substrings in given substring range....
read more
Minimum number of palindromic subsequences to be removed to empty a binary string
Given a binary string, count minimum number of subsequences to be removed to make it an empty string....
read more
Split string into three palindromic substrings with earliest possible cuts
Given string str, the task is to check if it is possible to split the given string S into three palindromic substrings or not. If multiple answers are possible, then print the one where the cuts are made the least indices. If no such possible partition exists, then print “-1”....
read more
Java Program To Find Minimum Insertions To Form A Palindrome | DP-28
Given string str, the task is to find the minimum number of characters to be inserted to convert it to a palindrome....
read more
Minimum count of elements required to obtain the given Array by repeated mirror operations
Given an array arr[] consisting of N integers, the task is to find the array K[] of minimum possible length such that after performing multiple mirror operations on K[], the given array arr[] can be obtained....
read more
Facebook Interview | Set 1
I am a final year student of IIT Guwahati and the first phase of placements has just finished at our college. I was recruited by Directi but not before three grueling rounds of interview. I was also shortlisted by Microsoft, Facebook and Goldman Sachs as well but got rejected after the first round of interview from all the three companies :(. I will be posting questions relating to all the companies I was interviewed by as well as some interview preparation advice (which should be particularly useful for students sitting for on-campus placements). Following are Facebook interview questions...
read more
Longest Palindromic Substring using Palindromic Tree | Set 3
Given a string, find the longest substring which is a palindrome. For example, if the given string is “forgeeksskeegfor”, the output should be “geeksskeeg”....
read more