Problem: Find distinct prime factors of a number. You will be asked q times. Naive approach: Find out distinct prime factors for each query. It’s inefficient for large number of queries. As each query...
Author: Mukuldeep Maiti
Problem Statement: Post-order traversal to be printed from Pre-order traversal of a Binary Search Tree(BST). Prerequisite: BST & traversal A pre-order traversal of a BST is given. In BST, value/data of all the children...
visualization of audio chunk data read from .wav file into seperate stream
A simple face detector with OpenCV, python in less than 15 lines of code (excluding comments) using Haar feature-based cascade classifiers
It is to divide the first n natural number into the minimum number of subsets such that each element is pairwise co-prime with every other element from the subset.
This Applet program extracts all available fonts and prints them in a new window.