LeetCode This repo created for algorithm problem solution Run on kotlin playground RomanToInt TwoSum SearchInsertPosition ContainDuplicate_II FirstOccurrence PlusOne