Please visit this
linkhttp://www.techgig.com/codehire/ZSAssociates/problem/35.And
help me in solving this.
--
Thanks Regards
Gobind Kumar Hembram
Contact no.-+91867450
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
Given an integer expression in a prefix format (i.e. the operator
precedes the number it is operating on) , print the expression in the
post fix format .
Example: If the integer expression is in the prefix format is *+56-78,
the postfix format expression is 56+78-*. Both of these
correspond to
Write C code to implement level order traversal of a tree.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
How to multiply two numbers without using * operator?
Hint:Use bit operators
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
Given an array containing sequence of bits (0 or 1), you have to sort
this array in the ascending order i.e. all 0' in first part of array
followed by all 1's. The constraints is that you can swap only the
adjacent elements in the array. Find the minimum number of swaps
required to sort the
If we use merge sort like procedure,ans will be 1 here it should be
3.we have to swap 0s and 1s linearly.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this
Write a function longest_palindrome, which takes an array of strings
as argument and returns the
longest palindrome in that array if any.Please give ideas how to
implement this function.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
I was asked this question in one company Programming Round.Please help
me in solving this,I tried with array of pointers ,2-D array and by
buffering.
You have a file with names of brands separated by comma. Write a
program (in language of your choice) to group them by their starting letter.
For
Given two positions in a 2-D matrix, say (x1, y1) and (x2, y2) where
x2=x1 and y2=y1. Find the total number of distinct paths between
(x1, y1) and (x2, y2). You can only move in right direction i.e.
positive x direction (+1, 0) or in up direction i.e. positive y
direction (0, +1) from any given
Given an integer expression in a prefix format (i.e. the operator
precedes the number it is operating on) , print the expression in the
post fix format .
Example: If the integer expression is in the prefix format is *+56-78,
the postfix format expression is 56+78-*. Both of these
correspond to
Hi
Do any one know how to configure MySQL Connector ; so as to connect to
MySql using C.If any one have any idea ; please share.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
11 matches
Mail list logo
