LeetCode 895. Maximum Frequency Stack
Description https://leetcode.com/problems/maximum-frequency-stack/ Implement FreqStack, a class which simulates the operation of a stack-like data structure. FreqStack has two functions: push(int x), which…
Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/maximum-frequency-stack/ Implement FreqStack, a class which simulates the operation of a stack-like data structure. FreqStack has two functions: push(int x), which…
Description https://leetcode.com/problems/second-highest-salary/ Write a SQL query to get the second highest salary from the Employee table. +—-+——–+ | Id | Salary |…
Total 68 questions. Introduction Top interview questions asked by Amazon as voted by the community. LeetCode compiled this list thoroughly…
Description https://leetcode.com/problems/maximum-product-subarray/ Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has…
Description https://leetcode.com/problems/peak-index-in-a-mountain-array/ Let’s call an array arr a mountain if the following properties hold: arr.length >= 3 There exists some i with 0 < i < arr.length -…
Description https://leetcode.com/problems/unique-email-addresses/ Every email consists of a local name and a domain name, separated by the @ sign. For example,…
Description https://leetcode.com/problems/missing-ranges/ We have a list of points on the plane. Find the K closest points to the origin (0, 0). (Here, the distance between…
Description https://leetcode.com/problems/missing-ranges/ You are given an inclusive range [lower, upper] and a sorted unique integer array nums, where all elements are in the inclusive range.…
Total 85 questions. Introduction Google tech interviews are notoriously difficult and quite challenging. To get a phone screen, you will…
Description https://leetcode.com/problems/majority-element/ Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊…