|
|
-
Mario Puskaric Commented 1 Years ago through Puzzles
In 2012 it's quite simply, just one query,
for example, to get the previous date is only required something like this:
PriorDate = lag(IntervalDate) over (partition by ID order by Interval)
|
-
Mario Puskaric Commented 1 Years ago through Puzzles
It's just not fun with SQL Server 2012.
I wouldn't call it chalenge at all, because with windowing functions it's just regular query. :o(
|
-
Mario Puskaric Commented 2 Years ago through Puzzles
Well, I never have played the mangled words game in the school so I'm not familiar with rules.
So just to check, field MangledWord contains more mangled words separated by 1 space and each word must be searched in dictionary separately?
Or from examp
|
-
Mario Puskaric Commented 2 Years ago through Puzzles
My solution is completely correct, it does not violate any of rules.
I am not guilty if a task is set in a way that it can be so easily solved.
And it is all variants needed (trust me).
And I'm pleased that I teach You some new tricks :o)
Anyway,
|
-
Mario Puskaric Liked 2 Years ago through Puzzles
This challnge invites you to generate a Sierpinsky carpet using TSQL.
|
-
Mario Puskaric Commented 2 Years ago through Puzzles
@Bert
I would propose that the test data does not use random numbers, because stats are then incomparable (different number of recursion for different generated random numbers).
|
-
Interview questions and answers on various SQL Server areas such as Database Administration, TSQL Development, BI etc....
|
-
Mario Puskaric Commented 2 Years ago through Puzzles
One read to rule them all!
Anyway, challenge is to simple.
|
-
Mario Puskaric Solved 2 Years ago through Puzzles
One read to rule them all!
Anyway, challenge is to simple.
|
-
Mario Puskaric Commented 2 Years ago through Puzzles
OK, there is no limit in the number of levels in the hierarchy,
but are there limit in length of Categories field?
Or to put it simple, is Categories varchar(max) or maybe varchar(8000)?
|