The bit manipulation problem required string characters to be changed according to the recurring pattern to make sure they follow the 3 given rules on power of position, reoccurance and removal from set of found with certain occurances. The graph question was comparatively easier requiring path from blocked paths to create a hazard free network.