.Given an array whose index represents houses and value at that index represents the size of that house.you have to find minimum cost for repairing . if the adjacent house size id smaller then the cost of repairing will always be higher than adjacent smaller house.

Given the array houses where houses[i] is the location of the ith house along a street and an integer k, allocate k mailboxes in the street.Return the minimum total distance between each house and its nearest mailbox.The test cases are generated so that the answer fits in a 32-bit integer.

Create an array of objects and display details of N buildings along with the total cost

Write an algorithm for predicting house prices based on features like size, location,and number of bedrooms

Draw a flowchart that will calculate the price of building a house. The price of the house is based on three things:The quality of the interiorThe lot sizeThe size of the houseThe realtor enters the number for each item, not the name. The clerk will not enter the numbers that they can’t control such as the prices. For example: everyone who buys a custom home pays $1000 for each 500 square feet of lot and $500 for each 100 square feet of house.Output the cost for one person buying a house. People may only buy one house.Trace the program 3 times: once for each type of home, make up your own data.Data Related to Quality and Size of HouseQuality of house Type of house Price per 500 sq. ft of lot Price per 100 sq. ft of house1 Custom Home $1000 $5002 Mid-quality $700 $4003 Economy $500 $300

Problem statementSend feedbackYou are given an array ‘A’ of length ‘N’. You say an index ‘i’ is beautiful if the sum of the first ‘i - 1’ elements of the array ‘A’ equals the sum of the last ‘N - i’ elements of the array ‘A’, where ‘i’ is in 1-based indexing. Now you wonder which is the leftmost beautiful index.Note: If you select the first index, then the sum of the prefix will be ‘0’, and if you select the last index, then the sum of the suffix will be ‘0’.Note: You have to print the index in 1-based indexing.For example:Let’s say the array ‘A’ = [1, 3, 1, 5], then if we select index ‘2’, the sum of the prefix is ‘1’, and the sum of the suffix is 1 + 5 = 6. Since the sum is not the same, hence index ‘2’ is not a beautiful index.Detailed explanation ( Input/output format, Notes, Images )Constraints -1 <= ‘T’ <= 101 <= ‘N’ <= 10^5 -10^9 <= A[i] <= 10^9, for 1 <= i <= ‘N’Note- Sum of ‘N’ over all test cases does not exceed 10^5.Time Limit: 1 secSample Input-1231 1 131 2 3Sample Output-12-1Explanation for Sample Input 1:For test case 1: Index ‘2’ is the leftmost beautiful index. The left sum is 1 and the right sum is also 1.For test case 2: No index is beautiful.Sample Input -2261 7 3 6 5 632 1 -1Sample Output -241