In a queue of girls, Neetu is seventh from the front. Mona is sixth from the back. Parul is standing in between the two. What could be the minimum number of girls standing in the queue?

Let Neetu be at position 7 from the front.

Let Mona be at position 6 from the back.

Let the total number of girls be $n$.

---

Position of Neetu from the front $= 7$

Position of Mona from the front $= n - 6 + 1 = n - 5$

---

For Parul to stand between Neetu and Mona, there must be at least one position between them.

This requires:

Position of Neetu $<$ Position of Parul $<$ Position of Mona

$7 < \text{Position of Parul} < n - 5$

---

For at least one position to exist between them:

$7 + 1 \leq n - 5$

$8 \leq n - 5$

$n \geq 13$

Wait, this gives minimum as 13, but let's reconsider if Mona comes before Neetu.

---

If Mona's position (from back) places her before Neetu in the queue:

Position of Mona from front $= n - 5$

For Mona to be before Neetu: $n - 5 < 7$

This gives $n < 12$

---

For minimum $n$, we want Mona and Neetu as close as possible with Parul between them.

If $n = 8$:

• Neetu is at position 7 from front
• Mona is at position $8 - 5 = 3$ from front
• Parul can be at positions 4, 5, or 6 (between them)

This configuration satisfies all conditions.

Therefore, the minimum number of girls is $8$.