On Feb 21 IISc Bangalore conducted a programming contest at Hackerrank, named Supercoder or Pseudocoder?. Around 100 people participated in this and i managed to come within the TOP 10. Below are the techniques required to solve the problems from the contest:
1. Map & string
2. Working of STACK
3. Sieve of Eratosthenes ( Prime number finding algorithm )
4. Application of DFS
5. Segment Tree
The top scorers of the off-site contest will be qualifying for an onsite round which is scheduled to take place at IISc on Feb 28. I have a hope the i will be selected for the on-site round.
Rank in the contest: 10 / 90
Link to the Scoreboard:
https://www.hackerrank.com/contests/supercoder-or-pseudocoder/leaderboard
1. Map & string
2. Working of STACK
3. Sieve of Eratosthenes ( Prime number finding algorithm )
4. Application of DFS
5. Segment Tree
The top scorers of the off-site contest will be qualifying for an onsite round which is scheduled to take place at IISc on Feb 28. I have a hope the i will be selected for the on-site round.
Rank in the contest: 10 / 90
Link to the Scoreboard:
https://www.hackerrank.com/contests/supercoder-or-pseudocoder/leaderboard