Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them.

Read More »Given a Binary Tree and a key ‘k’, find distance of the closest leaf from ‘k’.

Read More »Given a set of n nuts of different sizes and n bolts of different sizes. There is a one-one mapping between nuts and bolts. Match nuts and bolts efficiently.

Read More »In Manacher’s Algorithm Part 1 and Part 2, we gone through some of the basics, understood LPS length array and how to calculate it efficiently based on four cases.

Read More »## Longest Even Length Substring such that Sum of First and Second Half is same

Leave a comment | Filed under StringsGiven a string ‘str’ of digits, find length of the longest substring of ‘str’, such that the length of the substring is 2k digits and sum of left k digits is equal to the sum of right k digits.

Read More »About Polycom Polycom is a multinational corporation that develops video, voice and content collaboration and communication technology.

Read More »Round 1: 10 Aptitude questions with difficulty level hard.

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 lying between these lines.

Read More »Amazon sde2 experience:

Read More »## Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Part 3

Leave a comment | Filed under StringsIn Manacher’s Algorithm Part 1 and Part 2, we gone through some of the basics, understood LPS length array and how to calculate it efficiently based on four cases. Here we will implement the same.

Read More »We have discussed implementation of Reverse DNS Look Up Cache. Forward DNS look up is getting IP address for a given domain name typed in the web browser.

Read More »1) IQ Test: 30 ques in 30 mins consisting of difficult quantitative aptitude questions.

Read More »In Manacher’s Algorithm – Part 1, we gone through some of the basics and LPS length array. Here we will see how to calculate LPS length array efficiently.

Read More »Given a string, find the longest substring which is palindrome. if the given string is “forgeeksskeegfor”, the output should be “geeksskeeg”

Read More »