Contacted HR through LinkedIn post. HR was really helpful in keeping the schedule flexible.

Round 1:
Validate Sum Tree . Implement Top Down, Bottom UP . Pros and Cons of both approaches

Implement a special Data Structure , to allow O(1) Insert, delete, random

Some C++ related questions Stack corruption, heap ,stack memory basic.

Round 2:

Longest Univalue tree. Means all node in subtree should have same value. Count the max node in that sub tree.
Virtual memory , PCB,Memory allocation for static variable ,this .Puzzle

Round 3:
Memory leak, dangling pointer, wild pointer
Max possible sum using all value of array with no two value beibg adjacent to each other in array.
shorted possible string with all word from a given string, order should be maintained
Puzzle,simple c++ question

Round 4:
Implement string Tokenizer to return a string token , N string token, Nth string token, reset the tokenizer.Some behavioural questions.

Compensation Offered : https://leetcode.com/discuss/compensation/2044931/Adobe-CS-I-NOIDA-C%2B%2B-6.5-YOE