T-SQL Challenge – Efficient Partitioned TOPCommented on: 4 years ago
(September 30, 2009)
Ah... I put a solution together, but it turns out that it's basically the same as Steve's, except that I used bigint (not decimal(10,0), and the number 2147483648 for my offset.
Shame it doesn't...
T-SQL Challenge - CombinationsCommented on: 6 years ago
(January 31, 2008)
Here's another one that copes with larger data sets. It even uses a cursor! (boo, hiss... but it performs more than adequately, so I don't mind)
create table #v (amt money);
insert #v values (0);...
Palindromes Puzzle - SolutionsCommented on: 7 years ago
(January 31, 2007)
You've put my solution in wrong, Itzik. There's supposed to be two apostrophes in the lines which say:
cast(' as varchar(max))
The idea is that there's an empty string which we cast to varchar(max...
Palindromes PuzzleCommented on: 7 years ago
(January 23, 2007)
--Using the argument that I want combinations where I can't find a character which is wrong, this gives me the 44 answers for up-to-six words.
declare @maxnumwords int;
set @maxnumwords = 6;
Microsoft seems to be bent on marginalizing SQL Server Standard Edition—both in the sense of the artificial constraints placed upon how much memory it can use, and in terms of what seems to be a shift in focus on the role of Standard Edition from Microsoft....More