## Palindromic Partitioning

Problem Statement Given an integer array,  partitioning the array is said to be a palindrome partitioning if every subarray of the partition is a palindrome. For example, 1 | 2 2 2 | 23 | 4 is a palindrome partitioning of array { 1,2,2,2,23,4 }. You have to find out the fewest cuts needed for palindrome partitioning of a…

## MyGate Interview Experience. [SET-1]

Round 1 – Written They(MyGate) had printed questions on paper there were multiple sets of those like we used to have in School Exam. Each paper has 3 questions and We need to write working code on laptop and mail to the recruiter. Out of 4 questions – 1 Easy, 1 Medium and 2 hard…

## Hamiltonian Graph – Paper Boy Problem

Shyam needs to distribute newspaper to all the houses while following these rules: He can start from any vertex. When he is on a vertex, he must distribute the newspaper. You can only travel to a vertex that is connected to the current vertex by an edge. You cannot visit a vertex which is already…

## String to Integer (atoi)

Implement atoi which converts a string to an integer. The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this character, takes an optional initial plus or minus sign followed by as many numerical digits as possible, and interprets them as a numerical value. The string can contain…

## Maximum Difference in an Array

You are given an array of integers and must compute the maximum difference between any item and any lower indexed smaller item for the possible pairs, i.e., for a given array a find the maximum value of a[j] – a[i] for all i, j where 0 <= i < j < n and a[i] <…

## Counting Valleys – HackerRank

Gary is an avid hiker. He tracks his hikes meticulously, paying close attention to small details like topography. During his last hike he took exactly steps. For every step he took, he noted if it was an uphill, , or a downhill, step. Gary’s hikes start and end at sea level and each step up…