KEMBAR78
Amazon List | PDF | String (Computer Science) | Algorithms And Data Structures
0% found this document useful (0 votes)
60 views4 pages

Amazon List

The document lists various coding problems categorized under Amazon Easy and Medium levels. Each problem includes tasks such as array manipulation, string processing, and data structure design. The problems range from basic operations like concatenation and shuffling to more complex challenges like finding palindromic substrings and implementing linked lists.

Uploaded by

Murlidher Mourya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
60 views4 pages

Amazon List

The document lists various coding problems categorized under Amazon Easy and Medium levels. Each problem includes tasks such as array manipulation, string processing, and data structure design. The problems range from basic operations like concatenation and shuffling to more complex challenges like finding palindromic substrings and implementing linked lists.

Uploaded by

Murlidher Mourya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

SL NO AMAZON EASY:

1) Concatenation of Array
2) Shuffle the Array
3) Design Parking System
4) Find the Maximum Achievable Number
5) Kids With the Greatest Number of Candies
6) Add Two Integers
7) Function Composition
8) Running Sum of 1d Array
9) Shuffle String
10) Create Hello World Function
11) Counter
12) Merge Strings Alternately
13) Find First Palindromic String in the Array
14) Find the Difference of Two Arrays
15) Array Partition
16) Count Negative Numbers in a Sorted Matrix
17) Reverse String
18) Middle of the Linked List
19) Counting Bits
20) Binary Tree Inorder Traversal
21) Reverse Linked List
22) Unique Number of Occurrences
23) Number of Recent Calls
24) Array Prototype Last
25) Make Array Zero by Subtracting Equal Amounts
26) Pascal's Triangle
27) Next Greater Element
28) Intersection of Two Arrays
29) The K Weakest Rows in a Matrix
30) Fizz Buzz
31) Find Common Characters
32) Last Stone Weight
33) Majority Element
34) Min Cost Climbing Stairs
35) Average Salary Excluding the Minimum and Maximum Salary
36) Valid Anagram
37) Merge Two Sorted Lists
38) Flood Fill
39) Excel Sheet Column Number
40) Relative Ranks
41) Move Zeroes
42) Contains Duplicate
43) Complement of Base 10 Integer
44) Same Tree
45) Roman to Integer
46) Ransom Note
47) Diameter of Binary Tree
48) Largest Odd Number in String
49) Sum of Left Leaves
50) Kth Largest Element in a Stream
51) Binary Search
52) Find Pivot Index
53) Happy Number
54) Cousins in Binary Tree
55) Symmetric Tree
56) Palindrome Number
57) Remove Element
58) Best Time to Buy and Sell Stock
59) Greatest Common Divisor of Strings
60) Remove Duplicates from Sorted Array
61) Add Binary
62) Climbing Stairs
63) Remove Duplicates from Sorted List
64) Find Smallest Letter Greater Than Target
65) Palindrome Linked List
66) Check if Array Is Sorted and Rotated
67) Two Sum
68) Balanced Binary Tree
69) Linked List Cycle
70) Merge Sorted Array
71) Remove Linked List Elements
72) Subtree of Another Tree
73) Power of Two
74) Search Insert Position
75) Plus One
76) First Bad Version
77) Contains Duplicate II
78) Longest Common Prefix
79) Valid Parentheses
80) Check If It Is a Straight Line

81) Find the Index of the First Occurrence in a String


82) Valid Palindrome II
83) Sqrt(x)
84) Determine the Winner of a Bowling Game

AMAZON: MEDIUM
85) myAtoi(string s)
86) Given a signed 32-bit integer x, return x with its digits reversed. If
reversing x causes the value to go outside the signed 32-bit integer range [-
231, 231 - 1], then return 0.

87) Design your implementation of the linked list. You can choose to use a singly or
doubly linked list.

88) You are given a 0-indexed integer array nums of size n representing the cost of
collecting different chocolates. The cost of collecting the chocolate at the
index i is nums[i]. Each chocolate is of a different type, and initially, the
chocolate at the index i is of ith type

89) Given the root of a binary tree, determine if it is a valid binary search tree
(BST).

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


91) Given an integer array nums, return all the triplets [nums[i], nums[j],
nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] +
nums[k] == 0.

92) Given an integer n, return the number of prime numbers that are strictly less
than n.

93) Implement pow(x, n), which calculates x raised to the power n (i.e., x ) n
94)
95)
96)
97)
98)
99)
100)
101)
102)
103)
104)
105)

You might also like