u/Regular-Motor-382

Solved 1st question 12/12, and 3rd question 4/12
The first was length and materials qn, sort in descending, make pairs of different materials, find total of the smallest number from the pairs.
3rd qn was find the largest diamond of 1’s area in a matrix(m and n max size was 500). Solved using bruteforce dfs 😭.
Second question was like we have 3 different weights of mass 1,2,3. We have to arrange them such that no two adjacent weights are same, while calculating the sum, if the sum is odd then the previous weight and next weight difference should be < 1.
What are the chances of getting interview?