Following is a typical recursive implementation of Merge Sort that uses last element as pivot. /* Recursive C program for merge sort */ #include <stdio.h>… Read More

Following is a typical recursive implementation of Merge Sort C++ // Recursive C++ program for merge sort #include<bits/stdc++.h> using namespace std; // Function to… Read More

Recently I got interviewed on phone for De Shaw Hyderabad (1 hr) 1. Tell me about yourself and your current work. 2. Why you like… Read More

A brief documentation of my SAP Labs India interview Round 1 : Statement Round We were 5 people and given a problem statement and we… Read More

Hash Table supports following operations in Θ(1) time. 1) Search 2) Insert 3) Delete The time complexity of above operations in a self-balancing Binary Search… Read More

1st round online test- 1. Psychometric Test 2. General Aptitude 3. Analytical Aptitude 4. Verbal Skills 5. Computer Skills 6. Coding Skills Coding ques –… Read More

Given an unsorted array with repetitions, the task is to group multiple occurrence of individual elements. The grouping should happen in a way that the… Read More

Given an array that is sorted and then rotated around an unknown point. Find if the array has a pair with a given sum ‘x’.… Read More

Given a string ‘str’ of digits and an integer ‘n’, build the lowest possible number by removing ‘n’ digits from the string and not changing… Read More

Given an array and a number ‘x’, write a function to delete ‘x’ from the given array. We assume that array maintains two things with… Read More

Write a function subtract(x, y) that returns x-y where x and y are integers. The function should not use any of the arithmetic operators (+,… Read More

Write a function that searches a given key ‘x’ in a given singly linked list. The function should return true if x is present… Read More

I had recently given Interview at Lenskart.com for Application Developer First Round Telephonic with HR on some basic stuff. Next was the round where i… Read More

Write a function to count the number of nodes in a given singly linked list. For example, the function should return 5 for linked list… Read More

Given a universe U of n elements, a collection of subsets of U say S = {S1, S2…,Sm} where every subset Si has an associated… Read More