Meta | E5 | US | March 2025 [Reject]

Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found in the array, return [-1, -1]. You must write an algorithm with O(log n) runtime complexity.

Given a reference of a node in a connected undirected graph, return a deep copy (clone) of the graph. Each node in the graph contains a value (int) and a list (List[Node]) of its neighbors.

Given an integer array nums and an integer k, return the kth largest element in the array. Note that it is the kth largest element in the sorted order, not the kth distinct element. You must solve it in O(n) time complexity.

Given a string s, return true if the s can be palindrome after deleting at most one character from it.

Given the root of a binary tree, calculate the vertical order traversal of the tree. For each node at (row, col) position, its left child will be at (row + 1, col - 1) and its right child will be at (row + 1, col + 1). The vertical traversal of a binary tree is a list of lists of node values, where each inner list contains the node values in a specific vertical order. Nodes within the same row and column should be sorted by their values.

Given a string s and an integer k, return true if s is a k-palindrome. A string is a k-palindrome if it can be transformed into a palindrome by deleting at most k characters from it.

There are n buildings in a line. You are given an integer array heights of size n where heights[i] is the height of the ith building. A building has an ocean view if all the buildings to its right have a smaller height. Return a list of the indices (0-indexed) of buildings that have an ocean view, sorted in increasing order.

Design a system to handle live comments, as detailed in the provided resource.