Solution for the Leetcode problems in Kotlin.

All of the answers are my own solutions, and may or may not be optimized for the best space or time complexities. Although if I will find a better solution, I will replace them here. So the solutions present in this repository are best to my knowledge.

#	Title	Solution	Time	Space	Difficulty
1	Two Sum	Solution	O(n)	O(n)	Easy
2	Add Two Numbers	Solution	O(max(m,n))	O(max(m,n))	Medium
3	Longest Substring Without Repeating Characters	Solution	O(s.length)	O(size of character set)	Medium
4	Longest Palindromic Substring	Solution	O(n^2)	O(1)	Medium
14	Longest Common Prefix	Solution	TBD	TBD	Easy
20	Valid Parentheses	Solution	O(s.size)	O(s.size)	Easy
21	Merge Two Sorted Lists	Solution	O(m+n)	O(m+n)	Easy
25	Remove Duplicates from Sorted Array	Solution	O(nums.size)	O(1)	Easy
31	Next Permutation	Solution	O(n)	O(1)	Medium
33	Search In Rotated Sorted Array	Solution	O(Log N)	O(1)	Medium
34	Find First and Last Position of Element in Sorted Array	Solution	O(log n)	O(1)	Medium
35	Search Insert Position	Solution	O(log n)	TBD	Easy
53	Maximum Subarray	Solution	O(nums.size)	O(1)	Easy
56	Merge Intervals	Solution	TBD	TBD	Medium
57	Insert Interval	Solution	O(intervals.size)	O(intervals.size)	Medium
66	Plus One	Solution	O(digits.size)	O(digits.size)	Easy
67	Add Binary	Solution	O(max(a.length, b.length))	O(1)	Easy
88	Merge Sorted Array	Solution	O(m+n)	O(1)	Easy
94	Binary Tree Inorder Traversal	Solution	TBD	TBD	Easy
98	Validate Binary Search Tree	Solution	TBD	TBD	Medium
100	Same Tree	Solution	O(N)	avg. O(Log n), worst O(n)	Medium
102	Binary Tree Level Order Traversal	Solution	TBD	TBD	Medium
104	Maximum Depth Of Binary Tree	Solution	O(n)	avg. O(Log n), worst O(n)	Easy
107	Binary Tree Level Order Traversal 2	Solution	TBD	TBD	Medium
112	Path Sum	Solution	O(N)	O(log N)	Easy
114	Flatten Binary Tree To LinkedList	Solution	TBD	TBD	Medium
116	Populating Next Right Pointers in Each Node	Solution	O(n)	O(1)	Medium
121	Best Time to Buy and Sell Stock	Solution	O(n)	O(1)	Easy
125	Valid Palindrome	Solution	O(s.length)	O(1)	Easy
129	Sum Root To Leaf Numbers	Solution	O(N)	O(H)	Medium
145	Binary Tree Postorder Traversal	Solution	TBD	TBD	Easy
146	LRU Cache	Solution	O(1)	O(capacity)	Medium
162	Find Peak Element	Solution	O(log n)	O(1)	Medium
167	Two Sum 2 - Input Array is Sorted	Solution	O(n)	O(n)	Easy
199	Binary Tree Right Side View	Solution	TBD	TBD	Medium
200	Number of islands	Solution	O(rows*cols)	O(rows*cols)	Medium
207	Course Schedule	Solution	TBD	TBD	Medium
215	Kth Largest Element in an Array	Solution	O(n log k)	O(k)	Medium
226	Invert Binary Tree	Solution	O(n)	O(1)	Easy
235	Lowest Common Ancestor of a Binary Search Tree	Solution	O(N)	O(N)	Easy
236	Lowest Common Ancestor of a Binary Tree	Solution	O(N)	O(N)	Medium
242	Valid anagram	Solution	O(n)	O(1)	Easy
246	Strobogrammatic Number	Solution	O(n)	O(1)	Easy
252	Meeting Rooms	Solution	O(N Log N)	O(1)	Easy
253	Meeting Rooms II	Solution	O(n log n)	O(n)	Medium
257	Binary Tree Paths	Solution	TBD	TBD	Easy
266	Palindrome Permutation	Solution	TBD	TBD	Easy
270	Closest Binary Search Tree Value	Solution	TBD	TBD	Easy
278	First Bad Version	Solution	O(log n)	O(1)	Easy
283	Move Zeroes	Solution	TBD	TBD	Easy
314	Binary Tree Vertical Order Traversal	Solution	O(n log n)	O(n)	Medium
346	Moving Average from Data Stream	Solution	O(1)	O(n)	Easy
347	Top K Frequent Elements	Solution	O(n log k)	O(n)	Medium
366	Find Leaves of Binary Tree	Solution	TBD	TBD	Medium
415	Add Strings	Solution	O(Math.max(N1, N2))	O(Math.max(N1, N2))	Easy
426	Convert Binary Search Tree to Sorted Doubly Linked List	Solution	O(n)	O(n)	Medium
429	N-ary Tree Level Order Traversal	Solution	TBD	TBD	Medium
451	Sort Characters By Frequency	Solution	O(n log n)	O(n)	Medium
463	Island Perimeter	Solution	O(nm)	O(1)	Easy
485	Max Consecutive Ones	Solution	O(n)	O(1)	Easy
487	Max Consecutive Ones II	Solution	O(n)	O(1)	Medium
496	Next Greater Element I	Solution	O(n)	O(n)	Easy
498	Diagonal Traverse	Solution	O(r * c)	O(r * c)	Medium
503	Next Greater Element II	Solution	O(n)	O(n)	Medium
506	Relative Ranks	Solution	O(n log n)	O(n)	Easy
515	Find Largest Value in Each Tree Row	Solution	O(n)	O(n)	Medium
543	Diameter of Binary Tree	Solution	O(N)	O(N)	Easy
559	Maximum Depth of N-ary Tree	Solution	TBD	TBD	Easy
560	Subarray Sum Equals K	Solution	O(nums.size)	O(nums.size)	Medium
589	N-ary Tree Preorder Traversal	Solution	TBD	TBD	Easy
590	N-ary Tree Postorder Traversal	Solution	TBD	TBD	Easy
605	Can Place Flowers	Solution	O(n)	O(1)	Easy
680	Valid Palindrome II	Solution	TBD	TBD	Easy
695	Max area of island	Solution	O(row * col)	O(row * col)	Medium
704	Binary Search	Solution	O(log n)	O(1)	Easy
724	Find Pivot Index	Solution	O(n)	O(1)	Easy
739	Daily Temperatures	Solution	O(n)	O(n)	Medium
766	Toeplitz Matrix	Solution	O(m * n)	O(1)	Easy
791	Custom Sort String	Solution	O(n)	O(1)	Easy
863	All Nodes Distance K in Binary Tree	Solution	O(N)	O(N)	Medium
896	Monotonic Array	Solution	O(N)	O(1)	Easy
921	Minimum Add to Make Parentheses Valid	Solution	O(n)	O(n)	Medium
938	Range sum of BST	Solution	TBD	TBD	Easy
953	Verifying an Alien Dictionary	Solution	O(M)	O(1)	Easy
973	K Closest Points to Origin	Solution	O(n log n)	O(n)	Medium
1004	Max Consecutive Ones III	Solution	O(n)	O(1)	Medium
1046	Last Stone Weight	Solution	O(n log n)	O(n)	Easy
1047	Remove all adjacent duplicates in string	Solution	TBD	TBD	Easy
1056	Confusing number	Solution	O(n)	O(n)	Easy
1091	Shortest Path in Binary Matrix	Solution	TBD	TBD	Medium
1249	Minimum Remove to Make Valid Parentheses	Solution	O(N)	O(N)	Medium
1428	Leftmost Column with at Least a One	Solution	O(n long m)	O(1)	Medium
1448	Count Good Nodes in Binary Tree	Solution	O(N)	O(N)	Medium
1570	Dot Product of Two Sparse Vectors	Solution	O(L)	O(L)	Medium
1650	Lowest Common Ancestor of a Binary Tree III	Solution	O(h)	O(1)	Medium
1762	Buildings With an Ocean View	Solution	O(N)	O(N)	Medium