Given a 2-d array matrix, return elements in spiral order starting from matrix[0][0].
Constraints
n, m ≤ 250 where n and m are the number of rows and columns in matrixhttps://binarysearch.com/problems/Spiral-Matrix
Input
[[ 6, 9, 8],
[ 1, 8, 0],
[ 5, 1, 2],
[ 8, 0, 3],
[ 1, 6, 4],
[ 8, 8,10]]
Output
[6, 9, 8, 0, 2, 3, 4, 10, 8, 8, 1, 8, 5, 1, 8, 1, 0, 6]Given a list of integers nums, remove numbers that appear multiple times in the list, while maintaining order of the appearance in the original list.
Given an integer k and a list of integers nums, return the length of the longest sublist that contains at most k distinct integers.
You are given lists of integers people, jobs, profits. Each person i in people have people[i] amount of strength, and performing job j requires jobs[j] amoun...
Given a list of integers nums and an integer target, return the number of triples i < j < k that exist such that nums[i] + nums[j] + nums[k] < target.
Leave a comment