Amazon Coding Interview Question: First Missing Positive (Java Solution)
Amazon Coding Interview Question: First Missing Positive (Java Solution)
Not employed by dailycodingproblem.com, just a fan.
You can (and should) sign up to receive an email with a coding problem everyday here: https://www.dailycodingproblem.com
You can subscribe to my channel here: / @dailycodingproblem8346
Daily Coding Problem: Problem #4 [Hard]
Good morning! Here's your coding interview problem for today.
This problem was asked by Stripe.
Given an array of integers, find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can contain duplicates and negative numbers as well.
For example, the input [3, 4, -1, 1] should give 2. The input [1, 2, 0] should give 3.
You can modify the input array in-place.
Solution is optimized (runs in linear time and constant space)
In questa pagina del sito puoi guardare il video online Amazon Coding Interview Question: First Missing Positive (Java Solution) della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Daily Coding Problem 19 giugno 2020, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 205 volte e gli è piaciuto 4 spettatori. Buona visione!
