## Converting an array of integers into Zig-Zag fashion!

Let us elaborate the problem a little more. Basically, we are given an array of integers and we need to arrange this array in an… Read More »

- Minimize the maximum difference between adjacent elements in an array
- Maximum sum path in a Matrix
- Stack of Pair in C++ STL with Examples
- Set of Vectors in C++ STL with Examples
- Why Data Structures and Algorithms Are Important to Learn?
- Queue of Pairs in C++ STL with Examples
- Count of subarrays which start and end with the same element
- Inorder traversal of an N-ary Tree
- Minimum cost to reach from the top-left to the bottom-right corner of a matrix
- Convert Adjacency Matrix to Adjacency List representation of Graph
- Implementing upper_bound() and lower_bound() for Ordered Set in C++
- Longest Mountain Subarray
- Program to reverse words in a given string in C++
- Find the string formed by joining k consecutive nodes of linked list
- Check whether the given string is Palindrome using Stack
- Reverse an array in groups of given size | Set 3 (Single traversal)
- Count triplets such that sum of any two number is equal to third | Set 2
- CamelCase Pattern Matching
- Count ways to partition a string such that both parts have equal distinct characters
- Why Prim’s and Kruskal's MST algorithm fails for Directed Graph?
- What is a Webcrawler and where is it used?
- Duplicates Removal in Array using BST
- Dynamic Segment Trees : Online Queries for Range Sum with Point Updates
- Number of factors of very large number N modulo M where M is any prime number
- Maximum Possible Rating of a Coding Contest
- Design a Queue data structure to get minimum or maximum in O(1) time
- Find the K closest points to origin using Priority Queue
- Perform append, update, delete and range sum queries on the given array
- Construct BST from given preorder traversal | Set 3 (Naive Method)
- Paranthesis Theorem

Let us elaborate the problem a little more. Basically, we are given an array of integers and we need to arrange this array in an… Read More »

Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. Example: Input: Root of… Read More »

Given a matrix of characters. Find length of the longest path from a given character, such that all characters in the path are consecutive to… Read More »

Given two strings A and B, the task is to convert A to B if possible. The only operation allowed is to put any character… Read More »

Amazon visits our campus for recruitment. Here I am sharing my experience of the whole process. Round 1: First there was an online round on… Read More »

Amazon came to our college. Here is my interview experience. There were total 5 rounds. First Round (1.5 hr)- It consist of two sections ->… Read More »

Given an array of integers, find the length of the longest sub-sequence such that elements in the subsequence are consecutive integers, the consecutive numbers can… Read More »

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 »

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap… Read More »

There are n-pairs and therefore 2n people. everyone has one unique number ranging from 1 to 2n. All these 2n persons are arranged in random… Read More »

Accolite Interview Experience (On-Campus) Round 1 (Written) Around 190 students appeared for the online test which consists of 30MCQ’s to be done in 30minutes, questions… Read More »

Expression tree is a binary tree in which each internal node corresponds to operator and each leaf node corresponds to operand so for example expression… Read More »

We strongly recommend to refer below post as a prerequisite of this. Hashing | Set 1 (Introduction) Hashing | Set 2 (Separate Chaining) Open Addressing… Read More »

Given a matrix of dimension m*n where each cell in the matrix can have values 0, 1 or 2 which has the following meaning: 0:… Read More »

Round 1 (Written) Around 140 students appeared for the offline test. There were 20 MCQs that to be done in (30 minutes), questions were from… Read More »