Given an array a that contains only numbers in the range from 1 to a.length, find the first duplicate number for which the second occurrence has the minimal index. In other words, if there are more than 1 duplicated numbers, return the number for which the second occurrence has a smaller index than the second occurrence of the other number does. If there are no such elements, your program / function may result in undefined behaviour.

Example:

For `a = [2, 3, 3, 1, 5, 2]`

, the output should be`firstDuplicate(a) = 3`

.

There are 2 duplicates: numbers 2 and 3. The second occurrence of 3 has a smaller index than the second occurrence of 2 does, so the answer is 3.

For `a = [2, 4, 3, 5, 1]`

, the output should be`firstDuplicate(a) = -1`

.

This is code-golf, so shortest answer in bytes wins.

BONUS: Can you solve it in O(n) time complexity and O(1) additional space complexity?

musicman523 08/01/2017.

*O(n ^{2}) time, O(n) space*

^{Saved 3 bytes thanks to @vaultah, and 3 more from @xnor!}

`lambda l:l[map(l.remove,set(l))<0]`

1 xnor 07/31/2017

It looks like

`lambda l:l[map(l.remove,set(l))<0]`

works, even though the order of evaluation is weird. Chris_Rands 07/31/2017

This doesn't return

`-1`

when no duplicates are found without the 'footer code', does that code not count towards the bytes? I'm new to code golf, sorry if it's a basic question! LiefdeWen 07/31/2017

@Chris_Rands Beneath the question musicman did ask if exception is okay instead of -1 and OP said its okay and musicman's answer throws exception.

Thoth19 07/31/2017

That took me a while to figure out. Well played. Getting the 0th element of l using the conditional after modifying it is really clever.

Arnauld 07/30/2017.

*Saved 6 bytes thanks to ThePirateBay*

Returns `undefined`

if no solution exists.

Time complexity: *O*(n) :-)

Space complexity: *O*(n) :-(

`a=>a.find(c=>!(a[-c]^=1))`

We keep track of already encountered values by saving them as new *properties* of the original array ** a** by using negative numbers. This way, they can't possibly interfere with the original entries.

```
let f =
a=>a.find(c=>!(a[-c]^=1))
console.log(f([2, 3, 3, 1, 5, 2]))
console.log(f([2, 4, 3, 5, 1]))
console.log(f([1, 2, 3, 4, 1]))
```

Just notice that Objects in JavaScript may not be implemented as hash table. Time complexity of accessing keys of some object may not be O(1).

JungHwan Min 07/30/2017.

`#/.{h=___,a_,h,a_,h}:>a&`

Mathematica's pattern matching capability is so cool!

Returns the original `List`

for invalid input.

`#/.`

In the input, replace...

`{h=___,a_,h,a_,h}`

A `List`

with a duplicate element, with 0 or more elements before, between, and after the duplicates...

`... :>a`

With the duplicate element.

Dennis 07/31/2017.

`Ṛœ-QṪ`

```
Ṛœ-QṪ Main link. Argument: A (array)
Ṛ Yield A, reversed.
Q Unique; yield A, deduplicated.
œ- Perform multiset subtraction.
This removes the rightmost occurrence of each unique element from reversed
A, which corresponds to the leftmost occurrence in A.
Ṫ Take; take the rightmost remaining element, i.e., the first duplicate of A.
```

This doesn't seem to return

`-1`

for no duplicates. Throwing an exception is okay as per OP but I'm not sure if `0`

is even though it's not in the range. miles 07/30/2017.

`xŒQ¬$Ḣ`

Returns the first duplicate, or 0 if there is no duplicate.

```
xŒQ¬$Ḣ Input: array M
$ Operate on M
ŒQ Distinct sieve - Returns a boolean mask where an index is truthy
for the first occurrence of an element
¬ Logical NOT
x Copy each value in M that many times
Ḣ Head
```

@EriktheOutgolfer If there are no duplicates,

`i0`

would return 0, where `ị`

would index and return the last value of the input instead of 0. ETHproductions 07/30/2017.

`æ@bX ¦Y`

```
æ@ bX ¦ Y
UæXY{UbX !=Y} Ungolfed
Implicit: U = input array
UæXY{ } Return the first item X (at index Y) in U where
UbX the first index of X in U
!=Y is not equal to Y.
In other words, find the first item which has already occured.
Implicit: output result of last expression
```

Alternatively:

`æ@¯Y øX`

```
æ@ ¯ Y øX
UæXY{Us0Y øX} Ungolfed
Implicit: U = input array
UæXY{ } Return the first item X (at index Y) in U where
Us0Y the first Y items of U (literally U.slice(0, Y))
øX contains X.
In other words, find the first item which has already occured.
Implicit: output result of last expression
```

isaacg 07/31/2017.

`h.-Q{`

Remove from Q the first appearance of every element in Q, then return the first element.

@Mr.Xcoder No, it's the OP's fault. That information should be in the challenge text, but just in a comment

Lynn 08/01/2017.

```
f s(h:t)|h`elem`s=h|1<2=f(h:s)t
f[]
```

Try it online! Crashes if no duplicate is found.

Zacharý 08/04/2017.

`⊢⊃⍨0⍳⍨⊢=⍴↑∪`

Now modified to not depend on v16! Try it online!

`⊢⊃⍨...`

-**N**at this index:`⍴↑∪`

-**N**with duplicates removed, right-padded with`0`

to fit**N**`⊢=`

- Element-wise equality with**N**`0⍳⍨`

- Index of the first`0`

. `

Adám 08/04/2017.

`⊃n/⍨(,≢∪)¨,\n←⎕,2⍴¯1`

`2⍴¯1`

negative one **r**eshaped into a length-two list

`⎕,`

get input (mnemonic: console box) and prepend to that

`n←`

store that in *n*

`,\`

prefixes of *n* (lit. cumulative concatenation)

`(`

…`)¨`

apply the following tacit function to each prefix

`,`

[is] the ravel (just ensures that the prefix is a list)

`≢`

different from

`∪`

the unique elements[?] (i.e. is does the prefix have duplicates?)

`n/⍨`

use that to filter *n* (removes all elements until the first for which a duplicate was found)

`⊃`

pick the first element from that

Wow, you got beat three times. Still, +1. And can you add an explanation of how this works?

Neil 08/04/2017.

`1!`\b(\d+)\b(?<=\b\1 .*)`

Try it online! Explanation: `\b(\d+)\b`

matches each number in turn, and then the lookbehind looks to see whether the number is a duplicate; if it is the `1`

st match is `!`

output, rather than the count of matches. Unfortunately putting the lookbehind first doesn't seem to work, otherwise it would save several bytes. Edit: ~~Added 7 bytes to comply with the ~~ Saved 2 bytes thanks to @MartinEnder.`-1`

return value on no match.

2 FryAmTheEggman 07/31/2017

For the record, the lookaround won't backtrack. This prevents this from working if you try to put it before. I've made this mistake many times, and Martin always corrects me.

Value Ink 08/04/2017

I got 30 bytes by using a lookahead instead of a lookbehind. Also, the rules now say you don't need to return

`-1`

. Luis Mendo 07/30/2017.

`&=Rsqf1)`

Gives an error (without output) if no duplicate exists.

Try at **MATL Online!**

```
&= % Implict input. Matrix of all pairwise equality comparisons
R % Keep the upper triangular part (i.e. set lower part to false)
s % Sum of each column
q % Subtract 1
f % Indices of nonzero values
1) % Get first. Gives an error is there is none. Implictly display
```

Leaky Nun 07/31/2017.

O(n) time and O(1) extra memory.

```
def f(a):
r=-1
for i in range(len(a)):t=abs(a[i])-1;r=[r,i+1][a[t]<0>r];a[t]*=-1
return r
```

The basic idea of the algorithm is to run through each element from left to right, keep track of the numbers that have appeared, and returning the number upon reaching a number that has already appeared, and return -1 after traversing each element.

However, it uses a clever way to store the numbers that have appeared without using extra memory: to store them as the sign of the element indexed by the number. For example, I can represent the fact that `2`

and `3`

has already appeared by having `a[2]`

and `a[3]`

negative, if the array is 1-indexed.

Downgoat 07/31/2017

The question says

`1`

to a.length but for a[i]= a.length wouldn't this go out of bounds? 3 Leaky Nun 07/31/2017

Note from feersum: "solution is cheating because it uses integers 1 bit larger than the input."

RoryT 07/31/2017.

`c((x=scan())[duplicated(x)],-1)[1]`

Cut a few characters off the answer from @djhurio, don't have enough reputation to comment though.

oh...I didn't see this answer; this is good for the prior spec when missing values required

`-1`

but with the new spec, I managed to golf it down even more. This is still solid and it's a different approach from the way he did it, so I'll give you a +1! bob 07/31/2017.

`(*/{_1,~i.&0)@~:`

```
(*/{_1,~i.&0)@~:
@~: returns the nub sieve which is a vector with 1 for the first occurrence of an element in the argument and 0 otherwise
i.&0 returns the first index of duplication
_1,~ appends _1 to the index
*/ returns 0 with duplicates (product across nub sieve)
{ select _1 if no duplicates, otherwise return the index
```

djhurio 07/31/2017.

I think you can now return

`NA`

for missing values since the spec has changed; so `(x=scan())[duplicated(x)][1]`

is perfectly valid. Brad Gilbert b2gills 07/31/2017.

`*.repeated[0]`

The

`*`

is in a Term position so the whole statement is a WhateverCode lambda.The

`.repeated`

is a method that results in every value except for the first time each value was seen.`say [2, 3, 3, 3, 1, 5, 2, 3].repeated.perl; # (3, 3, 2, 3).Seq # ( 3, 3, 2, 3).Seq`

`[0]`

just returns the first value in the Seq.

If there is no value Nil is returned.

(Nil is the base of the Failure types, and all types are their own undefined value, so Nil different than an undefined value in most other languages)

Note that since the implementation of `.repeated`

generates a Seq that means it doesn't start doing any work until you ask for a value, and it only does enough work to generate what you ask for.

So it would be easy to argue this has at worst *O(n)* time complexity, and at best *O(2)* time complexity if the second value is a repeat of the first.

Similar can probably be said of memory complexity.

lstefano 08/02/2017.

Only works in `⎕IO←0`

.

` w[⊃(⍳∘≢~⍳⍨)w←¯1,⎕]`

Remove from the list of indices of the elements of the argument with a prepended "-1" the list indices of its nub and then pick the first of what's left. If after the removal there only remains an empty vector, its first element is by definition 0 which is used to index the extended argument producing the desired -1.

Adám 08/04/2017

Adám 08/04/2017.

As per the new rules, throws an error if no duplicates exist.

`⊢⊃⍨⍬⍴⍳∘≢~⍳⍨`

`⍳⍨`

the indices of the first occurrence of each element

`~`

removed from

`⍳∘≢`

of all the indices

`⍬⍴`

reshape that into a scalar (gives zero if no data is available)

`⊃⍨`

use that to pick from (gives error on zero)

`⊢`

the argument

Moris Zucca 08/04/2017.

`{⊃⍵[(⍳⍴⍵)~⍵⍳⍵]}`

Seems like we can return 0 instead of -1 when there are no duplicates, (thanks Adám for the comment). So 3 bytes less.

A bit of description:

```
⍵⍳⍵ search the argument in itself: returns for each element the index of it's first occurrence
(⍳⍴⍵)~⍵⍳⍵ create a list of all indexes, remove those found in ⍵⍳⍵; i.e. remove all first elements
⊃⍵[...] of all remaining elements, take the first. If the array is empty, APL returns zero
```

For reference, old solution added -1 to the list at the end, so if the list ended up empty, it would contain -1 instead and the first element would be -1.

`{⊃⍵[(⍳⍴⍵)~⍵⍳⍵],¯1}`

Try it on tryapl.org

Value Ink 08/04/2017.

Misunderstood the challenge the first time. `O(n)`

time, `O(n)`

space.

`->a{d={};a.find{|e|b=d[e];d[e]=1;b}}`

aross 08/14/2017.

`for(;!${$argv[++$x]}++;);echo$x;`

Run like this:

```
php -nr 'for(;!${$argv[++$x]}++;);echo$x;' -- 2 3 3 1 5 2;echo
> 3
```

```
for(
;
!${ // Loop until current value as a variable is truthy
$argv[++$x] // The item to check for is the next item from input
}++; // Post increment, the var is now truthy
);
echo $x; // Echo the index of the duplicate.
```

- Saved 12 bytes by using variables instead of an array
- Saved 6 bytes by making use of the "undefined behavior" rule for when there is no match.
- Saved 6 bytes by using post-increment instead of setting to 1 after each loop

As can be seen from the commented version of the code, the time complexity is linear `O(n)`

. In terms of memory, a maximum of `n+1`

variables will be assigned. So that's `O(n)`

.

Titus 08/11/2017

Thanks for not using a weird encoding. But you should add the

`error_reporting`

option to the byte count (or use `-n`

, which is free). aross 08/11/2017

We've been here before. PHP notices and warnings are ignorable. I might as well pipe them to

`/dev/null`

, which is the same. Xanderhall 08/11/2017

How is that

`O(1)`

for additional space? You're literally assigning a new variable per `n`

, which is `O(n)`

TheLethalCoder 07/31/2017.

`using System.Linq;a=>{var d=a.Where(n=>a.Count(t=>t==n)>1);return d.Select((n,i)=>new{n,i}).FirstOrDefault(o=>d.Take(o.i).Contains(o.n))?.n??-1;}`

Probably a lot shorter way to do this in C# with a simple loop but I wanted to try it with Linq.

Full/Formatted version:

```
namespace System.Linq
{
class P
{
static void Main()
{
Func<int[], int> f = a =>
{
var d = a.Where(n => a.Count(t => t == n) > 1);
return d.Select((n, i) => new { n, i }).FirstOrDefault(o => d.Take(o.i).Contains(o.n))?.n ?? -1;
};
Console.WriteLine(f(new[] { 2, 3, 3, 1, 5, 2 }));
Console.WriteLine(f(new[] { 2, 4, 3, 5, 1 }));
Console.ReadLine();
}
}
}
```

TheLethalCoder 07/31/2017

@LiefdeWen Post it as an answer :) Though I do usually like Linq better too :) Might be able to get it shorter with Linq too but I'm now sure.

LiefdeWen 07/31/2017

Nah, this question is overpopulated and I would rather you get the up-votes for this question.

miles 08/01/2017.

`,&_1{~~:i.0:`

```
,&_1{~~:i.0: Input: array M
~: Nub-sieve
0: The constant 0
i. Find the index of the first occurrence of 0 (the first duplicate)
,&_1 Append -1 to M
{~ Select the value from the previous at the index of the first duplicate
```

jferard 08/01/2017.

` fst.foldl(\(i,a)(j,x)->(last$i:[j|i<0,elem x a],x:a))(-1,[]).zip[1..]`

*Saved 9 bytes thanks to @nimi*

A basic path through the list. If the current element has not yet been seen (`i<0`

) and is in the accumulator list (`elem x a`

) then store the current index. Else, keep the index -1. In any case, add the current element to the accumulator list.

**EDIT**: I did not read the question carefully enough: this code outputs the index of the second element of a duplicate element.

You can use the "Shorter Conditional" from our "Tips for golfing in Haskell":

`\ ... ->(last$i:[j|i<0,elem x a],x:a)`

. Also: no need for the `f=`

, because unnamed functions are allowed. Halvard Hummel 08/10/2017.

Returns `None`

if there is no duplicate element

**Edit:** -6 bytes thanks to @musicman523

```
def f(n):
for a in n:
u=-abs(a)
if n[u]<0:return-u
n[u]=-n[u]
```

**O(n)** time complexity, **O(n)** space complexity, **O(1)** auxiliary space.

As the input list uses **O(n)** space, the space complexity is bound by this. Meaning we cannot have a lower space complexity than **O(n)**

Does modify the original list, if this is not allowed we could do it in the same complexity with 129 bytes

Since every element is greater than 0 and less than or equal to the size of the list, the list has for each element a, an element on index a - 1 (0 indexed). We exploit this by saying that if the element at index i is negative, we have seen it before.

For each element a in the list n, we let u be negative the absolute value of a. *(We let it be negative since python can index lists with negative indices, and we would otherwise need to do* `u=abs(a)-1`

) If the element at index u in the list is negative, we have seen it before and can therefore return -u *(to get the absolute value of a, as all elements are positive)*. Else we set the element at index u to be negative, to remember that we have seen an element of value a before.

Wheat Wizard 08/10/2017

Are you sure this is **O(1)** in memory? You are still using **n** bits of memory to store what numbers have already been visited, even though the bits are in the sign. It seems to me that this is **O(n)** in disguise

Oliver Ni 08/10/2017

Technically this uses **O(n)** space - the n sign bits. If the array can only hold values between

`1`

and `n`

, like how it was given, then it obviously doesn't work. Halvard Hummel 08/10/2017

This really just comes down to the representation you choose for the numbers. If unsigned numbers are used, then this is **O(n)** auxiliary space. If signed numbers are used, then the sign bit is already there, meaning **O(1)** auxiliary space.

Xanderhall 08/11/2017.

Previous 65 byte solution:

`r->{for(int a,b=0,z,i=0;;b=a)if((a=b|1<<(z=r[i++]))==b)return z;}`

New solution. 19 bytes are included for `import java.math.*;`

*-8 bytes thanks to @Nevay*

`r->{int z,i=0;for(BigInteger c=BigInteger.ZERO;c.min(c=c.setBit(z=r[i++]))!=c;);return z;}`

The algorithm in my original program was fine, but the static size of the datatype used meant that it broke fairly quickly once the size went above a certain threshold.

I have changed the datatype used in the calculation to increase the memory limit of the program to accommodate this (using `BigInteger`

for arbitrary precision instead of `int`

or `long`

). However, this makes it debatable whether or not this counts as `O(1)`

space complexity.

I will leave my explanation below intact, but I wish to add that I now believe it is impossible to achieve `O(1)`

space complexity without making some assumptions.

Define `N`

as an integer such that `2 <= N`

.

Let `S`

be a list representing a series of random integers `[x{1}, ..., x{N}]`

, where `x{i}`

has the constraint `1 <= x{i} <= N`

.

The time complexity (in Big-O notation) required to iterate through this list exactly once per element is `O(n)`

The challenge given is to find the first duplicated value in the list. More specifically, we are searching for the first value in `S`

that is a duplicate of a previous item on the list.

Let `p`

and `q`

be the positions of two elements in the list such that `p < q`

and `x{p} == x{q}`

. Our challenge becomes finding the smallest `q`

that satisfies those conditions.

The obvious approach to this problem is to iterate through S and check if our `x{i}`

exists in another list `T`

:
If `x{i}`

does not exist in `T`

, we store it in `T`

.
If `x{i}`

does exist in `T`

, it is the first duplicate value and therefore the smallest `q`

, and as such we return it.
This space efficiency is `O(n)`

.

In order to achieve `O(1)`

space complexity while maintaining `O(n)`

time complexity, we have to store unique information about each object in the list in a finite amount of space. Because of this, the only way any algorithm could perform at `O(1)`

space complexity is if:
1. N is given an upper bound corresponding to the memory required to store the maximum number of possible values for a particular finite datatype.
2. The re-assignment of a single immutable variable is not counted against the complexity, only the number of variables (a list being multiple variables).
3. (Based on other answers) The list is (or at least, the elements of the list are) mutable, and the datatype of the list is preset as a signed integer, allowing for changes to be made to elements further in the list without using additional memory.

1 and 3 both require assumptions and specifications about the datatype, while 2 requires that only the number of variables be considered for the calculation of space complexity, rather than the size of those variables. If none of these assumptions are accepted, it would be impossible to achieve both `O(n)`

time complexity and `O(1)`

space complexity.

Whoo boy, this one took ~~an embarrassingly long time to think up~~ a bit of brain power.

So, going for the bonus is difficult. We need both to operate over the entire list exactly once **and** track which values we've already iterated over without additional space complexity.

Bit manipulation solves those problems. We initialize our `O(1)`

'storage', a pair of integers, then iterate through the list, OR-ing the ith bit in our first integer and storing that result to the second.

For instance, if we have `1101`

, and we perform an OR operation with `10`

, we get `1111`

. If we do another OR with `10`

, we still have `1101`

.

Ergo, once we perform the OR operation and end up with the same number, we've found our duplicate. No duplicates in the array causes the program to run over and throw an exception.

SchoolBoy 08/10/2017

Also, your second test includes the number 100, but thats impossible since the array itself is only 5 long

Xanderhall 08/10/2017

@SchoolBoy Good catch. My only problem is that there doesn't seem to be any upper limit on the size of the array, so I can't realistically change my code to solve memory issues.

SchoolBoy 08/10/2017

@Xanderhall True, but i feel like 32 (or if you use a long, 64) numbers is too little :p. Either way, imposing a limit on the input, and then allocating the maximum memory needed and calling it O(1) memory is just a cheat. It is still O(n) since if the size of the input increased, so would this upper bound to the memory. Which is also why I think it is impossible to create an O(n) O(1) algorithm

SchoolBoy 08/14/2017.

As a lambda function:

`a->{Set<Long>s=new HashSet<>();for(long i:a)if(!s.add(i))return i;return-1;}`

Probably can be made much smaller, this was very quick.

```
a->{ //New lambda function with 'a' as input
Set<Long>s=new HashSet<>(); //New set
for(long i:a) //Iterate over a
if(!s.add(i)) //If can't add to s, already exists
return i; //Return current value
return-1; //No dupes, return -1
}
```

~~75~~ ~~67~~ 64 bytes using the negation strategy:

`a->{int i=0,j;while((a[j=Math.abs(a[i++])-1]*=-1)<0);return++j;}`

(-3 bytes thanks to @Nevay)

```
a->{ //New lambda expression with 'a' as input
int i=0,j; //Initialise i and declare j
while((a[j=Math.abs(a[i++])-1]*=-1)<0); //Negate to keep track of current val until a negative is found
return++j; //Return value
}
```

Loops over the array, negating to keep track. If no dupes, just runs over and throws an error.

Both of these work on O(n) time and O(n) space complexity.

Jakob 08/10/2017

It's worth noting that this will need to be assigned to a lambda returning

`Number`

, since `i`

is a `long`

and `-1`

is an `int`

. SchoolBoy 08/10/2017

@Jakob Not necessary, -1 being an int will automatically be cast to a long without explicitly specifying the cast

Jakob 08/10/2017

It will cast implicitly to

`long`

, but not to `Long`

as required for the lambda to be assigned to a `Function`

. Did you test it? Regardless, that solution can be replaced with your new one. Nevay 08/11/2017

You can use raw types

`Set s=new HashSet();`

to save 7 bytes. (Besides: afaik the import of `java.util.*;`

has to be included into the byte count -> +19 bytes.) The return statement can be `return++j`

, the if-statement can be removed `a->{int i=0,j;for(;(a[j=Math.abs(a[i++])-1]*=-1)<0;);return++j;}`

(-3 bytes). RosLuP 07/31/2017.

`g(a:List INT):INT==(for i in 2..#a repeat(for j in 1..i-1 repeat if a.i=a.j then return a.i);-1)`

it is O(n^2)

SuperStormer 07/31/2017.

`a=>(b=[],a.find(e=>b.includes(e)?e:(b.push(e),0))||-1)`

Uses another array to keep track of the already encountered values.

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

- Finding duplicate balls in a basket?
- Shorter than a Split Second!
- First code golf decathlon
- Find a multiple of a given number whose decimal representation looks like binary
- Find how many pair elements sums up to N
- Count the reviews!
- Indices of elements in an array in order from smallest to largest
- Find the nearest greater number
- Find the missing integer (i) , The duplicated integer (j), the length or random integers (n). But only if “i” = “j”, just tell me “Huh!?”
- Collapse Adjacent Duplicates
- Tips for golfing in Haskell

- The meaning of 日本はどうですか
- Prime Up your code
- Why don't they use dragonglass sword?
- How to execute a command on vim startup
- ListContourPlot with hatched regions
- In Matrix, why is Neo confusing left and right?
- How to avoid a very talkative cleaning lady?
- Is there any difference between HTTP and HTTPS when using my home / own internet connection
- Force table column to be zero width
- Has ESPN removed broadcaster Robert Lee from a game, citing the name of a confederate general?
- Why is there bunch of references to chrome browser in a new - empty tab of Firefox?
- Output diagonal positions of me squared
- Semi-Diagonal Alphabet
- Is it considered normal to publish job offers inviting candidates to apply based on their gender and / or race in academia?
- Python Interpreter only using 12% CPU Power
- Students can solve programming exercises but not explain their solutions. What to do?
- Why didn't Barty Crouch Jr just use Imperio on Moody?
- Why do some universities not provide marking schemes for mock exams?
- Specifics of magical symbols and casting: What makes spoken magic difficult to master?
- Czechia or Czech Republic (or both)?
- Do USB Data Wires (D+/D-) have 90 ohm differential impedance and single ended 45 ohm impedance to ground and if so how is this made?
- Find Primes in Pi
- Why would Jon Snow give Jorah Mormont his sword, knowing what it can do?
- Is it better practice to buy RAID disks individually vs. in bulk?

`4`

, so I'd assume no