I am not looking for answer. Just sharing these Section 2 questions: 1. Given an array arr[] of n integers, construct a Product Array prod[] (of same size) such that prod[i] is equal to the product of all the elements of arr[] except arr[i]. Solve it without division operator. Give an efficient code. (if you are interested, here is my solution: http://ideone.com/EaTUF , developed at the test time itself).
2. Test Cases of Find and Replace functionality in Notepad. 3. You have to make a package library which will do the calculation of (a^b)mod(c), where a, b, c are very large size of 10000 digits. (^- power). Design a data structure for the numbers' storage and suggest what functions will you be providing to user with them. Also mention the advantages of using that DS. Total Time 45 minutes. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/tUiW-bhbEJkJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
