1) Round 1 (Hackerearth 90 minutes) 2) Round 2 (DS Algo, Java) DP question similar to https://leetcode.com/problems/unique-paths-ii/ DP question : https://leetcode.com/problems/get-the-maximum-score/ Binary Tree Maximum Path Sum : https://leetcode.com/problems/binary-tree-maximum-path-sum/ How Static methods...

This Visa interview question has 4 community responses on LeakCode. Unlock Premium to read full candidate answers and discussion.

LeetCode Question · Jul 2021 · Bangalore

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

SWE Phone Screen Senior

8 upvotes 5,781 views 4 replies

Question Details

1) Round 1 (Hackerearth 90 minutes) 2) Round 2 (DS Algo, Java) DP question similar to DP question : Binary Tree Maximum Path Sum : How Static methods...

Full Details

🔒

Unlock all Visa questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a visa interview for a swe role (senior level) during the phone screen round reported in 2021.

It covers the following topics: Binary Tree, Dynamic Programming, Hash Table, Oop, Strings .

Topics

Binary Tree Dynamic Programming Hash Table Oop Strings

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

Question Details

Full Details

About This Question

Topics

More Visa Interview Questions