Hi I have one year experience and have interview scheduled on monday.
Pease help me with your experience or knowledge regarding questions,
strategy and
any misc aspect.
Thanks in advance
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To v
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 !
--~--~-~--
Hello everone, I'm trying to solve n-queens problem by a new approach(actually , it's quite old) called Contraint Programming, It is basically backtracking combined with notions of local consistancy. My basic algo is this
bool findsol(ChessBoard *ptboard, int row){// Basic Back
