Try to solve Java Leetcode and Codility problems
- Missing Number: The problem is to find the smallest positive integer that does not occur in a given array (Lesson 4 – Counting Elements) 100% correct - 100% performance #Java
- Count XY: Given a string, count the number of substring (of 2) that have equal number of 'x' and 'y' on both side. If one side has 0 of 'x' and 'y', the case is also valid. #Java
- Reverse Linked List: Given the head of a singly linked list, reverse the list, and return the reversed list. (100% performance, 5.6% memory) #Go