Media.net Coding Interview Questions

Minimum Operations to Form Subsequence With Target Sum

You are given a 0-indexed array nums consisting of non-negative powers of 2, and an integer target.

Count the Number of Square-Free Subsets

You are given a positive integer 0-indexed array nums.

Maximum Genetic Difference Query

There is a rooted tree consisting of n nodes numbered 0 to n - 1. Each node's number denotes its unique genetic value (i.e. the genetic value of node x is x). T...

Scramble String

We can scramble a string s to get a string t using the following algorithm:

Maximum Value of an Ordered Triplet II

You are given a 0-indexed integer array nums.

Maximum Value of an Ordered Triplet I

You are given a 0-indexed integer array nums.

Make the XOR of All Segments Equal to Zero

You are given an array nums​​​ and an integer k​​​​​. The XOR of a segment [left, right] where left <= right is the XOR of all the elements with indices between...

Minimum Time Visiting All Points

On a 2D plane, there are n points with integer coordinates points[i] = [xi, yi]. Return the minimum time in seconds to visit all the points in the order given b...

Minimum XOR Sum of Two Arrays

You are given two integer arrays nums1 and nums2 of length n.

Queens That Can Attack the King

On a 0-indexed 8 x 8 chessboard, there can be multiple black queens and one white king.

Furthest Building You Can Reach

You are given an integer array heights representing the heights of buildings, some bricks, and some ladders.

Difference Between Maximum and Minimum Price Sum

There exists an undirected and initially unrooted tree with n nodes indexed from 0 to n - 1. You are given the integer n and a 2D integer array edges of length...

Minimum Total Space Wasted With K Resizing Operations

You are currently designing a dynamic array. You are given a 0-indexed integer array nums, where nums[i] is the number of elements that will be in the array at...

Best Time to Buy and Sell Stock

You are given an array prices where prices[i] is the price of a given stock on the ith day.

Flatten Binary Tree to Linked List

Given the root of a binary tree, flatten the tree into a "linked list":

Substring with Concatenation of All Words

You are given a string s and an array of strings words. All the strings of words are of the same length.

Merge Two Sorted Lists

You are given the heads of two sorted linked lists list1 and list2.

Painting the Walls

You are given two 0-indexed integer arrays, cost and time, of size n representing the costs and the time taken to paint n different walls respectively. There ar...

Fizz Buzz

Given an integer n, return a string array answer (1-indexed) where:

Jump Game

You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length...

Number of Submatrices That Sum to Target

Given a matrix and a target, return the number of non-empty submatrices that sum to target.

Binary Search Tree Iterator

Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST):

The Number of Good Subsets

You are given an integer array nums. We call a subset of nums good if its product can be represented as a product of one or more distinct prime numbers.

Valid Sudoku

Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

Best Time to Buy and Sell Stock II

You are given an integer array prices where prices[i] is the price of a given stock on the ith day.

LRU Cache

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache.

Valid Phone Numbers

Given a text file file.txt that contains a list of phone numbers (one per line), write a one-liner bash script to print all valid phone numbers.

Minimize the Maximum Difference of Pairs

You are given a 0-indexed integer array nums and an integer p. Find p pairs of indices of nums such that the maximum difference amongst all the pairs is minimiz...

Longest Palindromic Substring

Given a string s, return the longest palindromic substring in s.

Majority Element

Given an array nums of size n, return the majority element.

Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

Search in Rotated Sorted Array

There is an integer array nums sorted in ascending order (with distinct values).

All O`one Data Structure

Design a data structure to store the strings' count with the ability to return the strings with minimum and maximum counts.

Sliding Window Maximum

You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see...

Sum of Distances in Tree

There is an undirected connected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.

Merge Intervals

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...