SNCKYEAR - EDITORIAL (Unofficial)

PROBLEM LINK:

Practice
Contest

Author: mgch
Editorialist: admin5

DIFFICULTY:

CAKEWALK

PREREQUISITES:

Basic implementation

PROBLEM:

You are given a number N, and you need to check whether it is in {2010, 2015, 2016, 2017, 2019} this set or not.

QUICK EXPLANATION:

Check N is in given set {2010, 2015, 2016, 2017, 2019} or not.

EXPLANATION:

Initially in problem statement you are given a set of years {2010, 2015, 2016, 2017, 2019}, and a number N.
You can just hash all the given years or make a simple list, then run a simple loop and find the answer, if it is availabe then print HOSTED otherwise NOT HOSTED.

Time Complexity

Time complexity is approx O(1) per test case.

SOLUTIONS:

Editorialist’s solution can be found here.

Feel free to Share your approach, If it differs. Suggestions are always welcomed. :slight_smile:

1 Like
//