This repository contains solutions to algorithmic problems implemented in C.
These problems focus on:
- Scheduling algorithms
- String manipulation
- Efficient time complexity approaches
Given a list of meetings with start and end times, determine the minimum number of meeting rooms required such that no meetings overlap.
A meeting that ends at time t and another that starts at time t do not overlap.
Input: [[1,4], [1,5], [5,6], [6,10], [7,9]]
Output: 2
O(n log n)
Given a string, generate a new string consisting of its last two characters reversed and separated by a space.
Input: "bat"
Output: "t a"
Bello Umar
Computer Science Graduate | Web Developer | AI Enthusiast