This puzzle type I created for "Contest for best logic innovation"
Draw a single closed loop by connecting neighboring dots horizontally or vertically (but not diagonally). A numbered square indicates exactly how many of its edge segments are used by the path.
Some of the alphabets are given. These alphabets are either inside or outside the loop. Same alphabet should follow the same rule e.g. if “A” is outside the loop, it implies that all the “A” will be outside the loop.