# Tag Archives: Snapdeal

Given two sorted arrays A[] and B[] of sizes N and M respectively, the task is to merge them in a sorted manner. Examples: Input:… Read More
Round 1: Coding round which had 10 MCQs based on JAVA and MYSQL along with 4 coding questions. The total duration was 75 mins (15… Read More
Given two sorted arrays, arr[], brr[] of size N, and M, the task is to merge the two given arrays such that they form a… Read More
CV shortlisting Round: Total 92 students applied from all the branches of college (B.TECH’2020 BATCH + M.TECH ‘2021 BATCH) for internship in Snapdeal as a… Read More
CV shortlisting : Total 70 students applied  from all the three branches of circuital(CSE, ECE and EE) for internship in Snapdeal as a product analyst… Read More
Round 1: 1.Find the top view of binary tree. 2.Sort an array containing only digit 1, 2 and 3 in O(n) time. 3.E.g 2, 1,… Read More
Round 1:  Pure Core Java Round.Emphasis on basics (String immutability, Exception handling, Generics). Round 2:  In second round, interviewer asked me to write pseudo code… Read More
Given an integer N, write a program that returns true if the given number is a palindrome, else return false. Examples:   Input: N = 2002 Output:… Read More
I applied in Snapdeal through Naukri.com job portal. Currently I am working as a Web developer and I got the call from Snapdeal for the… Read More
Given an arr[] containing n integers and a positive integer k. The problem is to find the length of the longest subarray with sum of… Read More
Given two sorted arrays, we need to merge them in O((n+m)*log(n+m)) time with O(1) extra space into a sorted array, when n is the size… Read More
The diameter of a tree is the number of nodes on the longest path between two leaves in the tree. The diagram below shows two… Read More
We have given an anagram string and we have to check whether it can be made palindrome o not. Examples:  Input : geeksforgeeks Output : No… Read More
The diameter of a tree (sometimes called the width) is the number of nodes on the longest path between two leaves in the tree. The… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function). Examples:   Inputs: 1->2->3->4->5->6->7->8->NULL and k =… Read More