JobsJob TrackerJob alerts

GreyOrange ยท 32 questions

All 32Coding 22System Design 2Low-Level Design 3Product Sense 1
  • Set Matrix ZeroesCoding
  • Convert number m to n with minimum operations (-1 and *2)Coding
  • Surrounded RegionsCoding
  • Direct Knapsack ProblemCoding
  • Dynamic Circular Linked List ImplementationCoding
  • Detect cycle in a linked list and find start pointCoding
  • Min Stack Implementation with Middle ElementCoding
  • Hashing and Linear Probing
  • Design Patterns Overview and DetailsLow-Level Design
  • Function Overloading vs Overriding
  • Virtual Functions, Interfaces, and Polymorphism
  • Design a robot monitoring systemSystem Design
  • Versioning systems and Docker
  • NoSQL vs SQL DatabasesSystem Design
  • Count 2-wheeler and 4-wheeler combinations for array elementsCoding
  • Sum of all odd factors for array elementsCoding
  • Minimum swaps required to group all 1s togetherCoding
  • Find all ways an input subarray can form a given sumCoding
  • Minimum swaps required to convert Binary Tree to BSTCoding
  • Reader-Writer problem multithreading codeLow-Level Design
  • SmartPointer Design and ComparisonLow-Level Design
  • Check if string is a palindromeCoding
  • Check leap yearCoding
  • Print all subsequences of a stringCoding
  • Data Structures and Algorithms coding testCoding
  • DSA problem-solving assessmentCoding
  • Write test cases for a webpageProduct Sense
  • Write GET and POST API test cases / codeCoding
  • Sort an array of 0s, 1s, and 2sCoding
  • SQL query based on JoinsCoding
  • Complex SQL queries with joins and subqueriesCoding
  • DSA question involving hashingCoding
โ† GreyOrange questions
  1. Interview questions
  2. GreyOrange
  3. Direct Knapsack Problem
Coding

Direct Knapsack Problem

Filed under GreyOrange

The question

Solve a direct knapsack problem.

No write-up yet. Related questions below have one.

Related GreyOrange questions

  • Convert number m to n with minimum operations (-1 and *2)
  • Dynamic Circular Linked List Implementation
  • Detect cycle in a linked list and find start point
  • Min Stack Implementation with Middle Element
  • Count 2-wheeler and 4-wheeler combinations for array elements
โ† Surrounded RegionsDynamic Circular Linked List Implementation โ†’

Collected from public candidate posts and coding forums. Updated Nov 2026.