Daily One Algorithm

A blog dedicated to those who live, drink and eat Algorithms.

Saturday, December 26, 2015

›
Iterative Traversal of Binary Tree Preorder Iterative 1) Create an empty stack nodeStack and push root node to stack. 2) Do follow...

›
Qn: Given a list of integers, find the highest value that can be obtained by concatenating these integers together? Ans: The idea is to ...
Wednesday, December 11, 2013

How to prepare for Interviews

›
Design Patterns Cloud Design patterns https://msdn.microsoft.com/en-us/library/dn600223.aspx Visitor Pattern  Helps to traverse a s...
Monday, July 12, 2010

Sort Array

›
Given an array of size n wherein elements keep on increasing monotically upto a certain location after which they keep on decreasing monoti...
14 comments:
Friday, June 25, 2010

Maximum Sub Sequence of 1s and 0s

›
You are given an array ' containing 0s and 1s. Find O(n) time and O(1) space algorithm to find the maximum sub sequence which has equ...
9 comments:
Friday, May 22, 2009

Unlucky Numbers

›
There are few numbers considered to be unlucky(It contains only 4 and 7. ). Our goal is to find count of such numbers in the range of posit...
6 comments:
Sunday, May 17, 2009

Ideal string

›
An ideal string is a string where the 1-based index of the first occurrence of each letter is equal to the number of occurrences of that le...
3 comments:
Thursday, May 14, 2009

Next Palindrome Problem

›
Find the next palindrome . Input is an integer and output should be the palindrome integer which is higher than the input. Example: Input: 1...
4 comments:
›
Home
View web version

My Self

Ghotter
About myself... Dont bother to know much about me, myself being an average person with a keen interest to learn new things. My tastes range from good food to reading bestsellers, from algorithm design to listening to indian music, from networking friends to watching cartoons. I did my engineering from BITS Pilani. And now working for a MNC.
View my complete profile
Powered by Blogger.