Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

Can you solve this real interview question? Fibonacci Number - The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is, F(0) = 0, F(1) = 1 F(n) = F(n - 1) + F(n - 2), for n > 1. Given n, calculate F(n).

Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

Can you solve this real interview question? Left and Right Sum Differences - You are given a 0-indexed integer array nums of size n. Define two arrays leftSum and rightSum where: * leftSum[i] is the sum of elements to the left of the index i in the array nums. If there is no such element, leftSum[i] = 0. * rightSum[i] is the sum of elements to the right of the index i in the array nums. If ...

150 Original & Classic Questions Covers comprehensive interview topics Best for 3+ months of prep time Problems support high-quality editorials

Custom Judge: The judge will test your solution with the following code: int[] nums = [...]; // Input array int val = ...; // Value to remove int[] expectedNums = [...];

TinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-tinyurl and it returns a short URL such as …

Can you solve this real interview question? Find and Replace Pattern - Given a list of strings words and a string pattern, return a list of words[i] that match pattern. You may return the answer in any order. A word matches the pattern if there exists a permutation of letters p so that after replacing every letter x in the pattern with p(x), we get the desired word.

Can you solve this real interview question? Design Parking System - Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size. Implement the ParkingSystem class: * ParkingSystem(int big, int medium, int small) Initializes object of the ParkingSystem class.

Can you solve this real interview question? 3Sum Closest - Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.