Filter interviews by
Dynamic programming algorithm to find maximum profit by buying and selling at most k items
Use dynamic programming to keep track of maximum profit at each day and for each transaction
Consider the case where k = 1, which is equivalent to the Best Time to Buy and Sell Stock problem
Extend the solution to handle multiple transactions by considering the case where k > 1
posted on 14 May 2022
I applied via Naukri.com and was interviewed before May 2021. There was 1 interview round.
I applied via Walk-in and was interviewed before Apr 2020. There were 5 interview rounds.
I applied via Recruitment Consultant and was interviewed before Sep 2020. There were 3 interview rounds.
I applied via Job Portal and was interviewed before Apr 2021. There was 1 interview round.
Solid principles are a set of design principles for writing maintainable and scalable code in C#.
Single Responsibility Principle (SRP) - a class should have only one reason to change
Open/Closed Principle (OCP) - a class should be open for extension but closed for modification
Liskov Substitution Principle (LSP) - derived classes should be substitutable for their base classes
Interface Segregation Principle (ISP) - client...
I applied via Campus Placement and was interviewed before May 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Apr 2020. There were 5 interview rounds.
I applied via Campus Placement and was interviewed before Jan 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before May 2020. There were 4 interview rounds.
I applied via Walk-in and was interviewed before May 2020. There was 1 interview round.
based on 1 interview
Interview experience
TCS
Accenture
Wipro
Cognizant