LeetCode 215. Kth Largest Element in an Array
Description https://leetcode.com/problems/kth-largest-element-in-an-array/ Find the kth largest element in an unsorted array. Note that it is the kth largest element in the…
LeetCode 162. Find Peak Element
Description https://leetcode.com/problems/find-peak-element/ A peak element is an element that is strictly greater than its neighbors. Given an integer array nums, find…
LeetCode 94. Binary Tree Inorder Traversal
Description https://leetcode.com/problems/binary-tree-inorder-traversal/ Given a binary tree, return the inorder traversal of its nodes’ values. Example: Input: [1,null,2,3] 1 \ 2 / 3…
LeetCode 334. Increasing Triplet Subsequence
Description https://leetcode.com/problems/increasing-triplet-subsequence/ Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.…
LeetCode 160. Intersection of Two Linked Lists
Description https://leetcode.com/problems/intersection-of-two-linked-lists/ Write a program to find the node at which the intersection of two singly linked lists begins. For…
LeetCode 328. Odd Even Linked List
Description https://leetcode.com/problems/odd-even-linked-list/ Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes…
LeetCode 73. Set Matrix Zeroes
Description https://leetcode.com/problems/set-matrix-zeroes/ Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place. Example…
LeetCode 1143. Longest Common Subsequence
Description https://leetcode.com/problems/longest-common-subsequence/ Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is…
LeetCode 55. Jump Game
Description https://leetcode.com/problems/jump-game/ Given an array of non-negative integers, you are initially positioned at the first index of the array. Each…
LeetCode 146. LRU Cache
Description https://leetcode.com/problems/lru-cache/ Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key) –…