 On a $(4n + 2)\times (4n + 2)$ square grid, a turtle can move between squares sharing a side.The turtle begins in a corner square of the grid and enters each square exactly once, ending in the square where she started. In terms of $n$, what is the largest positive integer $k$ such that there must be a row or column that the turtle has entered at least $k$ distinct times?

1. **Grid and Turtle Path Setup**:
   - Consider a \((4n + 2) \times (4n + 2)\) square grid.
   - The turtle starts at a corner and must visit each square exactly once, returning to the starting square.

2. **Gridline Enumeration**:
   - Enumerate the horizontal and vertical gridlines.
   - Let \(r_i\) be the number of edges in the graph that cross the \(i\)-th vertical gridline.
   - Similarly, let \(c_i\) be the number of edges that cross the \(i\)-th horizontal gridline.

3. **Column and Row Entrances**:
   - The number of times the turtle enters column \(i+1\) is given by \(\frac{r_i + r_{i+1}}{2}\).
   - Similarly, the number of times the turtle enters row \(i+1\) is \(\frac{c_i + c_{i+1}}{2}\).
   - Define \(r_0 = r_{4n+2} = 0\) and similarly for \(c_0\) and \(c_{4n+2}\).

4. **Sum of Gridline Crossings**:
   - Each edge crosses exactly one vertical or horizontal gridline.
   - Therefore, the total number of crossings is \(\sum_{i=0}^{4n+2} r_i + \sum_{i=0}^{4n+2} c_i = (4n+2)^2\).

5. **Bounding the Number of Entrances**:
   - Assume \(\frac{r_i + r_{i+1}}{2} \leq 2n + 1\) and \(\frac{c_i + c_{i+1}}{2} \leq 2n + 1\) for each \(i\).
   - Summing over all \(i\), we get:
     \[
     \sum_{i=0}^{4n+1} \frac{r_i + r_{i+1}}{2} \leq (4n+2)(2n+1)
     \]
     \[
     \sum_{i=0}^{4n+1} \frac{c_i + c_{i+1}}{2} \leq (4n+2)(2n+1)
     \]
   - This implies:
     \[
     \sum_{i=0}^{4n+2} r_i + \sum_{i=0}^{4n+2} c_i \leq 2(4n+2)(2n+1)
     \]
   - Simplifying, we get:
     \[
     (4n+2)^2 \leq 2(4n+2)(2n+1)
     \]
   - This simplifies to:
     \[
     4n^2 + 4n + 1 \leq 4n^2 + 4n + 1
     \]
   - Equality must hold everywhere, leading to a contradiction if \(r_2 = 0\).

6. **Conclusion**:
   - Therefore, there must be at least one row or column that the turtle enters at least \(2n + 2\) times.

The final answer is \( \boxed{ 2n + 2 } \).