Visa Interview Questions

Review this list of 30 Visa interview questions and answers verified by hiring managers and candidates.
  • Visa logoAsked at Visa 
    +2

    "public static List Merge(List array1, List array2) { if (array1.Count == 0) return array2; if (array2.Count == 0) return array1; var result = new List(); // Identify starting array, array with largest starting element var array = array1[0] > array2[0] ? array2 : array1; var other = array1[0] > array2[0] ? array1 : array2; // loop until we hit end of an array int arrayIndex = 0; int otherIndex = 0; while(arrayIndex"

    Mark S. - "public static List Merge(List array1, List array2) { if (array1.Count == 0) return array2; if (array2.Count == 0) return array1; var result = new List(); // Identify starting array, array with largest starting element var array = array1[0] > array2[0] ? array2 : array1; var other = array1[0] > array2[0] ? array1 : array2; // loop until we hit end of an array int arrayIndex = 0; int otherIndex = 0; while(arrayIndex"See full answer

    Software Engineer
    Data Structures & Algorithms
    +4 more
  • Visa logoAsked at Visa 
    Program Manager
    Behavioral
  • Visa logoAsked at Visa 
    +17

    " O(n) time, O(1) space from typing import List def maxsubarraysum(nums: List[int]) -> int: if len(nums) == 0: return 0 maxsum = currsum = nums[0] for i in range(1, len(nums)): currsum = max(currsum + nums[i], nums[i]) maxsum = max(currsum, max_sum) return max_sum debug your code below print(maxsubarraysum([-1, 2, -3, 4])) `"

    Rick E. - " O(n) time, O(1) space from typing import List def maxsubarraysum(nums: List[int]) -> int: if len(nums) == 0: return 0 maxsum = currsum = nums[0] for i in range(1, len(nums)): currsum = max(currsum + nums[i], nums[i]) maxsum = max(currsum, max_sum) return max_sum debug your code below print(maxsubarraysum([-1, 2, -3, 4])) `"See full answer

    Software Engineer
    Data Structures & Algorithms
    +4 more
  • Visa logoAsked at Visa 

    "An Object Oriented programming deals with data and members. An Object Oriented Programming consumes more memory. An OOPS Consist of bottom-up approach. An OOPS is more secure Than POP. POP. An POP deals with Functions. An POP is less secure compare to OOPS. An POP contains less memory. An POP doesnt contain acess Modifiers."

    Arun G. - "An Object Oriented programming deals with data and members. An Object Oriented Programming consumes more memory. An OOPS Consist of bottom-up approach. An OOPS is more secure Than POP. POP. An POP deals with Functions. An POP is less secure compare to OOPS. An POP contains less memory. An POP doesnt contain acess Modifiers."See full answer

    Software Engineer
    Concept
  • "// Helper function to calculate the Euclidean distance between two points function distance(p1, p2) { return Math.sqrt(Math.pow(p1[0] - p2[0], 2) + Math.pow(p1[1] - p2[1], 2)); } // A helper function to find the closest pair in a given set of points within the strip function closestPairInStrip(strip, d) { let minDist = d; // Start with the current minimum distance strip.sort((a, b) => a[1] - b[1]); // Sort the strip by y-coordinate for (let i = 0; i < strip.length; i++) { "

    Vishnu V. - "// Helper function to calculate the Euclidean distance between two points function distance(p1, p2) { return Math.sqrt(Math.pow(p1[0] - p2[0], 2) + Math.pow(p1[1] - p2[1], 2)); } // A helper function to find the closest pair in a given set of points within the strip function closestPairInStrip(strip, d) { let minDist = d; // Start with the current minimum distance strip.sort((a, b) => a[1] - b[1]); // Sort the strip by y-coordinate for (let i = 0; i < strip.length; i++) { "See full answer

    Machine Learning Engineer
    Coding
    +1 more
  • 🧠 Want an expert answer to a question? Saving questions lets us know what content to make next.

  • Visa logoAsked at Visa 
    +7

    "from typing import List def traprainwater(height: List[int]) -> int: if not height: return 0 l, r = 0, len(height) - 1 leftMax, rightMax = height[l], height[r] res = 0 while l < r: if leftMax < rightMax: l += 1 leftMax = max(leftMax, height[l]) res += leftMax - height[l] else: r -= 1 rightMax = max(rightMax, height[r]) "

    Anonymous Roadrunner - "from typing import List def traprainwater(height: List[int]) -> int: if not height: return 0 l, r = 0, len(height) - 1 leftMax, rightMax = height[l], height[r] res = 0 while l < r: if leftMax < rightMax: l += 1 leftMax = max(leftMax, height[l]) res += leftMax - height[l] else: r -= 1 rightMax = max(rightMax, height[r]) "See full answer

    Software Engineer
    Data Structures & Algorithms
    +4 more
  • Software Engineer
    Behavioral
  • Visa logoAsked at Visa 
    Software Engineer
    Coding
    +1 more
  • Visa logoAsked at Visa 

    "Evaluate product performance metrics against projections, rationalize performance, and identify opportunities to optimize performance"

    Frank A. - "Evaluate product performance metrics against projections, rationalize performance, and identify opportunities to optimize performance"See full answer

    Product Strategy
    Analytical
    +1 more
Showing 21-30 of 30