I used bitwise to solve the solution. it clearly meets the tests provided and also is not thatsimliar to the said dulicate...

• Author's solution is wrong
• No random tests
• Duplicate: https://www.codewars.com/kata/hex-to-decimal

I suppose "different enough" is subjective, but if the concept and task are simple, there's a high likelihood that it's a duplicate. With the number of available katas closely approaching 8000, it's becoming nigh impossible to come up with a unique 7 or 8 kyu.

I even wrote a kata addressing this matter.

I believe I published about 3 or 4 duplicates to my own kata. This site has loading problems... I did not see any direct dupliations when I search, there was slight simliaritiy but I made it different??

the duplicate was mine as this site has loading problems. I wasnt sure what the inital setup was (and was playing around with the tests at that point) I can add random tests laters but its just a introductory RegExp exercise so if there any need?

And the test assertions in the initial setup are wrong, they expect true for urls not ending with ".com"

You just published an exact duplicate to your own kata (including the duplicate issues), which is already a duplicate of others.

Essential reading for new authors: https://github.com/codingforeveryone/READMEs/blob/master/codewars/writing-your-own-kata.md

Many issues with this one, but the most prominent would be that it's a duplicate (in the sense that you just have to check if a string ends with a specific substring).

Other issues:

• initial setup has the test assertions where the user's code goes
• no random tests

Please keep these things in mind when you think about writing your next kata.

This regexp simply doesn't work properly.
For some cases it returns wrong word order, for some doesn't remove all the duplicates (1 symbol words, for example).
You should analyze input, expected output and your result.
Random cases may be tougher than basic.