A focused practice platform for competitive-exam MCQs, subject wise, topic wise practice, and current affairs revision.

Exams

SSC CGL
UPSC CSE
IBPS PO
RRB NTPC
CDS

Subjects

Mathematics
Physics
General Knowledge
English
Reasoning

Resources

Current Affairs
Search MCQs
Practice Sets

Company

About Us
Contact
Privacy Policy
Terms of Use
Disclaimer
Copyright

Practice library for exams, subjects, and daily revision. For learning purposes only.

© 2026 ObjectiveMcq.ComAll rights reserved

ObjectiveMcq

Print Protected

Printing this content is disabled

This page is protected for print. Use the website to view the content.

In which of the following cases, it is not possible to have - Practice - ObjectiveMcq

HomePracticeData Structure And AlgorithmDynamic ProgrammingIn which of the following cases, it...

Dynamic Programming Data Structure And AlgorithmMedium

In which of the following cases, it is not possible to have two subsets with equal sum?

Correct Answer: C — When the sum of elements is odd

When the sum of all the elements is odd, it is not possible to have two subsets with equal sum.

Related Practice

Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
Which of the following is a sub string of "SANFOUNDRY"?
The naive pattern searching algorithm is an in place algorithm.
What is the auxiliary space complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
What is the time complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?
What is the recurrence relation for the linear search recursive algorithm?
Can linear search recursive algorithm and binary search recursive algorithm be performed on an unordered list?