ans of this code A contry consist of N cities has exactly one trader who sells and buys items.You want to travel this country from number 0,1,......N-1 Ypu can sell buy or do nothing in ech city However you cannot selll and buy in thw same city Each trdaet has price equal to Pi Thwrefore he will buy or sell an item onky at this price Ther are no limuts to the number of buying and selling operations performed durning thw journey at any given city However you must finish your journey with zero items .Find the maximum profit you can make .Since the the number can be very kargw return it modulo 10^9+7

User Avatar

Company name On Campus/ Off Campus/ Referral Experience

  • Name -Aanam
  • College -sswcoe
  • Date of Interview -12-7-22
  • Branch -

Written Test -

-- Explain written test process here -

Interview -

-- Explain written test process here -

 

User Avatar

Infosys ke practice paper

User Avatar

INFOSYS/ ON Campus

  • Name -...........
  • College -.........
  • Date of Interview -AAAAAAAAAAA555
  • Branch -AAAAAAA

Written Test -

--AAAAAAAAAAAAAAAAAAAAAA

Interview -

-- AAAAAAAAAAAAAAAAAAAA

 

User Avatar

Company name On Campus/ Off Campus/ Referral Experience

  • Name -
  • College -
  • Date of Interview -
  • Branch -

Written Test -

-- Explain written test process here -

Interview -

-- Explain written test process here -

 

User Avatar