Problem with the algorithm when deleting an object

I have a words game. The game has the function of removing an extra letter. I keep the letters in an empty game object.

         if (randomCharsString.Length > 0)
         {
             // We stand in front of the letter that we will delete
             int l = randomCharsString.Length - 1;
             // find the object of the letter in lettersGrid
             GameObject g = lettersGrid.transform.Find(randomCharsString[l].ToString()).gameObject;
             // remove a letter from a string
             randomCharsString = randomCharsString.Remove(l, 1);
 
             // get the position of a letter in the grid before deleting it
             int gOldSabling = g.transform.GetSiblingIndex();
             // remove a letter from lettersGrid
             Destroy(g);
 
             if (g == null)
             {
                 print("deleted");
             }
                 // for the place of a letter in the spilled empty cell
             inputImage = Instantiate(transparentСellPref, lettersGrid);
             inputImage.transform.SetSiblingIndex(gOldSabling);
             inputImage.gameObject.name = "transparentСell";
 
 
             // the current state of the letters in lettersGrid 
             savedLettersGridCharsString = "";
             foreach (Transform letter in lettersGrid)
             {
                 if (letter.tag != "transparentСell")
                 {
                     savedLettersGridCharsString = savedLettersGridCharsString + letter.tag;
                 }
                     
             }
 
             PlayerPrefsDB.LettersGridCharsString = savedLettersGridCharsString;
             PlayerPrefsDB.RandomCharsString = randomCharsString;
             print(savedLettersGridCharsString);
             App.money -= 1;
             PlayerPrefsDB.Money = App.money;
             moneyText.text = "" + App.money;

The fact is that the algorithm removes the letter-object and then writes down everyt$$anonymous$$ng remaining in the string. T$$anonymous$$s is necessary to play the state in case the player left the game and entered later. But the problem is that the number of letters in the line does not match the number of game objects. There is still one extra letter in the line. My brain is already boiling.