Description
Description
I would like to contribute a C++ solution for the DSA problem: "Move Zeros to End".
Problem Statement
Given an array, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
Example:
Input: [0, 1, 0, 3, 12]
Output: [1, 3, 12, 0, 0]
Language
C++
Checklist
Kindly assign me this issue under GSSoC.
Type of Contribution: Code (C++ solution for DSA problem)
Domain
DSA
Type of Contribution
Others
Code of Conduct
Description
Description
I would like to contribute a C++ solution for the DSA problem: "Move Zeros to End".
Problem Statement
Given an array, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
Example:
Input: [0, 1, 0, 3, 12]
Output: [1, 3, 12, 0, 0]
Language
C++
Checklist
Kindly assign me this issue under GSSoC.
Type of Contribution: Code (C++ solution for DSA problem)
Domain
DSA
Type of Contribution
Others
Code of Conduct