Cracking The Code.Did You Know Efficient & Working Code Really Matters: Adobe Question

"Coding is just like talking to a unknown girl. Once you talked to her with guts, the next time you'll never afraid",Really? Yes , try it Now !!! Everything here is for education and learning purpose only , individual holds rights on outer posts/links etc. Team Cracking The Code

About Me

Given a sequence of n real numbers A(1) ... A(n), determine a contiguous subsequence A(i) ... A(j) for which the sum of elements in the subsequence is maximized

You have N computers and [Ca, Cb] means a is connected to b and this connectivity is symmetric and transitive. then write a program which checks that all computers are interconnected and talk two each other

Maximum Sum Subsequence in an unsorted array of size n

WAP to Count Tottal number of Characters, Words and Lines in File Efficiently

Problem: You are given a two dimensional bit array(elements are 0 or 1). Find number of islands in this array. One island is defined as all elemnts which are 1, including neighbours(with or without diagonals). Or Array Islands problem.

Find The Largest Binary Search Tree in GIven Tree . Its Should be the Subtree.

Find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum.

GIven a string "RGBBGBGR". we have to eliminate the couple (two same chars adjacent to each other) recursively. For example RGBBGBGR --> RGGBGR-->RBGRG

find the minimum number of platforms so that all the buses can be placed as per their schedule.

find at what time the maximum number of people will be in the party .

Given an unsorted array of size n. Array elements are in range from 1 to n. One number from set {1, 2, …n} is missing .Find the missing elements ?

Coin Denomination Problem

Fill the rectangle with squares

Design a function getBits that gives x bits from a given position p of a given number n.

Given two sorted arrays a[]={1,3,77,78,90} and b[]={2,5,79,81}. Merge these two arrays, no extra spaces are allowed. Output has to be a[]={1,2,3,5,77} and b[]={78,79,81,90}.

Given 3 arrays, pick 3 nos, one from each array, say a,b,c such that |a-b|+|b-c|+|c-a| is minimum

WAP to Find Path of Minimum Sum in Binary Tree Efficiently

WAP Check Endianess of Machine & Converting From One Endians To Other

WAP a function to determine the number of bits required to convert integer A to integer B.

Given integer n decide if it is possible to represent it.SPOJ Prob. 91 as a sum of two squares of integers.