Given a string s, partition s such that every substring of the partition is a palindrome.
Return the minimum cuts needed for a palindrome partitioning of s. 17 more words
Again, back reviewing code and saw yet another interesting one.
The code looks like this:
select username from . where LOWER(lastname) = LOWER(@lastname)
-- Find Index from the String select (LEN('0000000000000045') - CHARINDEX('0',Reverse('0000000000000045')) + 1) as FindIndex -- Using Regx(if after the value is zero(0) SELECT PATINDEX('%[^0]%','0000000000000450000') -- Fetch Value except before Zero(0) SELECT reverse(left(reverse('0000000000000045'), charindex('0', reverse('0000000000000045')) -1)) as FetchValueExceptZero select REVERSE(SUBSTRING(REVERSE('000000000045'),0,CHARINDEX('0',REVERSE('000000000045')))) as FetchValueExceptZero -- Using Regx(if after the value is zero(0) select substring('0000000000000450000',patindex('%[^0]%','0000000000000450000'),Len('0000000000000450000'))
Here are some metrics that I have gathered around tokenizer, split and scanner. These are various methods of splitting a string into array of individual string elements. 66 more words
This is a macro to parse string data that have a specific type of delimiters. (In this example, the delimiter is the semi-colon “;”.) The macro is needed so that it can loop through all character variables each of which needs to be split into a number of new variables based on a predefined delimiter. 328 more words