---
title: "Rasel Mahmud (@programmingdude) | Hashnode"
description: "I'm the author of Programming Dude || Aspiring Machine Learning Engineer. Read the latest articles by Rasel Mahmud on Hashnode."
url: "https://hashnode.com/@programmingdude"
---

@programmingdude

# Rasel Mahmud

@programmingdude · China · Joined March 2023

I'm the author of Programming Dude || Aspiring Machine Learning Engineer

### [Is it possible to find an internship in China? My Journey About Internship](https://ai-eng.hashnode.dev/is-it-possible-to-find-an-internship-in-china-my-journey-about-internship?utm_source=hashnode&utm_medium=feed)

A journey to find an internship without industry experience

4 min read · [ai-eng.hashnode.dev](https://ai-eng.hashnode.dev/is-it-possible-to-find-an-internship-in-china-my-journey-about-internship?utm_source=hashnode&utm_medium=feed)

[Mar 22, 2025](https://hashnode.com/posts/is-it-possible-to-find-an-internship-in-china-my-journey-about-internship/67de823134035a35ef777261)

### [Types of Approximation Algorithms](https://ai-eng.hashnode.dev/types-of-approximation-algorithms?utm_source=hashnode&utm_medium=feed)

Approximation algorithms can be categorized based on their approximation ratios and the techniques they employ.

6 min read · [ai-eng.hashnode.dev](https://ai-eng.hashnode.dev/types-of-approximation-algorithms?utm_source=hashnode&utm_medium=feed)

[Nov 17, 2024](https://hashnode.com/posts/types-of-approximation-algorithms/673a02518b59ef88a88750d1)

### [Key differences between 0-1 Knapsack Problem and Extended Greedy Knapsack (ExtGreedyKS) Algorithm](https://ai-eng.hashnode.dev/key-differences-between-0-1-knapsack-problem-and-extended-greedy-knapsack-extgreedyks-algorithm?utm_source=hashnode&utm_medium=feed)

highlighting the differences between the 0-1 Knapsack Problem and the Extended Greedy Knapsack (ExtGreedyKS) Algorithm:

4 min read · [ai-eng.hashnode.dev](https://ai-eng.hashnode.dev/key-differences-between-0-1-knapsack-problem-and-extended-greedy-knapsack-extgreedyks-algorithm?utm_source=hashnode&utm_medium=feed)

[Nov 17, 2024](https://hashnode.com/posts/key-differences-between-0-1-knapsack-problem-and-extended-greedy-knapsack-extgreedyks-algorithm/6739ce11288e88bb4382dae0)

### [Key differences between P, NP, NP-complete, and NP-hard](https://ai-eng.hashnode.dev/key-differences-between-p-np-np-complete-and-np-hard?utm_source=hashnode&utm_medium=feed)

CategoryPNPNP-completeNP-hard DefinitionProblems that can be solved in polynomial time by a deterministic algorithm.Problems whose solutions can be verified in polynomial time by a deterministic algorithm.Problems that are both in NP and as hard a...

2 min read · [ai-eng.hashnode.dev](https://ai-eng.hashnode.dev/key-differences-between-p-np-np-complete-and-np-hard?utm_source=hashnode&utm_medium=feed)

[Nov 16, 2024](https://hashnode.com/posts/key-differences-between-p-np-np-complete-and-np-hard/6738a22bacf7cf9fc1acd562)

### [Key differences between the Knapsack Problem and the Bin Packing Problem](https://ai-eng.hashnode.dev/key-differences-between-the-knapsack-problem-and-the-bin-packing-problem?utm_source=hashnode&utm_medium=feed)

FeatureKnapsack ProblemBin Packing Problem ObjectiveMaximize the total value of items packed into a single knapsack.Minimize the number of bins needed to pack all items. Number of ContainersOnly one knapsack (container) is available.Multiple b...

2 min read · [ai-eng.hashnode.dev](https://ai-eng.hashnode.dev/key-differences-between-the-knapsack-problem-and-the-bin-packing-problem?utm_source=hashnode&utm_medium=feed)

[Nov 15, 2024](https://hashnode.com/posts/key-differences-between-the-knapsack-problem-and-the-bin-packing-problem/673794bc69de6f3d91b176d1)
