Here is a challenge that takes you away from those repetitive boring type of queries that you write over and over again, several times a day. All of us, the database people, are familiar with thinking in set based manner as well as row by row style. Here is something that is very interesting where you might need to process records in a 'three-line-at-a-time' fashion.

This is a problem that I had seen in one of the forums many years back. This problem is related to a reporting requirement from the data stored by a 'poorly designed' system. The system has one table that stores the appointments scheduled for each employee. There is another table that keeps tracks of the activities performed by employees.

This challenge presents a scheduleing problem related to recurring appointments. The task is to calculate and generate a list of appointments that are supposed to take place between two given dates. The calculation should be done based on the recurring configuration of each appointment. Each appointment has a 'Schedule Start Date' and 'Schedule End Date' and any occurrences that fall outside those dates should be ignored. When generating the appointments between two dates, consider the start date and end date of each appointment.

Here is another scheduling problem that deals with the allotment of classrooms for various training programs. Your challenge is to read the source data and build an output result set that shows the weekly schedule of each training topic and the class room in which training is scheduled.

This is a matrix transposition challenge and your job is to change the position of the numbres in a 5x5 matrix. Transposition includes converting rows to columns and sorting the values horizontally and vertically.

This challenge is adapted from a budgeting system used in a large company to perform quarterly analysis of what kind of work will be done and where it will be done. Project Managers make plans and the estimated hours of work required from each employee each month end up in a central database. Top managers want to see a synthesis of this by department and profession.

The recent 24-hours-of-pass or more widely known as #24HOP on twitter and other social media was one of the most exciting SQL Server events that happened recently. For this challenge, we created some (fake) attendance data for this event. Your task is to count the number of attendees who watched the complete presentation of each speaker.

This challenge is all about searching for two keywords in a string with a maximum distance of 'one word' between them.

This challenge involves writing a logic to change the column position of values in the output based on the presence and absence of other values on each output row.

This challenge involves converting numeric values from binary format to hexadecimal format. Your job is to process all the input rows from the source table and produce hexadecimal representation of the binary values.

This challenge involves writing a logic to identify incomplete segments and missing elements in an electronic data integration file exchanged between two applications.

Several technicians are sent to a customer premises to do a certain maintenance work. Your task is to process the activity log entered by each technician and identify overlaps in the time sheet.

A table contains the list of modifications made to each card. Your job is to write a query that shows the first number, current number (most recent) and the number of changes made.

An IVR application stores call information into a SQL Server table. A reporting application needs to read phone numbers from the call log and identify the country-code/area-code that is part of the phone number. Your job is to write a query that identifies the longest matching country/area code from each phone number based on the information stored in an area-code reference table.

This challenge invites you to identify the longest sequence of alphabets from a string.

A website wants to display most relevant ads on each of its web pages based on the keywords associated with each page. Your job is to write a TSQL query that returns the advertisements most relevant to each web page given in the source table.

This challenge invites you to Generate kaprekar kernel or series from numbers.

A SQL Server instance is set up to log the session start time and end time into a table. Given this table, your job is to find all time intervals in which no one is logged in. For the intervals separated by these empty intervals show the maximum number of simultaneous users.