25:I[91452,["/_next/static/chunks/f915c07274536659.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/b100b36337f58b96.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/44f9947f31017eda.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/1f34752723866743.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/06238a0ba6e2450a.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/1fe50d1faa3d3f5b.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/a068ae4bba82be06.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/135849583f9affe4.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp"],"ProblemHintSolution"] 21:["$","span",null,{"className":"flex items-center gap-1 whitespace-nowrap min-w-0","children":[["$","svg",null,{"ref":"$undefined","xmlns":"http://www.w3.org/2000/svg","width":24,"height":24,"viewBox":"0 0 24 24","fill":"none","stroke":"currentColor","strokeWidth":2,"strokeLinecap":"round","strokeLinejoin":"round","className":"lucide lucide-chevron-right h-3 w-3 shrink-0","children":[["$","path","mthhwq",{"d":"m9 18 6-6-6-6"}],"$undefined"]}],["$","span",null,{"className":"text-foreground font-medium truncate max-w-[150px] sm:max-w-[200px] md:max-w-[250px] lg:max-w-[300px]","title":"Escaping is always possible","children":"Escaping is always possible"}]]}] 24:T487,A square house is partitioned into an

n \times n

grid, where each cell is a room. All neighboring rooms have a door connecting them, and each door can either be normalor inversive. If USJL walks over an inversive door, he would become inverted-USJL,and vice versa. USJL must choose a room to begin and walk pass each room exactly once. If it is inverted-USJL showing up after finishing, then he would be trapped for all eternity. Prove that USJL could always escape.

Problem Statement