Round 1: 1) minimum-value-to-get-positive-step-by-step-sum. https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/ 2) Minimize sum of squares of adjacent elements difference. https://www.geeksforgeeks.org/minimize-sum-of-squares-of-adjacent-elements-difference/ Round 2: 1) Longest common subsequence(DP) https://leetcode.com/problems/longest-common-subsequence/ 2) Find the remaining vertices of a square from two given vertices https://www.geeksforgeeks.org/find-the-remaining-vertices-of-a-square-from-two-given-vertices/ Unfortunately, I did not qualify for round 3 :(

How are you going to approach decentralisation in your project? (Project based question)