Flipkart asks good algo question as well as java question
On Thu, Oct 6, 2011 at 10:10 PM, Akash Mukherjee wrote:
> ne updates on flipkart n1??
>
> On Fri, Sep 9, 2011 at 9:53 PM, siva viknesh
> wrote:
> > hi...which coll and package???...plz post the interview experiences
> > after attending .
ne updates on flipkart n1??
On Fri, Sep 9, 2011 at 9:53 PM, siva viknesh wrote:
> hi...which coll and package???...plz post the interview experiences
> after attending ..thx
>
> On Sep 8, 6:03 pm, htross wrote:
>> please post the questions after the first round is over...
>>
>> On Sep 8, 9:3
@shruti ...u have used 2 arrays row n col extra?
On Mon, Oct 3, 2011 at 11:47 PM, Ankur Garg wrote:
> Many times this problem has been discussed ..Please check the archives yaar
> :(
>
>
>
> On Mon, Oct 3, 2011 at 11:39 PM, Shruti Gupta wrote:
>
>> I had inserted 0 instead of 1 The corrected
Many times this problem has been discussed ..Please check the archives yaar
:(
On Mon, Oct 3, 2011 at 11:39 PM, Shruti Gupta wrote:
> I had inserted 0 instead of 1 The corrected code will be:
> public static void setZeros(int[][] matrix) {
>int[] row = new int[matrix.length];
>int[] col
I had inserted 0 instead of 1 The corrected code will be:
public static void setZeros(int[][] matrix) {
int[] row = new int[matrix.length];
int[] column = new int[matrix[0].length];
// Store the row and column index with value 0
for (int i = 0; i < matrix.length; i++) {
for (
Hi!
A effecient way to solve the problem in O(1) space is by making use of
the fact that instead of keeping track of which cell has a 0, we can
just know which row or column has zero, as eventually that row/col
will become 0. The code looks like this:
public static void setZeros(int[][] matrix) {
le lo bhai jo bhi mil rha hai...nahi to baad mein "katne" ka bahut
chance hota hai.
On Sep 17, 5:02 pm, siva viknesh wrote:
> Do post ur queries only in english...there are members from all over
> India , even abroad...u may lose answers
>
> On Sep 17, 2:13 pm, vivek goel wrote:
>
>
>
>
>
>
Do post ur queries only in english...there are members from all over
India , even abroad...u may lose answers
On Sep 17, 2:13 pm, vivek goel wrote:
> HELLO FRIENDS,,,
> PLEASE give me advice THAT agar *computer branch(B.E. or MCA) ka koi
> student hai and agar uski deloite consul
hi...which coll and package???...plz post the interview experiences
after attending ..thx
On Sep 8, 6:03 pm, htross wrote:
> please post the questions after the first round is over...
>
> On Sep 8, 9:35 am, rahulmaximus wrote:
>
>
>
>
>
>
>
> > what the pattern like?
> > Any papers or type o
please post the questions after the first round is over...
On Sep 8, 9:35 am, rahulmaximus wrote:
> what the pattern like?
> Any papers or type of topics to stress on would be welcomed ...
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
@Ankur: When k = 100, the heap method I proposed is O(n). And if you
have to program it from scratch, it is a lot easier than the median of
medians algorithm.
Dave
On Aug 18, 2:35 am, Ankur Garg wrote:
> U can use selection Algorithm to achieve the same ...it has got expected
> running time comp
@XYZ: There are up to n numbers to put into the heap, and an insertion
into a heap of size k is O(log k).
Dave
On Aug 17, 10:42 pm, XYZ wrote:
> @Dave
>
> How did you get the complexity as O(n log k)
>
> On Aug 18, 8:14 am, Dave wrote:
>
>
>
> > @Aditi: Form a max-heap of the first 100 numbers.
When the interviewer says there are a million numbers to consider, it might
mean that we don't have enough memory to hold all those in a single
datastructure. In which case Dave's solution of using a heap of size 100 is
the better one I suppose. I am sure a B+ tree takes O(nlogn to the base b)
whi
i agree with amol
it cud be max-heap only...
Regards,
PAYAL GUPTA
On Thu, Aug 18, 2011 at 2:26 PM, Apoorve Mohan wrote:
> or rather u can just have 100 iterations of selection sort...u'll get the
> min 100 iterations...and this is inplace as well...
>
>
> On Thu, Aug 18, 2011 at 1:18 PM, Apo
or rather u can just have 100 iterations of selection sort...u'll get the
min 100 iterations...and this is inplace as well...
On Thu, Aug 18, 2011 at 1:18 PM, Apoorve Mohan wrote:
> Create a B+ tree and extract the first 100 leaf nodes
>
> On Thu, Aug 18, 2011 at 1:05 PM, Ankur Garg wrote:
>
Create a B+ tree and extract the first 100 leaf nodes
On Thu, Aug 18, 2011 at 1:05 PM, Ankur Garg wrote:
> U can use selection Algorithm to achieve the same ...it has got expected
> running time complexity as O(n) ...Read Wikipedia to see the proper
> implementation..
>
> Just some tweak wit
U can use selection Algorithm to achieve the same ...it has got expected
running time complexity as O(n) ...Read Wikipedia to see the proper
implementation..
Just some tweak with Quick Sort ..Also there is one method median of medians
one which has worst case complexity as O(n)
Regards
Ankur
On
it will be max heap only.in which root denotes the largest number in
your set of 100 smallest
--
Amol Sharma
Third Year Student
Computer Science and Engineering
MNNIT Allahabad
On Thu, Aug 18, 2011 at 9:14 AM, aditi garg wrote:
> @ dave : i hv one doubt,we wud be maintaining a max or a m
@ dave : i hv one doubt,we wud be maintaining a max or a min heap??
On Thu, Aug 18, 2011 at 9:11 AM, aditi garg wrote:
> thank u so much dave :)
>
>
> On Thu, Aug 18, 2011 at 8:44 AM, Dave wrote:
>
>> @Aditi: Form a max-heap of the first 100 numbers. Then as you read the
>> remaining numbers, if
@Dave
How did you get the complexity as O(n log k)
On Aug 18, 8:14 am, Dave wrote:
> @Aditi: Form a max-heap of the first 100 numbers. Then as you read the
> remaining numbers, if a number is less than the root of the max-heap,
> replace the root with it and restore the heap condition. When you
thank u so much dave :)
On Thu, Aug 18, 2011 at 8:44 AM, Dave wrote:
> @Aditi: Form a max-heap of the first 100 numbers. Then as you read the
> remaining numbers, if a number is less than the root of the max-heap,
> replace the root with it and restore the heap condition. When you
> reach the en
@Aditi: Form a max-heap of the first 100 numbers. Then as you read the
remaining numbers, if a number is less than the root of the max-heap,
replace the root with it and restore the heap condition. When you
reach the end of the million numbers, the heap will contain the
smallest 100 numbers.
If th
Consider a rectangle of M & N .Inside that there are many small
overlapping rectangles.Now i have to minimize overlapping area such
that the "% increase in size (M & N) -> 0 ".
means readjust smaller rectangles such that they do't overlap.
Please suggest some algorithm !
On 5/21/07, Monu Ra
please elaborate
On 5/21/07, monu <[EMAIL PROTECTED]> wrote:
>
>
> Consider a rectangle of M * N .Inside that there are many small
> overlapping rectangles.Now i have remove overlapping suchthat the "
> % increase in size (M*N) -> 0 ".
>
>
> >
>
--
Thanks & Regards,
Dhruva Sagar.
--~--~---
there is this very nice yahoogroup called theory-edge
http://groups.yahoo.com/group/theory-edge
You can try your hands there... that would be more an approriate group to
post this kinda questions.
best,
sudarshan
- Original Message -
From: "Protoman" <[EMAIL PROTECTED]>
To: "Algo
Great that Protoman found a way to be obnoxious on this mailing list. However,
let's try to see the merit in the problem. First let us restate the problem in a slightly more technical terms.
You have a map with a certain number of obstacles. You have to avoid
collision with some dynamic objects w
26 matches
Mail list logo
