Companies Home Search Profile

Amazon Interview Questions - Data Structures & Algorithms

Focused View

Pratik Singhal

47:24:26

60 View
  • 1.1 best time to buy and sell a stock.zip
  • 1. Best Time To Buy And Sell A Stock - Java.mp4
    09:56
  • 2.1 best time to buy a sell a stock.zip
  • 2. Best Time To Buy And Sell A Stock - Javascript.mp4
    08:35
  • 3.1 best time to buy and sell a stock.zip
  • 3. Best Time To Buy And Sell A Stock - C++.mp4
    10:05
  • 4.1 best time to buy and sell a stock.zip
  • 4. Best Time To Buy And Sell A Stock - Python.mp4
    10:11
  • 1.1 maximum sum subarray.zip
  • 1. Maximum Sum Subarray - Java.mp4
    12:22
  • 2.1 maximum sum subarray.zip
  • 2. Maximum Sum Subarray - Javascript.mp4
    12:02
  • 3.1 maximum sum subarray.zip
  • 3. Maximum Sum Subarray - C++.mp4
    12:17
  • 4.1 maximum sum subarray.zip
  • 4. Maximum Sum Subarray - Python.mp4
    12:01
  • 1.1 move zeroes.zip
  • 1. Move Zeroes - Java.mp4
    10:09
  • 2.1 move zeroes.zip
  • 2. Move Zeroes - Javascript.mp4
    10:42
  • 3.1 move zeroes.zip
  • 3. Move Zeroes - C++.mp4
    11:04
  • 4.1 move zeroes.zip
  • 4. Move Zeroes - Python.mp4
    10:09
  • 1.1 maximum product subarray.zip
  • 1. Maximum Product Subarray - Java.mp4
    15:11
  • 2.1 maximum product subarray.zip
  • 2. Maximum Product Subarray - Javascript.mp4
    14:09
  • 3.1 maximum product subarray.zip
  • 3. Maximum Product Subarray - C++.mp4
    14:51
  • 4.1 maximum product subarray.zip
  • 4. Maximum Product Subarray - Python.mp4
    15:40
  • 1.1 product of array except self.zip
  • 1. Product Of Array Except Self - Java.mp4
    11:23
  • 2.1 product of array except self.zip
  • 2. Product Of Array Except Self - Javascript.mp4
    09:51
  • 3.1 product of array except self.zip
  • 3. Product Of Array Except Self - C++.mp4
    11:08
  • 4.1 product of array except self.zip
  • 4. Product Of Array Except Self - Python.mp4
    11:52
  • 1.1 rotate array.zip
  • 1. Rotate Array - Java.mp4
    09:12
  • 2.1 rotate array.zip
  • 2. Rotate Array - Javascript.mp4
    08:37
  • 3.1 rotate array.zip
  • 3. Rotate Array - C++.mp4
    08:46
  • 4.1 rotate array.zip
  • 4. Rotate Array - Python.mp4
    07:44
  • 1.1 trapping rain water.zip
  • 1. Trapping Rain Water - Java Solution.mp4
    06:40
  • 2.1 trapping rain water.zip
  • 2. Trapping Rain Water - Javascript Solution.mp4
    07:13
  • 3.1 trapping rain water.zip
  • 3. Trapping Rain Water - C++ Solution.mp4
    06:46
  • 4.1 trapping rain water.zip
  • 4. Trapping Rain Water - Python Solution.mp4
    07:13
  • 1.1 majority element.zip
  • 1. Majority Element - Java Solution.mp4
    10:26
  • 2.1 majority element.zip
  • 2. Majority Element - Javascript Solution.mp4
    10:12
  • 3.1 majority element.zip
  • 3. Majority Element - C++ Solution.mp4
    10:07
  • 4.1 majority element.zip
  • 4. Majority Element - Python Solution.mp4
    10:26
  • 1.1 single number.zip
  • 1. Single Number - Java Solution.mp4
    09:45
  • 2.1 single number.zip
  • 2. Single Number - Javascript Solution.mp4
    09:28
  • 3.1 single number.zip
  • 3. Single Number - C++ Solution.mp4
    09:44
  • 4.1 single number.zip
  • 4. Single Number - Python Solution.mp4
    09:43
  • 1.1 sort colors.zip
  • 1. Sort Colors - Java Solution.mp4
    12:13
  • 2.1 sort colors.zip
  • 2. Sort Colors - Javascript Solution.mp4
    12:28
  • 3.1 sort colors.zip
  • 3. Sort Colors - C++ Solution.mp4
    12:28
  • 4.1 sort colors.zip
  • 4. Sort Colors - Python Solution.mp4
    12:30
  • 1.1 find the duplicate number.zip
  • 1. Find the Duplicate Number - Java Solution.mp4
    09:41
  • 2.1 find the duplicate number.zip
  • 2. Find the Duplicate Number - Javascript Solution.mp4
    10:19
  • 3.1 find the duplicate number.zip
  • 3. Find the Duplicate Number - C++ Solution.mp4
    10:09
  • 4.1 find the duplicate number.zip
  • 4. Find the Duplicate Number - Python Solution.mp4
    09:28
  • 1.1 add two numbers.zip
  • 1. Add Two Numbers - Java Solution.mp4
    10:20
  • 2.1 add two numbers.zip
  • 2. Add Two Numbers - Javascript Solution.mp4
    09:19
  • 3.1 add two numbers.zip
  • 3. Add Two Numbers - C++ Solution.mp4
    10:09
  • 4.1 add two numbers.zip
  • 4. Add Two Numbers - Python Solution.mp4
    09:31
  • 1.1 find middle of the linked list.zip
  • 1. Find Middle Of Linked List - Java Solution.mp4
    06:06
  • 2. Find Middle Of Linked List - Javascript Solution.mp4
    05:49
  • 3.1 find middle of the linked list.zip
  • 3. Find Middle Of Linked List - C++ Solution.mp4
    06:02
  • 4.1 find middle of the linked list.zip
  • 4. Find Middle Of Linked List - Python Solution.mp4
    05:49
  • 1.1 intersection of two linked list.zip
  • 1. Intersection Of Two Linked List - Java Solution.mp4
    13:00
  • 2.1 intersection of two linked lists.zip
  • 2. Intersection Of Two Linked List - Javascript Solution.mp4
    12:16
  • 3.1 intersection of two linked list.zip
  • 3. Intersection Of Two Linked List - C++ Solution.mp4
    12:55
  • 4.1 intersection of two linked list.zip
  • 4. Intersection Of Two Linked List - Python Solution.mp4
    12:52
  • 1.1 linked list cycle.zip
  • 1. Linked List Cycle - Java Solution.mp4
    08:40
  • 2.1 linked list cycle.zip
  • 2. Linked List Cycle - Javascript Solution.mp4
    08:10
  • 3.1 linked list cycle.zip
  • 3. Linked List Cycle - C++ Solution.mp4
    08:48
  • 4.1 linked list cycle.zip
  • 4. Linked List Cycle - Python Solution.mp4
    09:43
  • 1. Merge Two Sorted Lists - Java Solution.mp4
    11:47
  • 2.1 merge two sorted lists.zip
  • 2. Merge Two Sorted Lists - Javascript Solution.mp4
    09:19
  • 3.1 merge two sorted list.zip
  • 3. Merge Two Sorted Lists - C++ Solution.mp4
    11:52
  • 4.1 merge two sorted list.zip
  • 4. Merge Two Sorted Lists - Python Solution.mp4
    12:07
  • 1.1 palindrome linked list.zip
  • 1. Palindrome Linked Lists - Java Solution.mp4
    18:44
  • 2.1 palindrome linked list.zip
  • 2. Palindrome Linked Lists - Javascript Solution.mp4
    11:37
  • 3.1 palindrome linked list.zip
  • 3. Palindrome Linked Lists - C++ Solution.mp4
    10:50
  • 4.1 palindrome linked list.zip
  • 4. Palindrome Linked Lists - Python Solution.mp4
    18:05
  • 1.1 reverse linked list.zip
  • 1. Reverse Linked List - Java Solution.mp4
    08:24
  • 2.1 reverse linked list.zip
  • 2. Reverse Linked List - Javascript Solution.mp4
    08:13
  • 3.1 reversed linked list.zip
  • 3. Reverse Linked List - C++ Solution.mp4
    09:00
  • 4.1 reversed linked list.zip
  • 4. Reverse Linked List - Python Solution.mp4
    08:05
  • 1.1 linked list cycle ii.zip
  • 1. Linked List Cycle II - Java Solution.mp4
    08:58
  • 2.1 linked list cycle ii.zip
  • 2. Linked List Cycle II - Javascript Solution.mp4
    08:23
  • 3.1 linked list cycle ii.zip
  • 3. Linked List Cycle II - C++ Solution.mp4
    09:00
  • 4.1 linked list cycle ii.zip
  • 4. Linked List Cycle II - Python Solution.mp4
    08:18
  • 1.1 min stack.zip
  • 1. Min Stack - Java Solution.mp4
    17:42
  • 2.1 min stack.zip
  • 2. Min Stack - Javascript Solution.mp4
    16:02
  • 3.1 min stack.zip
  • 3. Min Stack - C++ Solution.mp4
    16:41
  • 4.1 min stack.zip
  • 4. Min Stack - Python Solution.mp4
    15:56
  • 1.1 valid paranthesis.zip
  • 1. Valid Paranthesis - Java Solution.mp4
    10:28
  • 2.1 valid paranthesis.zip
  • 2. Valid Paranthesis - Javascript Solution.mp4
    08:54
  • 3.1 valid paranthesis.zip
  • 3. Valid Paranthesis - C++ Solution.mp4
    11:01
  • 4.1 valid paranthesis.zip
  • 4. Valid Paranthesis - Python Solution.mp4
    11:57
  • 1.1 merge intervals.zip
  • 1. Merge Intervals - Java Solution.mp4
    13:42
  • 2.1 merge intervals.zip
  • 2. Merge Intervals - Javascript Solution.mp4
    09:16
  • 3.1 merge intervals.zip
  • 3. Merge Intervals - C++ Solution.mp4
    10:08
  • 4.1 merge intervals.zip
  • 4. Merge Intervals - Python Solution.mp4
    07:52
  • 1.1 minimum add to make parantheses valid.zip
  • 1. Minimum Add To Make Parantheses Valid - Java Solution.mp4
    08:07
  • 2.1 minimum add to make parantheses valid.zip
  • 2. Minimum Add To Make Parantheses Valid - Javascript Solution.mp4
    08:35
  • 3.1 minimum add to make parantheses valid.zip
  • 3. Minimum Add To Make Parantheses Valid - C++ Solution.mp4
    08:03
  • 4.1 minimum add to make parantheses valid.zip
  • 4. Minimum Add To Make Parantheses Valid - Python Solution.mp4
    07:19
  • 1.1 sliding window maximum.zip
  • 1. Sliding Window Maximum - Java Solution.mp4
    22:41
  • 2.1 sliding window maximum.zip
  • 2. Sliding Window Maximum - Javascript Solution.mp4
    18:13
  • 3.1 sliding window maximum.zip
  • 3. Sliding Window Maximum - C++ Solution.mp4
    19:49
  • 4.1 sliding window maximum.zip
  • 4. Sliding Window Maximum - Python Solution.mp4
    20:42
  • 1.1 two sum.zip
  • 1. Two Sum - Java Solution.mp4
    10:54
  • 2.1 two sum.zip
  • 2. Two Sum - Javascript Solution.mp4
    09:26
  • 3.1 two sum.zip
  • 3. Two Sum - C++ Solution.mp4
    10:42
  • 4.1 two sum.zip
  • 4. Two Sum - Python Solution.mp4
    10:05
  • 1.1 group anagrams.zip
  • 1. Group Anagrams - Java Solution.mp4
    08:19
  • 2.1 group anagrams.zip
  • 2. Group Anagrams - Javascript Solution.mp4
    07:19
  • 3.1 group anagrams.zip
  • 3. Group Anagrams - C++ Solution.mp4
    10:46
  • 4. Group Anagrams - Python Solution.mp4
    07:20
  • 1.1 three sum.zip
  • 1. Three Sum - Java Solution.mp4
    25:03
  • 2.1 three sum.zip
  • 2. Three Sum - Javascript Solution.mp4
    17:28
  • 3.1 three sum.zip
  • 3. Three Sum - C++ Solution.mp4
    24:36
  • 4.1 three sum.zip
  • 4. Three Sum - Python Solution.mp4
    25:09
  • 1.1 search insert position.zip
  • 1. Search Insert Position - Java Solution.mp4
    14:13
  • 2.1 search insert position.zip
  • 2. Search Insert Position - Javascript Solution.mp4
    13:37
  • 3.1 search insert position.zip
  • 3. Search Insert Position - C++ Solution.mp4
    13:58
  • 4.1 search insert position.zip
  • 4. Search Insert Position - Python Solution.mp4
    13:36
  • 1.1 search in a rotated sorted array.zip
  • 1. Search In A Rotated Sorted Array - Java Solution.mp4
    16:12
  • 2.1 search in a rotated sorted array.zip
  • 2. Search In A Rotated Sorted Array - Javascript Solution.mp4
    16:24
  • 3.1 search in a rotated sorted array.zip
  • 3. Search In A Rotated Sorted Array - C++ Solution.mp4
    15:26
  • 4.1 search in a rotated sorted array.zip
  • 4. Search In A Rotated Sorted Array - Python Solution.mp4
    15:22
  • 1.1 two sum ii - input array is sorted.zip
  • 1. Two Sum II - Input Array Is Sorted - Java Solution.mp4
    13:39
  • 2.1 two sum ii input array is sorted.zip
  • 2. Two Sum II - Input Array Is Sorted - Javascript Solution.mp4
    10:27
  • 3.1 two sum ii - input array is sorted.zip
  • 3. Two Sum II - Input Array Is Sorted - C++ Solution.mp4
    13:32
  • 4.1 two sum ii - input array is sorted.zip
  • 4. Two Sum II - Input Array Is Sorted - Python Solution.mp4
    13:17
  • 1.1 find first and last position of element in sorted array.zip
  • 1. Find First And Last Position Of Element In Sorted Array - Java Solution.mp4
    10:37
  • 2.1 find first and last position of element in sorted array.zip
  • 2. Find First And Last Position Of Element In Sorted Array - Javascript Solution.mp4
    09:54
  • 3.1 find first and last position of element in sorted array.zip
  • 3. Find First And Last Position Of Element In Sorted Array - C++ Solution.mp4
    10:32
  • 4.1 find first and last position of element in sorted array.zip
  • 4. Find First And Last Position Of Element In Sorted Array - Python Solution.mp4
    10:29
  • 1.1 magnetic force between two balls.zip
  • 1. Magnetic Force Between Two Balls - Java Solution.mp4
    18:01
  • 2.1 magnetic force between two balls.zip
  • 2. Magnetic Force Between Two Balls - Javascript Solution.mp4
    18:22
  • 3.1 magnetic force between two balls.zip
  • 3. Magnetic Force Between Two Balls - C++ Solution.mp4
    18:01
  • 4.1 magnetic force between two balls.zip
  • 4. Magnetic Force Between Two Balls - Python Solution.mp4
    17:23
  • 1.1 binary tree inorder traversal.zip
  • 1. Binary Tree InOrder Traversal - Java Solution.mp4
    02:53
  • 2.1 binary tree inorder traversal.zip
  • 2. Binary Tree InOrder Traversal - Javascript Solution.mp4
    01:26
  • 3.1 binary tree inorder traversal.zip
  • 3. Binary Tree InOrder Traversal - C++ Solution.mp4
    03:47
  • 4.1 binary tree inorder traversal.zip
  • 4. Binary Tree InOrder Traversal - Python Solution.mp4
    03:23
  • 1.1 diameter of a binary tree.zip
  • 1. Diameter Of A Binary Tree - Java Solution.mp4
    13:58
  • 2.1 diameter of a binary tree.zip
  • 2. Diameter Of A Binary Tree - Javascript Solution.mp4
    12:40
  • 3.1 diameter of a binary tree.zip
  • 3. Diameter Of A Binary Tree - C++ Solution.mp4
    14:07
  • 4.1 diameter of a binary tree.zip
  • 4. Diameter Of A Binary Tree - Python Solution.mp4
    13:22
  • 1.1 invert binary tree.zip
  • 1. Invert Binary Tree - Java Solution.mp4
    04:50
  • 2.1 invert binary tree.zip
  • 2. Invert Binary Tree - Javascript Solution.mp4
    05:12
  • 3.1 invert binary tree.zip
  • 3. Invert Binary Tree - C++ Solution.mp4
    05:02
  • 4.1 invert binary tree.zip
  • 4. Invert Binary Tree - Python Solution.mp4
    05:21
  • 1.1 maximum depth of a binary tree.zip
  • 1. Maximum Depth Of A Binary Tree - Java Solution.mp4
    08:17
  • 2.1 maximum depth of a binary tree.zip
  • 2. Maximum Depth Of A Binary Tree - Javascript Solution.mp4
    08:17
  • 3.1 maximum depth of a binary tree.zip
  • 3. Maximum Depth Of A Binary Tree - C++ Solution.mp4
    08:52
  • 4.1 maximum depth of a binary tree.zip
  • 4. Maximum Depth Of A Binary Tree - Python Solution.mp4
    09:11
  • 1.1 symmetric tree.zip
  • 1. Symmetric Tree - Java Solution.mp4
    07:57
  • 2.1 symmetric tree.zip
  • 2. Symmetric Tree - Javascript Solution.mp4
    07:26
  • 3.1 symmetric tree.zip
  • 3. Symmetric Tree - C++ Solution.mp4
    07:24
  • 4.1 symmetric tree.zip
  • 4. Symmetric Tree - Python Solution.mp4
    07:17
  • 1.1 binary tree level order traversal.zip
  • 1. Binary Tree Level Order Traversal - Java Solution.mp4
    10:23
  • 2.1 binary tree level order traversal.zip
  • 2. Binary Tree Level Order Traversal - Javascript Solution.mp4
    07:23
  • 3.1 binary tree level order traversal.zip
  • 3. Binary Tree Level Order Traversal - C++ Solution.mp4
    08:39
  • 4.1 binary tree level order traversal.zip
  • 4. Binary Tree Level Order Traversal - Python Solution.mp4
    08:22
  • 1.1 lowest common ancestor of a binary search tree.zip
  • 1. Lowest Common Ancestor of a Binary Tree - Java Solution.mp4
    06:23
  • 2.1 lowest common ancestor of a binary tree.zip
  • 2. Lowest Common Ancestor of a Binary Tree - Javascript Solution.mp4
    05:28
  • 3.1 lowest common ancestor of a binary tree.zip
  • 3. Lowest Common Ancestor of a Binary Tree - C++ Solution.mp4
    05:40
  • 4.1 lowest common ancestor of a binary tree.zip
  • 4. Lowest Common Ancestor of a Binary Tree - Python Solution.mp4
    05:30
  • 1.1 path sum.zip
  • 1. Path Sum - Java Solution.mp4
    08:59
  • 2.1 path sum.zip
  • 2. Path Sum - Javascript Solution.mp4
    07:57
  • 3.1 path sum.zip
  • 3. Path Sum - C++ Solution.mp4
    10:29
  • 4.1 path sum.zip
  • 4. Path Sum - Python Solution.mp4
    08:25
  • 1.1 kth largest element in an array.zip
  • 1. Kth Largest Element In An Array - Java Solution.mp4
    09:52
  • 2.1 kth largest element in an array.zip
  • 2. Kth Largest Element In An Array - Javascript Solution.mp4
    08:35
  • 3.1 kth largest element in an array.zip
  • 3. Kth Largest Element In An Array - C++ Solution.mp4
    11:29
  • 4.1 kth largest element in an array.zip
  • 4. Kth Largest Element In An Array - Python Solution.mp4
    11:02
  • 1.1 find median from data stream.zip
  • 1. Find Median from Data Stream - Java Solution.mp4
    14:38
  • 2.1 find median from data stream.zip
  • 2. Find Median from Data Stream - Javascript Solution.mp4
    14:03
  • 3.1 find median from data stream.zip
  • 3. Find Median from Data Stream - C++ Solution.mp4
    14:50
  • 4.1 find median from data stream.zip
  • 4. Find Median from Data Stream - Python Solution.mp4
    15:30
  • 1.1 kth smallest element in bst.zip
  • 1. Kth Smallest Element In BST - Java Solution.mp4
    06:32
  • 2.1 kth smallest element in bst.zip
  • 2. Kth Smallest Element In BST - Javascript Solution.mp4
    06:08
  • 3.1 kth smallest element in bst.zip
  • 3. Kth Smallest Element In BST - C++ Solution.mp4
    06:18
  • 4.1 kth smallest element in bst.zip
  • 4. Kth Smallest Element In BST - Python Solution.mp4
    06:31
  • 1.1 climbing stairs.zip
  • 1. Climbing Stairs - Java Solution.mp4
    16:41
  • 2.1 climbing stairs.zip
  • 2. Climbing Stairs - Javascript Solution.mp4
    15:17
  • 3.1 climbing stairs.zip
  • 3. Climbing Stairs - C++ Solution.mp4
    17:38
  • 4.1 climbing stairs.zip
  • 4. Climbing Stairs - Python Solution.mp4
    16:02
  • 1.1 01 matrix.zip
  • 1. 0-1 Matrix - Java Solution.mp4
    17:47
  • 2.1 01 matrix.zip
  • 2. 0-1 Matrix - Javascript Solution.mp4
    11:12
  • 3.1 01 matrix.zip
  • 3. 0-1 Matrix - C++ Solution.mp4
    15:18
  • 4.1 01 matrix.zip
  • 4. 0-1 Matrix - Python Solution.mp4
    17:37
  • 1.1 coin change.zip
  • 1. Coin Change - Java Solution.mp4
    16:24
  • 2.1 coin change.zip
  • 2. Coin Change - Javascript Solution.mp4
    13:14
  • 3.1 coin change.zip
  • 3. Coin Change - C++ Solution.mp4
    17:31
  • 4.1 coin change.zip
  • 4. Coin Change - Python Solution.mp4
    15:41
  • 1.1 house robber.zip
  • 1. House Robber - Java Solution.mp4
    12:09
  • 2.1 house robber.zip
  • 2. House Robber - Javascript Solution.mp4
    14:07
  • 3.1 house robber.zip
  • 3. House Robber - C++ Solution.mp4
    12:18
  • 4.1 house robber.zip
  • 4. House Robber - Python Solution.mp4
    11:33
  • 1.1 jump game.zip
  • 1. Jump Game - Java Solution.mp4
    13:07
  • 2.1 jump game.zip
  • 2. Jump Game - Javascript Solution.mp4
    13:46
  • 3.1 jump game.zip
  • 3. Jump Game - C++ Solution.mp4
    13:17
  • 4.1 jump game.zip
  • 4. Jump Game - Python Solution.mp4
    13:16
  • 1.1 longest common subsequence.zip
  • 1. Longest Common Subsequence - Java Solution.mp4
    15:11
  • 2.1 longest common subsequence.zip
  • 2. Longest Common Subsequence - Javascript Solution.mp4
    13:36
  • 3.1 longest common subsequence.zip
  • 3. Longest Common Subsequence - C++ Solution.mp4
    20:36
  • 4.1 longest common subsequence.zip
  • 4. Longest Common Subsequence - Python Solution.mp4
    14:59
  • 1.1 longest consecutive sequence.zip
  • 1. Longest Consecutive Sequence - Java Solution.mp4
    11:43
  • 2.1 longest consecutive sequence.zip
  • 2. Longest Consecutive Sequence - Javascript Solution.mp4
    11:33
  • 3.1 longest consecutive sequence.zip
  • 3. Longest Consecutive Sequence - C++ Solution.mp4
    11:58
  • 4.1 longest consecutive sequence.zip
  • 4. Longest Consecutive Sequence - Python Solution.mp4
    11:52
  • 1.1 longest increasing subsequence.zip
  • 1. Longest Increasing Subsequence - Java Solution.mp4
    13:34
  • 2.1 longest increasing subsequence.zip
  • 2. Longest Increasing Subsequence - Javascript Solution.mp4
    13:26
  • 3.1 longest increasing subsequence.zip
  • 3. Longest Increasing Subsequence - C++ Solution.mp4
    12:40
  • 4.1 longest increasing subsequence.zip
  • 4. Longest Increasing Subsequence - Python Solution.mp4
    13:19
  • 1.1 longest substring without repeating characters.zip
  • 1. Longest Substring Without Repeating Characters - Java Solution.mp4
    13:48
  • 2.1 longest substring without repeating characters.zip
  • 2. Longest Substring Without Repeating Characters - Javascript Solution.mp4
    13:41
  • 3.1 longest substring without repeating characters.zip
  • 3. Longest Substring Without Repeating Characters - C++ Solution.mp4
    12:55
  • 4.1 longest substring without repeating characters.zip
  • 4. Longest Substring Without Repeating Characters - Python Solution.mp4
    13:34
  • 1.1 partition equal subset sum.zip
  • 1. Partition Equal Subset Sum - Java Solution.mp4
    13:48
  • 2.1 partition equal subset sum.zip
  • 2. Partition Equal Subset Sum - Javascript Solution.mp4
    14:05
  • 3.1 partition equal subset sum.zip
  • 3. Partition Equal Subset Sum - C++ Solution.mp4
    13:16
  • 4.1 partition equal subset sum.zip
  • 4. Partition Equal Subset Sum - Python Solution.mp4
    12:29
  • 1.1 target sum.zip
  • 1. Target Sum - Java Solution.mp4
    17:15
  • 2.1 target sum.zip
  • 2. Target Sum - Javascript Solution.mp4
    14:02
  • 3.1 target sum.zip
  • 3. Target Sum - C++ Solution.mp4
    16:09
  • 4.1 target sum.zip
  • 4. Target Sum - Python Solution.mp4
    16:46
  • 1.1 flood fill.zip
  • 1. Flood Fill - Java Solution.mp4
    06:09
  • 2.1 flood fill.zip
  • 2. Flood Fill - Javascript Solution.mp4
    05:39
  • 3.1 flood fill.zip
  • 3. Flood Fill - C++ Solution.mp4
    05:48
  • 4.1 flood fill.zip
  • 4. Flood Fill - Python Solution.mp4
    06:12
  • 1.1 course schedule.zip
  • 1. Course Schedule - Java Solution.mp4
    14:46
  • 2.1 course schedule.zip
  • 2. Course Schedule - Javascript Solution.mp4
    10:13
  • 3.1 course schedule.zip
  • 3. Course Schedule - C++ Solution.mp4
    12:55
  • 4.1 course schedule.zip
  • 4. Course Schedule - Python Solution.mp4
    14:14
  • 1.1 network delay time.zip
  • 1. Network Delay Time - Java Solution.mp4
    07:53
  • 2.1 network delay time.zip
  • 2. Network Delay Time - Javascript Solution.mp4
    06:55
  • 3.1 network delay time.zip
  • 3. Network Delay Time - C++ Solution.mp4
    07:47
  • 4.1 network delay time.zip
  • 4. Network Delay Time - Python Solution.mp4
    06:56
  • 1.1 number of islands.zip
  • 1. Number Of Islands - Java Solution.mp4
    13:39
  • 2.1 number of islands.zip
  • 2. Number Of Islands - Javascript Solution.mp4
    11:44
  • 3. Number Of Islands - C++ Solution.mp4
    14:32
  • 4.1 number of islands.zip
  • 4. Number Of Islands - Python Solution.mp4
    13:35
  • 1.1 surrounded region.zip
  • 1. Surrounded Regions - Java Solution.mp4
    16:58
  • 2.1 surrounded regions.zip
  • 2. Surrounded Regions - Javascript Solution.mp4
    12:47
  • 3.1 surrounded region.zip
  • 3. Surrounded Regions - C++ Solution.mp4
    13:01
  • 4.1 surrounded regions.zip
  • 4. Surrounded Regions - Python Solution.mp4
    13:00
  • 1.1 combination sum.zip
  • 1. Combination Sum - Java Solution.mp4
    11:55
  • 2.1 combination sum.zip
  • 2. Combination Sum - Javascript Solution.mp4
    12:25
  • 3.1 combination sum.zip
  • 3. Combination Sum - C++ Solution.mp4
    12:55
  • 4.1 combination sum.zip
  • 4. Combination Sum - Python Solution.mp4
    11:49
  • 1.1 subsets.zip
  • 1. Subsets - Java Solution.mp4
    11:24
  • 2.1 subsets.zip
  • 2. Subsets - Javascript Solution.mp4
    08:12
  • 3.1 subsets.zip
  • 3. Subsets - C++ Solution.mp4
    08:44
  • 4.1 subsets.zip
  • 4. Subsets - Python Solution.mp4
    08:33
  • 1.1 counting bits.zip
  • 1. Counting Bits - Java Solution.mp4
    10:52
  • 2.1 counting bits.zip
  • 2. Counting Bits - Javascript Solution.mp4
    10:04
  • 3.1 counting bits.zip
  • 3. Counting Bits - C++ Solution.mp4
    11:43
  • 4.1 counting bits.zip
  • 4. Counting Bits - Python Solution.mp4
    10:45
  • Description


    Learn top questions asked in Amazon coding rounds

    What You'll Learn?


    • Software Developers Preparing for Amazon Coding Interviews
    • Developers who want to work as software developers at Amazon
    • Software developers who want to practice Leetcode questions asked in Amazon Interviews
    • Software developers who want to practice leetcode problems in Java, Javascript, C++ or Python languages.

    Who is this for?


  • Basic programming experieThis course is for software developers and students who want to practice for coding interviews at Amazon, in either of the 4 languages: Java, JavaScript, C++ & Python
  • What You Need to Know?


  • Basic programming experience in any of the 4 languages: Java, JavaScript, C++ & Python
  • More details


    Description

    Are you determined to secure a coveted position as a software engineer at Amazon? Prepare and excel in your Amazon coding interviews with confidence by enrolling in my comprehensive course. This course is laser-focused on the top problems commonly asked during Amazon interview rounds.


    What You'll Learn:

    • Top Amazon Interview Problems: I've carefully curated a collection of the most frequently asked coding problems in Amazon interviews, ensuring you're thoroughly prepared for any challenge that comes your way.

    • Step-by-Step Video Solutions: In my detailed video solutions, I guide you through each problem, step by step. You'll witness the entire problem-solving process, from understanding the problem's nuances to writing clean, efficient code. I code live in the recorded video solutions, enabling you to follow along and gain a deep understanding of the concepts.

    • Multiple Programming Languages: Recognizing that candidates have different language preferences, I provide video solutions in four popular programming languages: Java, C++, Python, and JavaScript. Choose the language you're most comfortable with and master these problems with ease.

    • Downloadable Code Files: In addition to video solutions, I offer downloadable code files for every problem. This allows you to dissect and analyze the code at your own pace, ensuring a thorough comprehension of each solution.

    Why Choose My Course:

    • Expert Guidance: Learn from an experienced software engineer with a proven track record of acing Amazon coding interviews. Benefit from my insights, strategies, and effective problem-solving techniques honed through years of experience.

    • Comprehensive Coverage: I leave no stone unturned. My course comprehensively covers a wide range of data structure problems that frequently appear in Amazon interviews, providing you with a well-rounded preparation.

    • Multilingual Support: My course is accessible to learners worldwide, as I provide video solutions in four different languages. This flexibility ensures that you can understand and implement solutions comfortably in your preferred programming language.

    Don't miss out on this opportunity to excel in your Amazon coding interviews. Enroll now and take the first step toward securing your dream job at Amazon!

    Who this course is for:

    • Basic programming experieThis course is for software developers and students who want to practice for coding interviews at Amazon, in either of the 4 languages: Java, JavaScript, C++ & Python

    User Reviews
    Rating
    0
    0
    0
    0
    0
    average 0
    Total votes0
    Focused display
    Pratik Singhal
    Pratik Singhal
    Instructor's Courses
    Hi, I am Pratik! I am really passionate about teaching software development, data structures, programming. I have taught over 1000 students live on multiple topics related to coding interview, software development etc.Apart from teaching people, I also work at Amazon as a Senior software engineer and contribute to open source in my free time.
    Students take courses primarily to improve job-related skills.Some courses generate credit toward technical certification. Udemy has made a special effort to attract corporate trainers seeking to create coursework for employees of their company.
    • language english
    • Training sessions 248
    • duration 47:24:26
    • Release Date 2023/11/13