# You are given a convex polygon P with n vertices, find out the radius of the *largest inscribed circle* in that polygon..
# You are given a list A of n points in the plane, find out the *minimum enclosing circle*.
# Given a number n, find out a placement of *n queens* on an nxn chessboard such that they don’t attack each other.

Given n and S integers, find out a permutation p such that 1 x p\[1] + 2 x p\[2] + .. + n x p[n] = S.

Given n and S integers, find out a permutation p such that <tex>1 x p[1] + 2 x p[2] + .. + n x p[n] = S</tex>.

# 2n knights have to sit around a roundtable. Each knight is friends with n + 1 other knights. Find a seating arrangement such that each knight is placed between two friends.
# Given two line segments in 3d space find the minimum distance between them.
# A party of n people is too large and has to be split to two tables. Given that each of the people has at most three enemies in the group, find a seating arrangement such that each person sits at a table with at most one of his enemies.