1) string "a1b2c3d4". rearrange it as "abcd1234". order should be
preserved. with time complexity O(n) and space complexity O(1)
2) given a file.txt. replace every occurence of "abc" by "xyz"
3) Write a program to check the elements of an array with even number of
elements can be grouped into pairs whose sum is divisible by an integer k.
Example:{0,4,6,10} with k=4, so the pairing can be {(0,4),(6,10)}
4) Given an array representing insertion order in a BST, find the
root-to-node path for any given node.
Please share your views on these questions. I am trying to solve them. But
i want to know the optimized answers for these questions.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
