Visa interview questions

Showing 1–27 of 27 results

• Assemble a RAG Pipeline From Provided Python Interfaces and Explain RetrievalMedium

  Assemble a retrieval-augmented generation pipeline from provided Python interfaces, covering chunking, embedding, vector search and grounded prompting, then explain why embeddings and cosine similarity work for retrieval and when RAG beats fine-tuning or long context. It tests applied LLM engineering and clear reasoning with unfamiliar tooling.

  VisaSoftware EngineerMachine LearningOnsite
• Assess Cultural Fit and Motivation in Visa InterviewMedium

  This interview question evaluates behavioral evidence, ownership, communication, trade-offs, and measurable outcomes in a realistic interview setting. A strong answer for Assess Cultural Fit and Motivation in Visa Interview states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  VisaData ScientistBehavioral & LeadershipHR Screen
• Behavioral: Solving a Hard Problem Simply and Breaking a Complex Project Into PartsMedium

  Two senior behavioral prompts about complexity: describe a hard problem you solved with a simple solution, and a time you split a complex project into manageable parts. They probe judgment about simplicity, handling ambiguity, decomposition and sequencing, personal ownership, and measurable results.

  VisaSoftware EngineerBehavioral & LeadershipOther
• Compute distinct sums from limited coinsMedium

  This question evaluates algorithmic problem-solving skills in combinatorics and resource-constrained subset-sum computation, focusing on dynamic programming, optimization, and complexity analysis within the Coding & Algorithms domain.

  VisaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Connected Groups in a Relationship MatrixMedium

  Determine the number of connected components in an undirected graph represented by an adjacency matrix, accounting for transitive relationships.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count Cross-Array Pairs with a Target SumMedium

  Tests linear-time frequency-map counting across two independent arrays to find pairs that sum to a target, properly accounting for duplicates and 64-bit integer overflow.

  VisaSoftware Engineer ICoding & AlgorithmsOnline Assessment
• Count Islands in a Binary GridMedium

  This problem tests graph traversal techniques on a 2D grid, focusing on identifying connected components without modifying the original input or exceeding recursion limits.

  VisaSoftware Engineer ICoding & AlgorithmsOnline Assessment
• Count Space-Separated Words Made Only of Letters and Basic PunctuationMedium

  A string-processing coding problem: split a sentence on spaces and count the tokens that contain only English letters and the punctuation marks comma, period, question mark and exclamation mark. It tests careful tokenization with repeated spaces and exact character-class rules.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count Subsequences That Move Between PositionsHard

  This problem tests dynamic programming skills, specifically the ability to count subsequences that satisfy a positional movement constraint based on element parity.

  VisaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design E-Commerce Tables and Indexes for Recent-Spend QueriesMedium

  This question tests database schema normalization, data integrity in e-commerce transactions, and the ability to optimize SQL queries using indexing strategies.

  VisaSoftware Engineer ISystem DesignOnline Assessment
• Design a Ride-Hailing Backend That Matches Riders With Nearby DriversMedium

  Design the backend of an Uber-style ride-hailing service that matches riders with nearby drivers, streams live locations, and tracks trips to completion. It tests requirement scoping, geospatial indexing for moving drivers, race-free dispatch, real-time updates, failure handling, and the ability to lead a design discussion.

  VisaSoftware EngineerSystem DesignOnsite
• Design an experiment assignment serviceHard

  This question evaluates system-design and analytics competencies for online experimentation platforms in the Analytics & Experimentation domain, focusing on deterministic sticky assignment, configuration storage, eligibility targeting, traffic allocation, mutual exclusion, overrides, exposure logging, metric tagging, privacy/compliance, latency and availability targets, experiment lifecycle, and high-level architecture. It is commonly asked because it assesses both conceptual understanding and practical system-design application of distributed-system trade-offs, scalability, data integrity, operational reliability, and privacy constraints, and gauges the ability to define high-level APIs, architecture, and justify key trade-offs.

  VisaSoftware EngineerAnalytics & ExperimentationTechnical Screen
• Design rotating warehouse simulator with closuresMedium

  This question evaluates algorithmic skills in designing efficient dynamic data structures and performing event-driven simulation with mutable state, specifically managing cyclic capacity resets and permanent closures in the Coding & Algorithms domain.

  VisaSoftware EngineerCoding & AlgorithmsOnsite
• Earliest K-Minute Meeting Start from Text Schedules with Inclusive Busy TimesMedium

  A scheduling coding problem: given everyone's busy intervals as text entries with inclusive minute times, find the earliest start for a meeting of k minutes after the day's first busy minute, or report that none exists. It tests time parsing, merging overlapping intervals and off-by-one boundaries.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find the Index of a Target in a Sorted Array of Distinct IntegersMedium

  Practice locating a target value in a strictly increasing array of distinct integers, returning its zero-based index or -1 when it is absent. The task checks logarithmic-time search over sorted data, precise loop boundaries, and correct handling of single-element arrays and values that fall between or outside the stored elements.

  VisaSoftware EngineerCoding & AlgorithmsOnsite
• Find the Minimum Edge Score on a Path Between Two CitiesMedium

  This problem tests the ability to optimize for the bottleneck edge in a path rather than the total path cost, typically solvable using a modified Dijkstra's algorithm or a Union-Find approach.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find the Shortest Distance in a Weighted Undirected GraphMedium

  This problem tests the implementation of Dijkstra's algorithm using a priority queue to find the shortest path in a weighted undirected graph.

  VisaSoftware Engineer ICoding & AlgorithmsOnline Assessment
• Java Fundamentals: Polymorphism and Monolith Versus MicroservicesMedium

  A Java fundamentals question pair: explain polymorphism, including overriding, dynamic dispatch and overload resolution, and compare monolithic and microservices architectures. It tests precise language mechanics, concrete examples, and balanced reasoning about deployment, scaling, consistency and operational trade-offs.

  VisaSoftware EngineerSoftware Engineering FundamentalsOnsite
• Longest Strictly Rising Four-Direction Walk in an Integer GridMedium

  A grid coding problem: find the length of the longest walk of strictly increasing values in an integer matrix, moving only up, down, left or right. It tests modeling a grid as a graph, handling equal neighboring values correctly, and an efficient search over grids of up to 40,000 cells.

  VisaSoftware EngineerCoding & AlgorithmsOnsite
• Maintain pair-sum counts under replacementsMedium

  This question evaluates the ability to design dynamic data structures and perform algorithmic complexity analysis for maintaining pair-sum counts under element replacements, testing skills in efficient query/update handling and scalability.

  VisaSoftware EngineerCoding & AlgorithmsOnsite
• Maximize Index-Weighted Array Sum When Each Element Swaps at Most OnceMedium

  An array optimization problem: maximize the sum of each element times its index when any two elements may be swapped but every element can take part in at most one swap. It tests modeling the at-most-once rule precisely and finding the best set of disjoint swaps within small input limits.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Product Roadmap & Stakeholder Trade-offsMedium

  Practice explaining an end-to-end product roadmap process with stakeholder trade-offs. The solution covers outcome-driven planning, input collection, prioritization frameworks, alignment rituals, Now/Next/Later planning, and a concrete example balancing sales, risk, engineering, and customer needs.

  VisaProduct ManagerProduct / Decision MakingTechnical Screen
• Query the Top Ten Customers by Recent SpendMedium

  This problem tests proficiency in SQL aggregation, window functions, and joining across normalized transactional tables to perform time-bound analysis.

  VisaSoftware Engineer IData Manipulation (SQL/Python)Online Assessment
• Resolve Team Conflicts: Actions and Outcomes ExploredMedium

  This interview question evaluates behavioral evidence, ownership, communication, trade-offs, and measurable outcomes in a realistic interview setting. A strong answer for Resolve Team Conflicts: Actions and Outcomes Explored states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  VisaData ScientistBehavioral & LeadershipTechnical Screen
• Shortest Prefix of a Digit String That Can Build Every Permutation of a TargetMedium

  Given a digit string and a list of digit targets, return for each target the length of the shortest prefix whose characters could build every permutation of that target, or -1 if no prefix can. It tests character frequency counting, precomputation over a string, and answering many queries efficiently.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve Three Array Coding ProblemsMedium

  This multi-part question evaluates algorithmic problem-solving skills in array manipulation, optimization (maximizing capped contributions), modular combinatorics (counting divisible-sum triplets), and sequence selection/dynamic decision-making for longest selectable non-decreasing subarrays.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Tell me about yourself and trade-offsMedium

  Prepare Visa PM recruiter answers for self-introduction, why Visa, and stakeholder tradeoffs. The solution uses Present-Past-Future and STAR structures, emphasizing payments scale, trust, compliance, risk, conversion, and cross-functional product judgment.

  VisaProduct ManagerBehavioral & LeadershipTechnical Screen