## Round 1\n[https://leetcode.com/problems/rotting-oranges/](https://leetcode.com/problems/rotting-oranges/)\n[https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/)\n\n## Round 2\n[https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/)\n[https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/)\n\n## Round 3\nA concurrent systems design problem\n\n## Round 4\nA mix of technical and behavior round. \n\ntechnical question - Design a Cricbuzz mobile plugin that is installed on a mobile device and keeps on fetching the current score of a given match from the Cricbuzz website. \n\n## Round 5\nBehaviour round with Director\n\nResult : Got the offer for CS1 in Adobe creative cloud team

Round 1\nhttps://leetcode.com/problems/rotting-oranges/\nhttps://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/\n\n## Round 2\nhttps://leetcode.c