Given a compact data structure to store strings sequentially, one byte stores length l of the string, next l bytes contain the string characters. Write a code to insert the given string at the ith place, making sure the DS is still compact. Write tests to verify the correctness

Question

Accepted Answer

The code inserts a given string at the specified position in a compact data structure that stores strings sequentially.

To insert the string at the ith place, we need to shift all the strings after the ith position by the length of the new string.
We can use a loop to iterate through the data structure and find the ith position.
After finding the ith position, we can calculate the new length of the data structure and allocate memory accordingly.
We then shift all the strings after the ith position to make space for the new string.
Finally, we copy the new string to the ith position and update the length of the data structure.

Given a compact data structure to store strings sequentially, one byte stores length l of the string, next l bytes contain the string characters. Write a code to insert the given string at the ith place, making sure the DS is still compact. Write tests to verify the correctness

Top Microsoft Corporation Software Developer interview questions & answers

Popular interview questions of Software Developer

Top HR questions asked in Microsoft Corporation Software Developer