All Medium Articles

Construct array having X subsequences with maximum difference smaller than d

Given two numbers X and d where X represents the number of non empty subsequences and d represents the difference. Output an array of size… Read More

Arrays

DSA

Same Number Of Set Bits As N

Given a positive integer N, find out how many positive integers strictly less than N have the same number of set bits as N. Examples: … Read More

Bit Magic

DSA

Technical Scripter

8254 Control Word and Operating modes

Prerequisite – 8254 Programmable Interval Timer After power-up, the state of the 8254 is undefined. The Mode, count value, and output of all Counters are… Read More

microprocessor

system-programming

Computer Organization and Architecture

Design 101 sequence detector (Mealy machine)

Prerequisite – Mealy and Moore machines A sequence detector is a sequential state machine that takes an input string of bits and generates an output 1… Read More

Digital Logic

Maximum subset with bitwise OR equal to k

Given an array of non-negative integers and an integer k, find the subset of maximum length with bitwise OR equal to k. Examples: Input :… Read More

Bitwise-OR

subset

Bit Magic

DSA

Python | User groups with Custom permissions in Django

Let’s consider a trip booking service, how they work with different plans and packages. There is a list of product which subscriber gets on subscribing… Read More

Python Django

Experiences

GBlog

Internship

Project

Python

TechTips

Web Technologies

Reading a CSV file in Java using OpenCSV

A Comma-Separated Values (CSV) file is just a normal plain-text file, store data in column by column, and split it by a separator (e.g normally… Read More

Java

Number of circular tours that visit all petrol pumps

Suppose there is a circular road. There are n petrol pumps on that road. You are given two array, a[] and b[], and a positive… Read More

Arrays

DSA

Dynamic Programming

Lexicographically Kth smallest way to reach given coordinate from origin

Given a coordinate (x, y) on a 2D plane. We have to reach (x, y) from the current position which is at origin i.e (0,… Read More

lexicographic-ordering

DSA

Geometric

Recursion

Incremental Process Model – Software Engineering

The Incremental Process Model is also known as the Successive version model. This article focuses on discussing the Incremental Process Model in detail. Table of Content… Read More

Software Engineering

Capability Maturity Model (CMM) – Software Engineering

Capability Maturity Model (CMM) was developed by the Software Engineering Institute (SEI) at Carnegie Mellon University in 1987. It is not a software process model. It… Read More

Software Engineering

Zoho Interview Experience | Set 35 (On-Campus)

Round 1: The first round consists of 15 c aptitude questions and 10 aptitude questions. Out of 15 c-aptitude questions, 10 were allocated 1 marks… Read More

Experiences

Interview Experiences

Levelwise Alternating GCD and LCM of nodes in Segment Tree

A Levelwise GCD/LCM alternating segment tree is a segment tree, such that at every level the operations GCD and LCM alternate. In other words at… Read More

GCD-LCM

Segment-Tree

Advanced Data Structure

DSA

Tree

Introduction to Postman for API Development

Postman: Postman is an API(application programming interface) development tool that helps to build, test and modify APIs. Almost any functionality that could be needed by… Read More

Technical Scripter

Web Technologies

D E Shaw Interview Experience | Set 22 (Off-Campus)

I applied for DE Shaw off campus through their site. Round 1 (Online round): After a few weeks, a hackerrank link was provided for an online… Read More

Experiences

Interview Experiences

set vs unordered_set in C++ STL

cpp-set

cpp-unordered_set

STL

Binary Search Tree

C++

Difference Between

DSA

Hash

N/3 repeated number in an array with O(1) space

We are given a read only array of n integers. Find any element that appears more than n/3 times in the array in linear time… Read More

Arrays

DSA

Comparison of yield(), join() and sleep() in Java

Comparison table yield(), join(), sleep() property yield() join() sleep() purpose If a thread wants to pass its execution to give chance to remaining threads of… Read More

Misc

Minimum bit changes in Binary Circular array to reach a index

Given a Binary Circular Array of size N elements and two positive integers x and y indicating the indices in the circular array. The task… Read More

binary-string

circular-array

Bit Magic

DSA

Strings

Triplets in array with absolute difference less than k

Given an array A[] of n elements and an integer k. The task is to find the number of triplet (x, y, z), where 0… Read More

Binary Search

Arrays

DSA

Searching

Sorting