query: Finding the smallest integer which is not in an array
positive_passages.docid: 18795
positive_passages.text: Find the Smallest Integer Not in a List
negative_passages.docid: 41533
negative_passages.text: Finding three elements in an array whose sum is closest to a given number
negative_passages.docid: 30994
negative_passages.text: Increment a Python floating point value by the smallest possible amount
negative_passages.docid: 46692
negative_passages.text: Finding a single number in a list
negative_passages.docid: 89066
negative_passages.text: Find all integers less than $m$ that are relatively prime to it
negative_passages.docid: 6437
negative_passages.text: Binary Search in Array
negative_passages.docid: 82114
negative_passages.text: maximum subarray of an array with integers
negative_passages.docid: 119787
negative_passages.text: sorting integers in order lowest to highest java
negative_passages.docid: 155895
negative_passages.text: Trying to get lowest integers
negative_passages.docid: 59608
negative_passages.text: Comparing two integers without any comparison
negative_passages.docid: 102180
negative_passages.text: Rounding integers to nearest multiple of 10
negative_passages.docid: 64883
negative_passages.text: What is the most efficient algorithm to find the closest prime less than a given number $n$
negative_passages.docid: 66982
negative_passages.text: How does negative index work with `Array#[]=`?
negative_passages.docid: 17626
negative_passages.text: Algorithm: efficient way to remove duplicate integers from an array
negative_passages.docid: 55053
negative_passages.text: smallest number for given sum of digits
negative_passages.docid: 3822
negative_passages.text: finding closest value in an array
negative_passages.docid: 33199
negative_passages.text: Least value of an Expression?