## Calculate 7n/8 without using division and multiplication operators

Leave a comment | Filed under Bit MagicGiven an integer, write a function that calculates ⌈7n/8⌉ (ceiling of 7n/8) without using division and multiplication operators.

Read More »Profile: Automation Testing/Manual Testing Process: Written Test (90 Minutes) + 2 Technical Interviews.

Read More »## Flipkart Interview Experience | Set 27 (For SDE)

Leave a comment | Filed under Interview ExperiencesTelephonic Round: It was an exploratory discussion with the hiring manager. More about the current work and behavioral questions.

Read More »Given a singly linked list, select a random node from linked list (the probability of picking a node should be 1/N if there are N nodes in list). You are given a random number generator.

Read More »Given an unsorted array, find the largest pair sum in it. For example, the largest pair sum in {12, 34, 10, 6, 40} is 74.

Read More »## Microsoft Interview Experience | Set 52 (Fresher)

Leave a comment | Filed under Interview ExperiencesRound 1 (Microsoft College Code Competition) There were 6 problems to be solved in 1h30, if I recall correctly. My team solved 3 of them and ended in 2nd place.

Read More »## Karger’s algorithm for Minimum Cut | Set 1 (Introduction and Implementation)

Leave a comment | Filed under GraphGiven an undirected and unweighted graph, find the smallest cut (smallest number of edges that disconnects the graph into two components).

Read More »We have discussed following topics on Minimum Spanning Tree. Applications of Minimum Spanning Tree Problem Kruskal’s Minimum Spanning Tree Algorithm

Read More »1. Machine Coding: Two players, two field; and have multiple ships located in their fields. They are guessing each others ship position and hitting. Tell who wins first.

Read More »Given a list of tickets, find itinerary in order using the given list. Example: Input: “Chennai” -> “Banglore” “Bombay” -> “Delhi”

Read More »Consider a high traffic website that receives millions of requests (of different types) per five minutes, the site has k (for example n = 1000) servers to process the requests. How should the load be balanced among servers?

Read More »Round 1-Telephonic -General discussion abou project.java. Round 2-HackerEarth- 10 questions of Programming, selenium, Appium and shell scripting.

Read More »I was recently interviewed for SDE 2 position at OlaCabs.

Read More »## Why Quick Sort preferred for Arrays and Merge Sort for Linked Lists?

Leave a comment | Filed under Arrays Linked ListsWhy is Quick Sort preferred for arrays? Below are recursive and iterative implementations of Quick Sort and Merge Sort for arrays.

Read More »