Hi,
I am a competitive programmer. Your problems are familiar to me. I am giving an example of my knowledge about algorithm.
Problem: Required algorithm Your expected Complexity
Personality Test Tarjan O( |V| + |E|)
The Twin Tours LCS O(N*M)
Big Vertex Cover Vertex Cover NP complete
Pizza Ordering BPM/Vertex Cover NP complete
The last problem is an analytical problem.
To make you me more reliable about my capability I suggest you to take a look here:
[login to view URL]
Looking forward to hear from you. Thank you.