Cracking The Code.Did You Know Efficient & Working Code Really Matters: DirectI Interview

"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 an array of strings ... find the string which is composed of other strings in the array and is of maximum size. Ex: ["satcatratbat" , "rat", "bat", "cat", "sat", "ratbat", "ratsatcat"]. Output: "satcatratbat"

Maximum Sum Subsequence in an unsorted array of size n

How much tottal water can be stored in buildings

a coordinate a(xa,ya) dominates b(xb,yb) if ( xa>=xb and ya>=yb) how can I find all pairs in a set of coordinates

Given an array all of whose elements are positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjacent in the array.

Find Maximum length palindrome in a from a ascii text file

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.

Write An Efficient Program to Clone a Graph ?

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

Given Table of Cities , Find Minimum Number of Hopes Required to Fly From One to Other City

Provide an efficient algorithm to solve the question "Can I buy N items?

Design Data Structure For Students-Courses Realtionship

Given a list of N line segments on the X axis: (x1[i], x2[i]) where i = 1 to N; And then a list of M queries. Each query inputs one x-coordinate and you need to output the set of all {i} that overlaps this point.

A 7 digit number consists of 7 distinct digits (from 0..9 ofcourse); The product of the first 3 digits = product of central 3 digits = product of last 3 digits; Find the middle digit.

Design an algorithm that takes strings S and r and returns if r matches s. (Assume r is a well-formed regular expression.)

Write a function int interval_unfold_count(int n); that returns the length of the shortest sequence of operations resulting in either L or R being equal to N.

Coin Denomination Problem

How to Count Number of Set Bits e.g. Number of 1's efficiently ?

Find the longest arithmetic series that can be formed by choosing a sub-collection (possibly the entire collection)..TC problem