Computer Science · Algorithms
यदि किसी समस्या को गैर-अतिव्यापी (non-overlapping) उप-समस्याओं के इष्टतम समाधानों को जोड़कर हल किया जा सकता है, तो इस रणनीति को ________ कहा जाता है।
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1रिकरशन (Recursion)
- 2डिवाइड एंड कॉनकर (Divide and Conquer)
- 3ग्रीडी दृष्टिकोण (Greedy approach)
- 4डायनेमिक प्रोग्रामिंग (Dynamic programming)✓
सही उत्तर देखें
डायनेमिक प्रोग्रामिंग (Dynamic programming)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms