In last semester I had a course on Software Engineering, as a course requirement a group of 7 members had to work on a project, my group had to make an automatic timetable generating system, basically, it takes in the preference of all faculty member, and as an output gives the timetable for all batches.

So I came up with an algorithm to serve this purpose, the algorithm is not very complex but it was the closest thing I did, which resembled competitive programming by far.

Project Link

Working on a personal project right now that doesn't seem too difficult on the surface, but I'm now stuck on how to build a data structure.
Here's the problem:
I have a bunch of events with start and end times. I need to find a way to store these events so I can make a query( L, R ) so that the query function returns a list of events one at a time, with end times > L and start times < R, sorted in ascending order of end times.

Changing rows to columns in a matrix

I've made a little "game" (it's actually very boring to play for now) on C's SDL2 Library. I've had to code circunference to line collisions with speed vector bounce for this game and if it wasn't for the computational geometry that I've learnt in competitive programming, I would never have been able to do it.

Take a look at the code in question the relevant bit is the last routine at the very bottom of the page.

1. Fenwick tree (with Binary search on prefix sums) for random selection of actions by probabilities which can increase/decrease over time.
2. Investigation of string matching algorithms for dynamic fragment replacement in cached documents.
3. Generating unique codes based on user input prefix + number (eg. CODE1, CODE2, ...) in log N (instead of N) attempts.

I think noticing the opportunity to utilize algorithmic techniques is more important than knowing the techniques themselves.