SDE - 1

Implement a ride-sharing application with the below-expected features.Features:The application allows users to share rides on a route.Users can either offer a shared ride (Driver) or consume a shared ride (Passenger).Users can search and select one from multiple available rides on a route with the same source and destination.The requirements were: Application should allow user onboarding. add_user(user_detail) Add basic user detailsadd_vehicle(vehicle_detail) Add the user’s vehicle(s) detailsUser should be able to offer a shared ride on a route with details. offer_ride(ride_detail) Ride will have details like vehicle, origin, destination, available seats. (A ride will have no intermediate stops.)Users can select a ride from multiple offered rides using a selection strategy. (A user can only request  a ride (only for 1 or 2 people)) select_ride(source, destination, seats, selection_strategy) Preferred Vehicle (Activa/Polo/XUV)Most Vacant.System should be able to end the ride. User can only offer a ride for a given vehicle, once there are no active offered rides for that vehicle. end_ride(ride_details)Find total rides offered/taken by all users. print_ride_stats()Bonus Question:If the user’s origin/destinations are not available directly but it’s possible via multiple rides, then the application should output multiple rides. (Example: for input: Bangalore to Mumbai, the output can be Bangalore to Goa and Goa to Mumbai)

Ninja has been given a matrix ‘MAT’ of integers having size ‘N’ x ‘M’ i.e. N rows and M columns. Ninja has to find the maximum sum submatrix in it. In other words, he has to find the maximum sum over all submatrices in the matrix.

For example: For the ‘MAT’ given below, the maximum sum submatrix having a sum of 29 is highlighted in red.

You are given an array of size ‘N’. The elements of the array are in the range from 1 to ‘N’.

Ideally, the array should contain elements from 1 to ‘N’. But due to some miscalculations, there is a number R in the range [1, N] which appears in the array twice and another number M in the range [1, N] which is missing from the array.

Your task is to find the missing number (M) and the repeating number (R).

For example:

Consider an array of size six. The elements of the array are { 6, 4, 3, 5, 5, 1 }. 
The array should contain elements from one to six. Here, 2 is not present and 5 is occurring twice. Thus, 2 is the missing number (M) and 5 is the repeating number (R). 

Follow Up

Can you do this in linear time and constant additional space? 

What are your expectations?

What keeps you motivated?