Round 1 : DSA: 1)print all pairs with a target sum in an array (with frequency of elements). 2) Array to BST. 3) Top view of Binary Tree. 4) Minimum number of jumps to reach the end of an array

Question

Accepted Answer

DSA questions on array and binary tree manipulation

For printing pairs with target sum, use a hash table to store frequency of elements and check if complement exists
For converting array to BST, use binary search to find the middle element and recursively build left and right subtrees
For top view of binary tree, use a queue to traverse the tree level by level and store horizontal distance of nodes
For minimum number of jumps, use dynamic programming to find minimum jumps required to reach each index

Round 1 : DSA: 1)print all pairs with a target sum in an array (with frequency of elements). 2) Array to BST. 3) Top view of Binary Tree. 4) Minimum number of jumps to reach the end of an array

Popular interview questions of Software Engineer II

Top HR questions asked in Walmart Software Engineer II