http://geeksquiz.com/c-pointers-question-12/
On Sat, Jan 12, 2013 at 9:18 PM, Piyush Raman piyush2011...@gmail.comwrote:
For simple reasons according to me:
1- It reduces overhead drastically,thus more efficient execution time is
achieved. Consider a recursive function call having array
http://www.geeksforgeeks.org/archives/14943
On Mon, Jun 4, 2012 at 7:57 PM, Decipher ankurseth...@gmail.com wrote:
@Victor - Someone had asked this question from me !! He told me its from
Project Euler Q-83.
@Hassan - I think you are right. This question can be solved by
Dijikstra's algo,
http://www.geeksforgeeks.org/archives/14943 is a very similar problem.
On Thu, Dec 15, 2011 at 1:12 PM, WgpShashank shashank7andr...@gmail.comwrote:
@Azhar , also for 1st question u r trying Array DS will suffices. Its
Standard Coin Change Problem , u need to solve subproblem 1st , store it in
http://www.geeksforgeeks.org/archives/9705
On Fri, Nov 25, 2011 at 12:36 AM, rahul sharma rahul23111...@gmail.comwrote:
struct abc
{
int g;
float f;
double gj;
};
like in this int takes 4 bytes and we want align in 8 bytes so i wana know
that whether the float should put with
It's a variation of next greater element problem (
http://www.geeksforgeeks.org/archives/8405). Instead of next greater
element, this problem asks about next smaller element.
On Wed, Nov 23, 2011 at 5:29 PM, Gene gene.ress...@gmail.com wrote:
Thanks. Maybe I'm not reading correctly, but tech
http://geeksforgeeks.org/forum/topic/deep-copy-vs-shallow-copy
On Fri, Nov 18, 2011 at 12:58 PM, Gene gene.ress...@gmail.com wrote:
The most extreme shallow copy is just copying a pointer to a large
data structure like a graph or tree. Deep copy is copying the entire
data structure and
http://geeksforgeeks.org/
On Tue, Nov 16, 2010 at 8:23 PM, Mukesh Kumar thakur
mukeshraj8...@gmail.com wrote:
try website:-.www.placementpapers.com
indiabix.com
On 11/15/10, Bittu B bittu.bitt...@gmail.com wrote:
Plz suggest some links for placement aptitude and
http://geeksforgeeks.org/
On Sat, Sep 11, 2010 at 11:52 AM, Nikhil Agarwal
nikhil.bhoja...@gmail.comwrote:
Thanks man for the site.Anybody having such info/any material please post
it here.Thanks in advance
On Sat, Sep 11, 2010 at 1:53 PM, bittu shashank7andr...@gmail.com wrote:
thanks
@Raj N
It won't work for the tree like. your method would return true for the
following tree.
13
/
12
\
14
On Sat, Jul 3, 2010 at 3:45 AM, Raj N rajn...@gmail.com wrote:
According to me perform inorder traversal and at every point store the
current element in a temporary
Have you guys seen following?
http://geeksforgeeks.org/?p=2838
http://geeksforgeeks.org/?p=2398
http://geeksforgeeks.org/?p=2878
On Sat, Jul 3, 2010 at 12:12 PM, Pramod Negi negi.1...@gmail.com wrote:
I guess you want the following juggling algorithm
http://geeksforgeeks.org/?p=8133 has the complete solution
On Thu, Jul 1, 2010 at 5:33 AM, jalaj jaiswal jalaj.jaiswa...@gmail.comwrote:
in this case counting sort is inplace as how long the input array be ..the
auxilary array will be of soze 3 only.. and counting sort is stable too
On Thu,
http://geeksforgeeks.org/?p=3042 has all the approaches (right and wrong)
for solving this.
On Thu, Jul 1, 2010 at 4:43 AM, divya jain sweetdivya@gmail.com wrote:
@ above
here u r comparing node value with min and max only
for eg if ur tree is
45
A collection of links:
http://geeksforgeeks.org/?page_id=6028cat=Data+Structures+%26+Algorithms
On Thu, Jun 17, 2010 at 8:33 AM, chinna thirupathi.thu...@gmail.com wrote:
plz can u provide material -reg:design and analysis of algorithms.
basics of algorithms and psudocode notation,time and
See http://geeksforgeeks.org/?p=3133 for solution.
On Fri, Jun 11, 2010 at 8:41 AM, divya sweetdivya@gmail.com wrote:
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
The link http://geeksforgeeks.org/?p=1488 has many different solutions and
implementation of hashing method.
On Mon, Jun 7, 2010 at 12:59 AM, Raj N rajn...@gmail.com wrote:
@Anand :Your approach will turn out very crude if elements are something
like 1000, 2000
keeping an array i.e
@satwik
See http://geeksforgeeks.org/?p=6358 for Morris Inorder traversal
On Sat, May 15, 2010 at 9:44 PM, satwik krishna sathi...@gmail.com wrote:
@Rohit
Can u pass on thje link of morris inorder
On 5/15/10, Rohit Saraf rohit.kumar.sa...@gmail.com wrote:
there is something called morris
http://geeksforgeeks.org/ can be helpful. You can also find links to
tutorials/articles http://geeksforgeeks.org/?page_id=6028
On Fri, May 21, 2010 at 3:57 AM, sharad kumar aryansmit3...@gmail.comwrote:
@venky
pls c www.topcoder.com/tc its gt tutorials,srm matches etc.
On Fri, May 21, 2010
Here are 3-4 methods to solve
http://geeksforgeeks.org/?p=503
On Sat, Apr 17, 2010 at 5:45 AM, Ashim Kapoor ashimkap...@gmail.com wrote:
are you referring to the lectures by Dr Naveen Garg ? Or are these lectures
different? Please clarify.
Thank you,
Ashim.
On Sat, Apr 17, 2010 at 5:43
Here is code and explanation http://geeksforgeeks.org/?p=5009
On Sat, Apr 10, 2010 at 10:18 PM, Rohit Saraf
rohit.kumar.sa...@gmail.comwrote:
hmm... that can always be done !
--
Rohit Saraf
Second Year Undergraduate,
Dept. of Computer Science
Please go through the site http://geeksforgeeks.org/
I recently found the site. This is a great site as this provides well
organized and well coded solutions for generally asked interview/programming
questions
Enjoy!!
Dheeraj
On Tue, Feb 2, 2010 at 9:11 AM, Ashudeep Sharma
20 matches
Mail list logo
