CareerCup

Do it this way .. Make a rectangle d covering both the rectangles.. the length and width of this new rectangle has to be less than the sum of both the rectangles for any overlap

int doesRectOverlap(rect ra, rect rb){ 
	rect d;
	d.topx = min(ra.topx,rb.topx);
	d.topy = min(ra.topy,rb.topy);
	d.botx = max(ra.botx, rb.botx);
	d.boty = max(ra.boty,rb.boty);
     if(width(d) > width(ra)+ width(rb) || length(d) > length(ra) + length(rb))
	return 0;
	else
return 1; 
}

/* For your reference 
struct rect{ 
int topx,topy,botx,boty; 
};

int doesRectOverlap(rect ra, rect rb){ 
	if ((rb.topy < ra.boty) || (ra.topy < rb.boty) || (rb.topx > ra.botx) || (ra.topx > rb.botx))
		return 0; do not overlap
	return 1; // do overlap.
}

Anonymous, ZhenyiLuo: Your algorithm is flawed.

You need to check:
"Do the rectangles overlap vertically?" AND "Do the rectangles overlap horizontally?". You can't just do one or the other.

int doesRectOverlap(rect ra, rect rb){
if ( rb.topy > ra.boty || rb.boty < ra.topy || rb.topx > ra.botx || rb.botx < ra.topx)
return 0; do not overlap
return 1; // do overlap.
}

int doesrect(struct rect ra,struct rect rb)
{
    struct rect temp;
    temp.topx = (ra.topx<rb.topx)?ra.topx:rb.topx;
    temp.topy = (ra.topy<rb.topy)?rb.topy:ra.topy;
    temp.botx = (ra.botx<rb.botx)?rb.botx:ra.botx;
    temp.boty = (ra.boty<rb.boty)?ra.boty:rb.boty;
    if(((temp.botx-temp.topx)>(ra.botx-ra.topx + rb.botx-rb.topx)) || ((temp.topy-temp.boty)>(ra.topy-ra.boty + rb.topy-rb.boty)))
       return 0;
    return 1;
}