# Tag Archives: STL

## Walmart Lab Interview Experience | Set 8 (Off-Campus 3 Years Experience)

Round 1 (Coding round): 1) Range [L, R] is given. Need to find what is the maximum repeating digit in prime numbers between L and… Read More »

## Check if an array can be divided into pairs whose sum is divisible by k

Given an array of integers and a number k, write a function that returns true if given array can be divided into pairs such that… Read More »

## Reorder an array according to given indexes

Given two integer arrays of same size, “arr[]” and “index[]”, reorder elements in “arr[]” according to given index array. It is not allowed to given… Read More »

## Sort a stack using recursion

Given a stack, sort it using recursion. Use of any loop constructs like while, for..etc is not allowed. We can only use the following ADT… Read More »

## MakeMyTrip Interview Experience | Set 9 (Off-Campus for Sr. Android developer))

First round (Written) : 1. 4 Android questions: a) What’s Recyclerview? Describe all components of Recyclerview with all callbacks and the benefits of Recyclerview. b)… Read More »

## MakeMyTrip Interview Experience | Set 7 (On-Campus)

Recently makemytrip visited our Campus and I got selected in recruitment drive.The placement drive consisted of 4 rounds. Round1: MCQ and coding round It was… Read More »

## Walmart Labs Interview Experience | Set 3 (On-Campus)

Walmart Labs Interview Experience – On campus 1st round (Online Test) It was an online test of 90 minutes and was conducted on Hackerearth. It… Read More »

## One97 Interview Experience | Set 3 (Backend/Node js Developer)

Round 1 Q1. Multiply two 2d matrices Q2 You are given a stack in which element are filled at runtime. And normal push and pop… Read More »

## Find all distinct palindromic sub-strings of a given string

Given a string of lowercase ASCII characters, find all distinct continuous palindromic sub-strings of it. Examples: Input: str = “abaaa” Output: Below are 5 palindrome… Read More »

## Intuit Interview Experience | Set 7 (For 3.5 Years Experienced)

1st Round : (2 hrs) 1. Implement LRU Cache, 2. Implement your own Blocking Queue. 3. Questions on Collections , a. How AtomicInteger works b.… Read More »

## Find if there is a subarray with 0 sum

Given an array of positive and negative numbers, find if there is a subarray (of size at-least one) with 0 sum. Examples : Input: {4,… Read More »

## LRU Cache Implementation

How to implement LRU caching scheme? What data structures should be used? We are given total possible page numbers that can be referred. We are… Read More »

## Design and Implement Special Stack Data Structure | Added Space Optimized Version

Question: Design a Data Structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin() which should return… Read More »

## Queue using Stacks

The problem is opposite of this post. We are given a stack data structure with push and pop operations, the task is to implement a… Read More »