TSQL Challenge 75 - Find the Episode and Sequence based on interval
The challenge is to find the Episode and Sequence based on interval.
2012-02-06
1,277 reads
The challenge is to find the Episode and Sequence based on interval.
2012-02-06
1,277 reads
The challenge is to create a query for a report that show expiring material
2012-01-23
927 reads
The challenge is to wrap the text by specified position.
2012-01-09
2,883 reads
This challenge invites you to solve a payroll challenge which requires to calculate the number of hours employee worked in a week.
2011-12-26
1,827 reads
Your task is to process the input table that contains several mangled words and try to 'un-mangle' them and validate them against a 'dictionary' table.
2011-12-12
1,399 reads
This challenge invites you to identify the longest sequence of alphabets from a string.
2011-11-28
984 reads
Your job is to write a TSQL query that returns the advertisements most relevant to each web page given in the source table.
2011-11-14
610 reads
This challenge invites you to Generate kaprekar kernel or series from numbers.
2011-10-31
883 reads
This challenge invites you to identify the largest sequence of alphabets from a string.
2011-10-17
945 reads
A website wants to display most relevant ads on each of its web pages based on the keywords associated with each page.
2011-10-03
566 reads
I’ve been thinking a lot lately about what it actually takes to make an...
By Steve Jones
Redgate is a for-profit company. We look to make money by building and selling...
I’ve uploaded the slides for my Techorama session Microsoft Fabric for Dummies and my...
Comments posted to this topic are about the item Even When You Know What...
Comments posted to this topic are about the item The New Software Team
Comments posted to this topic are about the item Database Mail in SQL Server...
We create the following table and then insert some records in it:
create table t1 ( id int primary key, category char(1) not null, product varchar(50) ); insert into t1 values (1, 'A', 'Product 1'), (2, 'A', 'Product 2'), (3, 'A', 'Product 3'), (4, 'B', 'Product 4'), (5, 'B', 'Product 5');What happens if we execute the following query in both Sql Server and PostgreSQL?
select id,
category,
string_agg(product, ';')
over (partition by category order by id
rows between unbounded preceding and unbounded following) as stragg
from t1; See possible answers