Leetcode-Kotlin

Introduction

This repository is a collection of Leetcode solutions on Kotlin.

Content

Easy

#	Title
717	1-bit and 2-bit Characters
804	Unique Morse Code Words
929	Unique Email Addresses
653	Two Sum IV - Input is a BST
709	To Lower Case
404	Sum of Left Leaves
905	Sort Array By Parity
922	Sort Array By Parity II
700	Search in a Binary Search Tree
938	Range Sum of BST
883	Projection Area of 3D Shapes
762	Prime Number of Set Bits in Binary Representation
852	Peak Index in a Mountain Array
876	Middle of the Linked List
771	Jewels and Stones
897	Increasing Order Search Tree
832	Flipping an Image
744	Find Smallest Letter Greater Than Target
760	Find Anagram Mappings
448	Find All Numbers Disappeared in an Array
942	DI String Match
944	Delete Columns to Make Sorted
696	Count Binary Substrings
538	Convert BST to Greater Tree
606	Construct String from Binary Tree
961	N-Repeated Element in Size 2N Array
977	Squares of a Sorted Array
965	Univalued Binary Tree
509	Fibonacci Number
985	Sum of Even Numbers After Queries
933	Number of Recent Calls
821	Shortest Distance to a Character
872	Leaf-Similar Trees
908	Smallest Range I
1002	Find Common Characters
836	Rectangle Overlap
783	Minimum Distance Between BST Nodes
303	Range Sum Query - Immutable

Medium

#	Title
861	Score After Flipping Matrix
950	Reveal Cards In Increasing Order
763	Partition Labels
921	Minimum Add to Make Parentheses Valid
807	Max Increase to Keep City Skyline
701	Insert into a Binary Search Tree
515	Find Largest Value in Each Tree Row
890	Find and Replace Pattern
814	Binary Tree Pruning
797	All Paths From Source to Target
894	All Possible Full Binary Trees
399	Evaluate Division
328	Odd Even Linked List
16	3Sum Closest
147	Insertion Sort List
802	Find Eventual Safe States
59	Spiral Matrix II
162	Find Peak Element
56	Merge Intervals
831	Masking Personal Information
725	Split Linked List in Parts

Hard

#	Title
57	Insert Interval
446	Arithmetic Slices II - Subsequence
410	Split Array Largest Sum
51	N-Queens