PayPal Interview Questions

Convert a given string into a zigzag pattern with a specified number of rows. Then read the characters row by row to return the converted string.

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Determine if a given word can be constructed from letters in a 2D board, where letters can be used horizontally or vertically. Each letter can only be used once in the word.

You are given an array of strings. Determine how many strings within given ranges start and end with a vowel.

You are given an array of integers. Determine the minimum number of operations needed to sort the array in non-decreasing order, where each operation involves replacing an element with one or more elements that sum to the original value.

Determine how many strings within a given array start and end with vowel letters, considering only a specified index range.

You are given a list of people's available time slots and a meeting duration. Find the earliest time slot that works for all participants to hold the meeting.

You're given a list of words and a string of characters. Determine which words can be fully formed using only the characters from the given string, and return the sum of their lengths.

Given a grid representing land and water, count the number of distinct islands. An island is formed by connected land cells.

Determine the minimum time required to rearrange a binary string such that all 0s precede all 1s. Each second, adjacent '01' pairs can be swapped.

You are given a range of numbers and a set of banned numbers. Find the maximum number of integers you can choose from the range, excluding the banned ones.

On a chessboard, you are given the starting positions of several chess pieces. Determine the number of valid combinations of moves for all pieces to reach their specified destinations, ensuring no two pieces occupy the same square at any point during the moves.

Find the maximum score of a subarray based on the frequency of its elements. The score is calculated using a specific formula involving the most frequent element's count.

Given an integer p, you can create an array of 2^p elements. The goal is to minimize the non-zero product of all elements in this array after performing specific modifications to its values.

You're given a range of numbers and a set of banned numbers. Determine the maximum number of integers you can choose from the allowed range such that their sum doesn't exceed a given limit.

You are given an array of numbers and a series of requests for ranges within the array. Find the permutation of the numbers that maximizes the total sum of the requested ranges.

Given an array of integers, determine how many pairs of numbers in the array have a product that is divisible by a given integer k. Count all such pairs and return the total.

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

Imagine you're painting houses in a row, but with restrictions on color choices and neighborhood formations. Find the minimum cost to paint all houses while achieving a target number of neighborhoods.

Given two digits, find the smallest multiple of a given integer that can be formed using only those two digits.