1 MIN READ•
Fraction Knapsack
Fractional KnapsackIn the fractional knapsack problem, we have eight items of known values and weights. The capacity of the knapsack is also given. The objectiv
Ashutosh KumarAuthor
Blog
Insights, tutorials, and ideas...
Newest first
All Posts
4 MIN READ•
Dynamic Programming & 0/1 Knapsack
Dynamic Programming & 0/1 KnapsackDynamic programming is used to solve the optimisation problem.Dynamic programming divides the given original problem into
Abhijeet Singh RajputAuthor
4 MIN READ•
Gaussian Mixture Model
Gaussian Mixture Model (GMM)A Gaussian Mixture Model is a probabilistic clustering method that assumes data points are generated from a mixture of multiple Gaus
Ashutosh KumarAuthor
1 MIN READ•
Spectral Clustering
Spectral Clustering16 Oct 2025Spectral Clustering is a graph-based clustering technique that uses the eigenvalues and eigenvectors of the graph Laplacian to fin
Ashutosh KumarAuthor
1 MIN READ•
MiniMax using Divide and conquer approach
MiniMax Using Divide & ConquerIdeaMiniMax is a decision-making algorithm used in adversarial search (like games).Using divide and conquer, we recursively sp
Abhijeet Singh RajputAuthor
2 MIN READ•
All pairs shortest path (Floyd's)
All Pairs Shortest Path (Floyd-Warshall Algorithm)IntroductionFor a given connected weighted graph , the All Pairs Shortest Path (APSP) problem aims to find the
Abhishek SinghAuthor
1 MIN READ•
Compare the growth of the functions
DAA Assignment 1Compare the growth of the functions and lett(n) = g(n) = This is an form, so apply L'Hopital's RuleApply L hopital Ruledifferentiate the numer
Divya SachanAuthor
1 MIN READ•
comparison of two functions
Compare the growth of two functions0 implies has smaller order of growth than c implies has same order of growth as implies has larger order of growth than
Abhishek SinghAuthor
2 MIN READ•
Manacher's Algorithm
Manacher's Algorithm (hard)Manacher’s Algorithm finds the longest palindromic substring in linear time by reusing previously computed palindrome information. In
Ashutosh KumarAuthor
4 MIN READ•
miscellaneous Quant
Quantitative Aptitude – Objective Questions1. Number System and FactorialsFind the number of zeroes at the end of 250! (a) 35 (b) 22 (c) 62 (d) 24What is the re
Divya SachanAuthor
9 MIN READ•
Loss Function
Loss Functions:Loss functions help, how a machine learning model is performing with its given data, and how well it's able to predict an expected outcome. Many
Abhijeet Singh RajputAuthor
3 MIN READ•
K-Means Clustering
ClusteringClustering is the task of grouping a set of objects in such a way that objects in the same group (called a cluster) are more similar to each other tha
Abhishek SinghAuthor