Skip to content

Courses
Tutorials
- DSA
- Data Structures
- Algorithms
- Interview Corner
- Languages
  - C
  - C++
  - Java
  - Python
  - JavaScript
  - PHP
  - C#
  - SQL
  - Scala
  - Perl
  - Go Language
  - Kotlin
- Web Development
  - HTML
  - CSS
  - JavaScript
  - PHP
  - CSS Frameworks
  - JavaScript Frameworks
  - JavaScript Libraries
  - WordPress
  - JSON
- School Learning
  - English Grammar
  - School Programming
  - Mathematics
  - Maths Notes (Class 8-12)
  - NCERT Solutions
  - RD Sharma Solutions
  - Physics Notes (Class 8-11)
  - Chemistry Notes
  - Business Studies (Class 11th)
  - Business Studies (Class 12th)
  - Accountancy (Class 12th)
  - Statistics for Economics (Class 11th)
- ML & Data Science
  - Machine Learning
  - Data Science
- CS Subjects
- GATE
- Software Designs
  - Software Design Patterns
  - System Design Tutorial
- GFG Sheets
  - Web Dev Cheat Sheets
  - Company-Wise SDE Sheets
  - DSA Sheets
- CS Exams/PSUs
  - ISRO
  - UGC NET
- Student
- UPSC
- SSC CGL
- Banking Exams
Jobs
Practice
Contests

Related Articles

Maximize the value of F(N) = max( N, F(N /2) + F(N / 3) + F(N / 4)) for any given integer

Difficulty Level : Expert
Last Updated : 18 May, 2021

Solve DSA problems on GfG Practice.

My Personal Notes

Rearrange given binary strings to maximize their Bitwise XOR value

Related Articles

1. Minimize operations to convert A to B by adding any odd integer or subtracting any even integer

2. Maximize Array sum by replacing any K elements by its modulo with any positive integer

3. Maximize sum of max and min of each of K Arrays obtained by dividing given Array into given sizes

4. Find the smallest positive integer value that cannot be represented as sum of any subset of a given array

5. Find min and max values among all maximum leaf nodes from all possible Binary Max Heap

6. Maximize array product by changing any array element arr[i] to (-1)*arr[i] - 1 any number of times

7. Maximize value of K such that a subsequence with sum i exists for each integer i in range [1, K]

8. Reduce the value of integer N by appending digit X any number of times

9. Find largest positive integer x missing from unsorted array such that min(arr[]) < x < max(arr[])

10. Check presence of integer between min and max of Array that divide all Array elements

Article Contributed By :

Vote for difficulty

Current difficulty : Expert

Improved By :

Article Tags :

Practice Tags :

Start Your Coding Journey Now!