Free Trial

Weekly Challenges

Solve the challenge, share your solution and summit the ranks of our Community!

Also available in | Français | Português | Español | 日本語
IDEAS WANTED

Want to get involved? We're always looking for ideas and content for Weekly Challenges.

SUBMIT YOUR IDEA

Challenge #4: Date Parsing

trjeffries
8 - Asteroid
Spoiler
Screenshot 2025-02-13 at 14.23.08.png
JS1989
8 - Asteroid

Solution

witleyn
6 - Meteoroid

[solution]

TGreen
8 - Asteroid

Challenged solved, nice RegEx case.

someotherguy
8 - Asteroid

A little rusty with RegEx capture groups, ended up using a previous solution as a guide and documented how it works.

Spoiler
2025-03-10 11_54_15-Alteryx Designer x64 - challenge_4_start_file_SOG_done.yxmd.png

 

Bennu
8 - Asteroid

Good RegEx practice!  Can't believe I actually figured them out.

 

Spoiler

(\d{1,2}\-[[:alpha:]]{3,10}\-\d{2,4})

([[:alpha:]]{3} \d{1,2},? ?\d{4})

 

There's also an interesting formula to figure out if the year  49 is 1949 or 2049... I treated it as 2049..

 

Spoiler

 

if substring(ReverseString([Date]),2,1) = '-' then

if ToNumber(ReverseString( left(ReverseString([Date]),2))) >50 then

ReverseString(
left( ReverseString([Date]),2) +'91' + Substring( ReverseString([Date]),2)
)
else
ReverseString(
left( ReverseString([Date]),2) +'02' + Substring( ReverseString([Date]),2) )
endif
else
[Date]

endif

Spoiler
WC_004.jpg

 

 

JBevan89
8 - Asteroid

my solution attached.  Great Challenge