Mathematical Functions in Python | Set 1 (Numeric Functions)
In python a number of mathematical operations can be performed with ease by importing a module named “math” which defines various functions which makes our… Read More »
Concurrent Merge Sort in Shared Memory
Given a number ‘n’ and a n numbers, sort the numbers using Concurrent Merge Sort. (Hint: Try to use shmget, shmat system calls). Part1: The… Read More »
Stream In Java
Introduced in Java 8, the Stream API is used to process collections of objects. A stream is a sequence of objects that supports various methods… Read More »
Printing Longest Bitonic Subsequence
The Longest Bitonic Subsequence problem is to find the longest subsequence of a given sequence such that it is first increasing and then decreasing. A… Read More »
Amazon Interview Experience | Set 275 ( Off-Campus SDE-I Experienced)
I was interviewed in Delhi for SDE-I position in Kindle Frameworks Team at Amazon. I was working as a Project Lead in Samsung, Noida and… Read More »
Amazon Interview Experience | Set 274 ( On-Campus)
Round 1: (Online in Hackerrank) 20 MCQ questions based on outputs, DS, OS, DBMS. Print all possible words from phone digits Given a matrix where… Read More »
Packing and Unpacking Arguments in Python
We use two operators * (for tuples) and ** (for dictionaries). Background Consider a situation where we have a function that receives four arguments. We… Read More »
Puzzle 80 | Tic Tac Toe revisited
Ank and Mini play a game of tick-tack-toe. In this game, the players try to get three circles or three crosses in a row (horizontal,… Read More »
std::string class in C++
C++ has in its definition a way to represent sequence of characters as an object of class. This class is called std:: string. String class… Read More »
Querying the number of distinct colors in a subtree of a colored tree using BIT
Prerequisites : BIT, DFS Given a rooted tree T, with ‘n’ nodes, each node has a color denoted by the array color[](color[i] denotes the color… Read More »
Longest Common Extension / LCE | Set 3 (Segment Tree Method)
Prerequisites : LCE(Set 1), LCE(Set 2), Suffix Array (n Log Log n), Kasai’s algorithm and Segment Tree The Longest Common Extension (LCE) problem considers a… Read More »
Minimax Algorithm in Game Theory | Set 4 (Alpha-Beta Pruning)
Prerequisites: Minimax Algorithm in Game Theory, Evaluation Function in Game Theory Alpha-Beta pruning is not actually a new algorithm, rather an optimization technique for minimax… Read More »
American Express Interview Experience | Set 1 (Off campus for Risk department)
I would like to share American Express interview experience for RISK department OFF campus. 1st Round : I got short-listed From National level coding competition… Read More »
Printing Maximum Sum Increasing Subsequence
The Maximum Sum Increasing Subsequence problem is to find the maximum sum subsequence of a given sequence such that all elements of the subsequence are… Read More »
Informatica Interview Experience | Set 3 (On-Campus)
Informatica recently visited our campus for Full Time hiring. Here is my experience. The eligibility criterion was a CGPA of >= 6.5 and the stream… Read More »
