1) Round 1 (Hackerearth 90 minutes)\n2) Round 2 (DS Algo, Java)\n   * DP question similar to https://leetcode.com/problems/unique-paths-ii/\n   * DP question : https://leetcode.com/problems/get-the-maximum-score/\n   * Binary Tree Maximum Path Sum : https://leetcode.com/problems/binary-tree-maximum-path-sum/\n   * How Static methods and instance methods take part in multi-threaded application.\n   * HashMap internal implementation, changes in java 1.8 onwards.\n   * When to override equals and hashcode method.\n3) Round 3 (DS ALgo)\n   * Inorder traversal of the mirror image of the binary tree.\n         3\n      4     5         ->  9, 5, 8, 3, 7, 4, 6\n    6   7 8    9\n\n   * Group Anagrams : https://leetcode.com/problems/group-anagrams/\n4) Round 4 (Design)\n   * HLD for payment service like Phonepe, generating unique transaction id for each transactions.\n   * LLD for Bookmyshow type app. Discussion on how to effectively handling concurrent booking, db design, class design.\n5) Round 5 (Director round)\n   * Design of the current project.\n   * Flaws in current project architecture and how to restructure with a new design.\n   * Discuss on youtube HLD design in 10 minutes.\n   * Innovations in current project.

1) Round 1 (Hackerearth 90 minutes)\n2) Round 2 (DS Algo, Java)\n   * DP question similar to https://leetcode.com/problems/unique-paths-ii/\n   * DP question : 

Visa | Senior Software Engineer | Bangalore, India | July[Offer]