---
title: "Discussion on \"0/1 Knapsack - How is it NP Complete?\" | Hashnode"
description: "Discussion on \"0/1 Knapsack - How is it NP Complete?\". Knapsack problem is called Weakly NP complete or pseudo-polynomial.\n\nTime complexity of solving it is - O(n*W) .The value of W is linear but the length of W is exponential - length in terms of bits.\n\nPseudo polynomial means - running time is a polyno..."
url: "https://hashnode.com/posts/01-knapsack-how-is-it-np-complete/666b4e068e232b34b179c2de"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [0/1 Knapsack - How is it NP Complete?](https://booleanbit1.hashnode.dev/01-knapsack-how-is-it-np-complete?utm_source=hashnode&utm_medium=feed)

Knapsack problem is called Weakly NP complete or pseudo-polynomial. Time complexity of solving it is - O(n\*W) .The value of W is linear but the length of W is exponential - length in terms of bits. Pseudo polynomial means - running time is a polyno...

Jun 13, 2024 · 1 min read · booleanbit1.hashnode.dev  
Read the article

-   [#0-1-knapsack](https://hashnode.com/tag/0-1-knapsack)

## Written by

[Divyanshi](https://hashnode.com/@booleanbit1)

@booleanbit1 · Seattle, WA

  
[View profile](https://hashnode.com/@booleanbit1)

Software Engineer - who is learning and sharing new things every now and then, follow along!

I am a Software Engineer currently looking out for jobs around seattle, Washington.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
