Wednesday, 23 September 2015

Fibonacci Problem :Calculate the sum (F(X) + F(X + 1) + ... + F(Y)) mod 1000000007, where F(N)=F(N-1)+F(N-2),N>=2

›
Interview question asked in OYO Rooms company. You are given two non-negative integers X and Y, you have to calculate the sum (F(X...

How to find continuous sequence with largest sum

›
You are given an array of integers both positive and negative integers.Find the continuous sequence with largest sum. For Example: Inp...
2 comments:

How to count occurrence of word in String Array

›
The most basic technical question asked in interview to find the count of occurrence of words in String array.we can also find count of oc...

Java program to compute all permutation of String

›
To understand this solution first understand the concept of recursion. So here lets assume a given string S represented by S1,S2,S2....,S...

How to determine if String has all unique characters

›
It is a most basic question asked in interviews to check if string contains all unique characters or not. Below sample program is a basi...
2 comments:
Tuesday, 15 September 2015

Count all possible paths from top left to bottom right of a m*n Matrix

›
A person starts from the uppermost, leftmost corner of a grid. Each cell of grid is 0,1,2,3,4,5,6 or 7. From any cell, he can only go to ...
6 comments:
Tuesday, 8 September 2015

Java Program to Find Lexicographically Smallest and Largest substring of Length K

›
What is Lexicographic order ? Lexicographic order is an order in which words are displayed in alphabetical order using the appearance o...
3 comments: