Skip to content

Tag Archives: Visa

Consider a big party where a log register for guest’s entry and exit times is maintained. Find the time at which there are maximum guests… Read More
Preliminary Round: (75 minutes test on Mettle) This test comprises of MCQ and Coding Questions. Following are the details of the test: MCQ question:Hey geek!… Read More
Given a sequence of moves for a robot, check if the sequence is circular or not. A sequence of moves is circular if first and… Read More
Written Round: 75 minutes Test on Mettle. Assessment Composition: 1. Coding Skills: 2 Questions (One ques is from DP(easy one like 0-1 knapsack) and other… Read More
Written Round: 75 minutes Test on Mettle. Assessment Composition: 1. Coding Skills: 2 Questions (One que is from DP(easy one like 0-1 knapsack) and other… Read More
Prelims : Online Test in Mettl.com 75 minutes Test on Mettle.Hey geek! It's time to become a success story instead of reading them. Check out… Read More
I had three rounds of interviews for Visa on campus (all technical). First round majorly focused on the projects I had done as part of… Read More
Visa Inc. (On – Campus, Day 1) Preliminary Round : 75 minutes Test on Mettle. Assessment Composition: 1. Coding Skills: 2 Questions 2. Programming: 10… Read More
Visa Inc. came to our campus for placements. There was one written round (mettl.com) and 3 PI rounds. Written RoundHey geek! It's time to become… Read More
Given two strings str1 and str2, find if str1 is a subsequence of str2. A subsequence is a sequence that can be derived from another… Read More
  We strongly recommend to refer following post as a prerequisite of this post.Linked List Introduction Inserting a node in Singly Linked ListA Doubly Linked List… Read More
Given an array of integers. Find a peak element in it. An array element is a peak if it is NOT smaller than its neighbours.… Read More
A directed graph is strongly connected if there is a path between all pairs of vertices. A strongly connected component (SCC) of a directed graph… Read More
Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the minimum… Read More
Given a Balanced Binary Search Tree and a target sum, write a function that returns true if there is a pair with sum equals to… Read More

Start Your Coding Journey Now!