|Search type||Search syntax|
|Code||code:"if (foo != bar)"|
|For more details on advanced search visit our help page|
Challenges with a spec which requires all answers to meet certain time complexity restrictions. This could be specific ("Your answer must be O(n^2) where n is the number of items in the input"), or at the level of complexity classes ("Your answer must be polynomial in the number of items in the input").