Ur Solution is an application of Depth First Search that searches all the
elemnts od the matrix in a recursive manner :)
On Tue, Dec 20, 2011 at 11:48 AM, rahul raghavendra wrote:
> there are diverse topics such as graph theory , number theory , sorting ,
> searching , dynamic prog
basic one's that should be known ?
>
>
> On Tue, Dec 20, 2011 at 11:33 AM, rahul raghavendra
> wrote:
>
>> It is always better to know certain standard algorithms.
>> So whenever u see a problem and can possibly match it with any standard
>> algorithm ..
It is always better to know certain standard algorithms.
So whenever u see a problem and can possibly match it with any standard
algorithm .. u r in luck and can solve it in the most efficient manner as u
already know how to go about it.
Whereas for the other case when u hav no idea abt the proble
I would go for a theta(N ^2) solution ...
any time constraints ?
On Fri, Dec 16, 2011 at 12:16 PM, vivek dhiman wrote:
> Hi all
>
> Can you suggest what algorithm can be used for such a problem.
>
> There are voids formed using blocks as shown in example file attached...
>
> I want to find out th
Hey Jitendra ,
I dont know what ide's are used by Google and Face book guys ,
But I use Vim editor .
Gcc is typically inbuilt in Linux .
To get a hang of Vim , " byte of vim" is a good ebook .
On Sun, Sep 11, 2011 at 2:02 PM, jitendra wrote:
> Hello friends
> I am typically using
u can do a lot of stuff with the bitwise operators , u just gotta experiment
with it
On Tue, May 10, 2011 at 2:21 AM, Morgan Bauer wrote:
> XOR is the bread and butter of Symmetric Cryptography.
> ~mhb
>
> On Mon, May 9, 2011 at 4:44 PM, Marcelo Ramires
> wrote:
> > I understood how to solve thi
There is a beautiful technique of generating subsets for a set of not more
than 20 elements (Why , u'll understand later as u read the code ) .
This code will just generate all the subsets of a given set . The sorted
condition and other stuff can b done easily .
for(int i=0;i20
On Tue,
hey can anyone suggest any good book that contains such kind of questions
...
On Mon, May 9, 2011 at 2:58 AM, Vexorian wrote:
> > I am a decent programmer and when I started out I too was looking for
> those elusive tips and tricks that the top rated programmers know of. True,
>
Start with the basic stuff :-
-1) Write simple code to represent graph.
-2) Remember and practice heavily the way u code , as it will help u to
code faster every time u solve a graph problem
-3) Learn basic algo's as satyajit pointed out , especially DFS and BFS .
-4) Follow Step 2 for
Yeah thanks man !!
Checked out the link !!
On Mon, Apr 18, 2011 at 9:52 PM, Luke Pebody wrote:
> "You can't". You'd need a lot of memory and a lot of time to work out the
> integer part of this large a value. However, you don't need to work out the
> entire integer part. You can, for instance
10 matches
Mail list logo
