Coding
1 sections, 10 questions
Given a matrix where each row is sorted in ascending order and each column is sorted in ascending order, find whether a given number exists in the matrix.
Example:
Input:
matrix = [
[1, 4, 7, 11],
[2, 5, 8, 12],
[3, 6, 9, 16],
[10, 13, 14, 17]
], target = 5
Output: true
Design a stack that supports push, pop, and getMax in O(1) amortized time, using only one stack (not two).
Given the heads of two singly linked lists, find the node where the two lists intersect. Return null if they do not intersect.
Write code to reverse a given string in place.
Given an array of integers and a target, return the indices of the two numbers that add up to the target.
Example:
Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]
Find the contiguous subarray with the largest sum in an array of integers.
Example:
Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6
Given a 2D grid of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and formed by connecting adjacent lands horizontally or vertically.
Example:
Input:
11110
11010
11000
00000
Output: 1
Given the head of a linked list, determine if it contains a cycle.
Given a string containing just (, ), {, }, [, ], determine if the input string has valid matching and nesting of brackets.
Example:
Input: "()[]{}"
Output: true
Input: "(]"
Output: false
Find the kth largest element in an unsorted array.
Example:
Input: nums = [3, 2, 1, 5, 6, 4], k = 2
Output: 5