They didn’t just interchange the index variables in that first example: they exploited the fact that doing so does not change the sum. Thus, they were able to write
$$2S=\sum_{1\le j<k\le n}(a_k-a_j)(b_k-b_j)+\sum_{1\le k<j\le n}(a_j-a_k)(b_j-b_k)\;,$$
getting a sum in which every possible term of the form $(a_i-a_\ell)(b_i-b_\ell)$ with $1\le i,\ell\le n$ appears except those in which $i=\ell$.
It may help to think of this in matrix terms. For $1\le j,k\le n$ let $c_{j,k}=(a_k-a_j)(b_k-b_j)$, and let
$$C=\begin{bmatrix}c_{1,1}&\color{red}{c_{1,2}}&\color{red}{\ldots}&\color{red}{c_{1,n-1}}&\color{red}{c_{1,n}}\\
\color{blue}{c_{2,1}}&c_{2,2}&\color{red}{\ldots}&\color{red}{c_{2,n-1}}&\color{red}{c_{2,n}}\\
\color{blue}{\vdots}&\color{blue}{\vdots}&\ddots&\color{red}{\vdots}&\color{red}{\vdots}\\
\color{blue}{c_{n-1,1}}&\color{blue}{c_{n-1,2}}&\color{blue}{\ldots}&c_{n-1,n-1}&\color{red}{c_{n-1,n}}\\
\color{blue}{c_{n,1}}&\color{blue}{c_{n,2}}&\color{blue}{\ldots}&\color{blue}{c_{n,n-1}}&c_{n,n}
\end{bmatrix}\;;$$
then $S$ is the sum of the (red) entries above the main diagonal of $C$, and the sum with the indices interchanged is the sum of the (blue) entries below the main diagonal of $C$. In this very special case the matrix $C$ happens to be symmetric, so the two sums are equal. Nicer yet, the entries on the main diagonal are all $0$, so the sum of all the entries in $C$ is $2S$. Thus, $2S$ is just the sum of all possible products of the form $(a_k-a_j)(b_k-b_j)$ with $1\le j,k\le n$, which is very easy to compute after we rewrite $(a_k-a_j)(b_k-b_j)$ as $a_kb_k-a_kb_j-a_jb_k+a_jb_j$.
What makes this work is the symmetry of the matrix $C$: this is one of the ‘important special cases’ mentioned in the sentence in the middle of page $36$. Learning to recognize them is to a great extent a matter of experience. In general, though, the first thing to do is see whether you can simply evaluate the summations in order as they’re written; if that doesn’t look promising, the next step is to see whether you can reverse the order of summation and get something nicer. Neither of these approaches looks very attractive in the problem above, so at that point you look for some other idea. Recognizing that a summation over $1\le j<k\le n$ or $1\le j\le k\le n$ is a summation over the upper half (give or take the diagonal) of an $n\times n$ matrix, you can reasonably look to see whether the whole matrix would be easier to work with and whether there’s an exploitable relationship between the upper and lower halves. Here both of those turn out to be the case.
Hoping that you enjoy hypergeometric functions.
$$f_n=\sum_{k=1}^n k\,\binom{n}{k}\, \binom{N-n}{k}\,x^k=n x (N-n) \, _2F_1(1-n,n-N+1;2;x)$$ where appears the Gaussian or ordinary hypergeometric function. This was "simple".
Now, being stuck, using a CAS for a few values of $N$ (since the CAS also was stuck for the general case), it seems that there are two patterns depending on the parity of $N$
$$\left(
\begin{array}{cc}
N & \sum_{n=1}^N f_n \\
2 & x \\
4 & 2 x^2+10 x \\
6 & 3 x^3+42 x^2+35 x \\
8 & 4 x^4+108 x^3+252 x^2+84 x \\
10 & 5 x^5+220 x^4+990 x^3+924 x^2+165 x \\
12 & 6 x^6+390 x^5+2860 x^4+5148 x^3+2574 x^2+286 x \\
14 & 7 x^7+630 x^6+6825 x^5+20020 x^4+19305 x^3+6006 x^2+455 x \\
16 & 8 x^8+952 x^7+14280 x^6+61880 x^5+97240 x^4+58344 x^3+12376 x^2+680 x
\end{array}
\right)$$
$$\left(
\begin{array}{cc}
3 & 4 x \\
5 & 12 x^2+20 x \\
7 & 24 x^3+112 x^2+56 x \\
9 & 40 x^4+360 x^3+504 x^2+120 x \\
11 & 60 x^5+880 x^4+2376 x^3+1584 x^2+220 x \\
13 & 84 x^6+1820 x^5+8008 x^4+10296 x^3+4004 x^2+364 x \\
15 & 112 x^7+3360 x^6+21840 x^5+45760 x^4+34320 x^3+8736 x^2+560 x \\
17 & 144 x^8+5712 x^7+51408 x^6+159120 x^5+194480 x^4+95472 x^3+17136 x^2+816 x
\end{array}
\right)$$ and the coefficients seem to be corresponding to "simple" polynomials in $N$ (some of the sequences were found in $OEIS$).
Best Answer
Use $${n \choose i}{i \choose j}={n \choose j}{n-j \choose i-j}.$$ Then $$S=\displaystyle \sum_{j=0}^{n} \sum_{i=j}^{n} \binom{n}{i} \binom{i}{j}=\displaystyle \sum_{j=0}^{n}\binom{n}{j} \sum_{i=j}^{n}\binom{n-j}{i-j}.$$ Let $i-j=k$, then $$\implies S=\displaystyle \sum_{j=0}^{n}\binom{n}{j} \sum_{k=0}^{n-j}\binom{n-j}{k}=\sum_{j=0}^{n} {n \choose j} 2^{n-j}=2^n (1+1/2)^n=3^n.$$