C Puzzles
yet another place for C puzzlesSunday, May 30, 2010
Big int implementation
a question from Microsoft.
Implement BigInt class (with +,-,*,-,^)
answers link:
http://www.carljohansen.co.uk/bigint/
http://www.carljohansen.co.uk/bigint/BigInt.cs.txt
Implement BigInt class (with +,-,*,-,^)
answers link:
http://www.carljohansen.co.uk/bigint/
http://www.carljohansen.co.uk/bigint/BigInt.cs.txt
Sunday, May 23, 2010
subarray with largest sum
find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum
answer :
http://geeksforgeeks.org/?p=576
answer :
http://geeksforgeeks.org/?p=576
Wednesday, May 19, 2010
How do you reverse the words in a string?
How do you reverse the words in a string?
"My name is Yet Another Software Junk"
to
"Junk Software Another Yet is name My"
answer:
1. first reverse the string
"My name is Yet Another Software Junk" to
"knuJ erawtfoS rehtonA teY si eman yM"
2. reverse word by word now
"knuJ erawtfoS rehtonA teY si eman yM" to
"Junk Software Another Yet is name My"
delete a node from circular singlely linked list with O(1)
You are given a circular single linked list of sufficiently many number of
nodes(say more than 1 crore). You need to delete a node say P and you are
given a pointer to P in the circular single list.
Suggest the most efficient methodology of deleting the node P from the
circular single linked list without rounding about the circular single
linked list.
Answer:
We have a list looking like: ... -> Node(i-1) -> Node(i) -> Node(i+1) -> ... and we need to delete Node(i).
- Copy data (not pointer, the data itself) from Node(i+1) to Node(i), the list will look like: ... -> Node(i-1) -> Node(i+1) -> Node(i+1) -> ...
- delete the second Node(i+1), it doesn't require pointer to the previous node.
Archives
July 2005 August 2005 October 2005 December 2005 March 2006 June 2006 July 2006 December 2006 February 2007 June 2007 March 2010 May 2010
Subscribe to Posts [Atom]