Skip to content

Tag Archives: Visa

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 Round The written tests covered almost… 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… 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
Given a boolean 2D matrix, find the number of islands. A group of connected 1s forms an island. For example, the below matrix contains 5… Read More
Given a string, find the longest substring which is palindrome.  For example,  Input: Given string :"forgeeksskeegfor", Output: "geeksskeeg" Input: Given string :"Geeks", Output: "ee" Recommended:… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type: (i) Pointer to next node in the… Read More
Given an unsorted array and a number n, find if there exists a pair of elements in the array whose difference is n. Examples: Input:… Read More
Given an unsorted array of nonnegative integers, find a continuous subarray which adds to a given number. Examples : Input: arr[] = {1, 4, 20,… Read More
  Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and… Read More
Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack.… Read More