Popular posts from this blog
Given two sorted arrays of size m and n .Find the number of common elements in them and also find what are that common elements.
This can be done in 3 ways :(considering worst case)//only for sorted 1. O(m*n) // if m == n, then (n*n) 2. O(nLog(m))// if m>n else O(mLog(n)) Using Binary search 3. O(m + n) // this is optimal worst case time// using concept of merge sort for example : array a[] = { 10,20,30.40,50,60,70,80,90};//only for sorted array b[] = { 10,15,20,25,30}; output : 10 20 30 number of same elements : 3 follow me on : Instagram Twitter LinkedIn my website facebook Whatsapp gmail
Consultancy company product id codeof two list in wipro feb 2022
"consultancy company product id code of two list" in wipro feb 2022 You work in a consultancy company. One of the clients wishes to have software which uses two data lists: one consisting of product ID and the ather consisting of quantity. The software combines the elements alternately so that for each product its quantity is after the product ID. As a lead developer you have been tasked to create the required software.
Comments
Post a Comment