The idea of this challenge is to clean up the phrase from the words identified as 'noise' words, but only when these words appear at the begining or the end of the string, not in the middle of the string. Your job is to read each row from the source table and remove any noise words from it. The noise words that you need to remove are stored in another table. You should remove the noise words only if they appear at the beginning or end of the sentences

this challenge is to draw a graph using TSQL

This is a challenge to identify the downtime of servers from the log data generated by a monitoring application. There is a monitoring application that keeps checking the status of several servers at 5 minute intervals. When the monitoring application finds that a particular server is down, it adds a record into the log table.

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 parsing a delimited string and applying some logic to perform some calculations based on the position of tokens within the string. This challenge has got a fake (or self?) reference to the TSQL Challenges itself. Your job is to calculate the SQL Stars awarded to each of the winners by parsing a delimited string.

This challenge is related to an inventory management application where your job is to calculate the profitability by item (cost vs sales) using First-In-First-Out (FIFO) processing method.

This challenge involves evaluating mathematical expressions presented using Roman Numerals and return the result of each expression.

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 extracting email addresses from a table that contains text data downloaded from various websites.

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

This challenge involves identifing first character in string and removing all leading characters.

Here is an interesting challenge which might give you a fun time categorizing products by color. The first part of your job is to identify the unique color combinations of products and the second part is to identify the products that have the given color combination.

The primary goal of this challenge is to demonstrate the power of Recursive CTEs introduced in SQL Server 2005. Recursive CTEs allow you to implement almost any algorithm in a single TSQL statement. This challenge is to parse and evaluate arithmetic expressions using TSQL.

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.

The purpose of this challenge is to test your query writing skills with a limited set of TSQL keywords. What is special with this challenge is that you are allowed to use only a given set of TSQL keywords. While this type of restrictions may not be part of a real-world assignment, this will certainly a good test to your TSQL creativity. The idea is to simulate the "limit posit,n" function which doesn't still exist in Ms Sql Server and Sybase.

TSQL Challenge 40 challenged you to a query that converts binary values into hexadecimal format. This challenge invites you to write a query that converts binary values into decimal format.

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 challnge invites you to generate a Sierpinsky carpet using TSQL. If you are new to Sierpinsky Carpet, see the details here (http://en.wikipedia.org/wiki/Sierpinski_carpet). Your job is to read the input table and generate a Sierpinsky carpet of the specified level. The sample input data for this puzzle is ginve below.

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.