⭐ IN A GIVEN PROBLEM , WE NEED TO REORGANIZE THE ELEMENTS OF ARRAY IN SUCH A WAY, THE VALUES ARE PLACED SAME AS THE INDEX VALUE, AND THOSE VALUES ARE NOT PRESENT RETURN -1 ON THAT INDEX.
⭐HERE WE NEED TO CREATE A VECTOR OF ARRAY SIZE, WE CAN INTIALLY FILLED THAT ARRAY BY -1 VALUES IN ALL.
⭐THAN WE CAN TRAVERSE INSIDE THE ARRAY AND CHECK WHICH OF THE ELEMETS ARE THERE IN THE ARRAY.
⭐WE NEED TO PLACE IT ON THEIR POSITION AND RETURN BACK THE VECTOR AS A FINAL OUTPUT.
⭐TIME COMPLEXTIY: O(n)
⭐SPACE COMPLEXITY: O(1)