I am reading the answer here by Hagen von Eitzen. Reading only the first paragraph.
His answer
Let $a\le 1$ be supremum of all finite disc packing areas in the unit square. Consider the square minus an inscribed disc. Because its boundary is a zero-measure set (or whatever argument also worked for the first part of the problem), it can be exhausted arbitrarily well by finitely many dyadic squares, that is for $\epsilon>0$ we find a finite set of squares such that the squares fill a proportion $1-\epsilon$ of this shape. For each small square find a finite disc filling that fills a proportion of $a-\epsilon$ of their respective area. Then the total area filled by all discs is $$\tag1\frac\pi4+\left(1-\frac\pi 4\right)(1-\epsilon)(a-\epsilon). $$ As $\epsilon\to 0$, the expression in $(1)$ goes $\to a+\frac\pi4(1-a)$ which must be $\le a$. Hence $a=1$.
My understanding:
Consider unit square minus inscribed disc. Call it $W$.
By similiar argument that worked for the first part of the problem:
$\color{blue}{\forall\ \epsilon >0, \exists\ \text{partition}\ P\ \text{such that:}}$
$($area of all square tiles in $W)>\left( 1-\dfrac{\pi}{4} \right)- \epsilon$
From here how shall I reach?
$\implies\ ($area of all discs in $W)=\left( 1-\dfrac{\pi}{4} \right) (1-\epsilon) (a-\epsilon)$
$\implies\ ($area of all discs in square$)\ =\dfrac{\pi}{4} + \left( 1-\dfrac{\pi}{4} \right) (1-\epsilon) (a-\epsilon)<a$
Applying limit $1 \leq a$
Also $a \leq 1$
Therefore $a=1$
EDIT
Comment by Hagen:
I use a scaled down (almost) optimal packing only for those tiny squares that are not coverd by the big disc enscribed ot the big square.