YOE: 3.5 years\nCurrent Org: Reknowned Fintech firm\n\nRound 1(DSA):\nhttps://leetcode.com/problems/wiggle-subsequence/\nI was able to solve in O(n^2), he asked me optimize to O(n), I failed to do it in some attempts so we moved to next problem\nhttps://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/\nHe accepted the approach only, didn\'t ask me to code completely\n\nRound 2\ni expected LLD, but to my surprise the Interviewer asked basic questions related to design and work.\n-> CAP Theorem\n-> Difference between git merge and git rebase\n-> Difference between HTTP and HTTPS and which type of encryption is used in HTTPS\n->Design patterns and SOLID Design principles\n-> Micro services vs Monolith\n\n\nRound 3(HM)\nDesign a payments system, and asked me to consider cases where we might face duplicate payments\n\n\n\n

YOE: 3.5 years\nCurrent Org: Reknowned Fintech firm\n\nRound 1(DSA):\nhttps://leetcode.com/problems/wiggle-subsequence/\nI was able to solve in O(n^2), he asked