Problem 35. Quote Doubler
Given a string s1, find all occurrences of the single quote character and replace them with two occurrences of the single quote character.
If there are n such occurrences in s1, then s2 will be n characters longer than s1.
Solution Stats
Problem Comments
-
7 Comments
Show
4 older comments
Jonathan Perry
on 30 Sep 2016
I've found no matter how many '''' I add, it will only show one additional.
Akash Srivastav
on 27 May 2018
My answers are coming correct in MATLAB 2017b but not on this site.
Ayush
on 10 Jul 2024
This question need to be stated clearly with a sample example.
Solution Comments
Show commentsGroup

Project Euler II
- 12 Problems
- 51 Finishers
- Sums of cubes and squares of sums
- Sum of big primes without primes
- Project Euler: Problem 11, Largest product in a grid
- Highly divisible triangular number (inspired by Project Euler 12)
- Divisors for big integer
- Large Sum (inspired by Project Euler 13)
- Longest Collatz Sequence
- Project Euler: Problem 16, Sums of Digits of Powers of Two
- Project Euler: Problem 18, Maximum path sum I
- Recurring Cycle Length (Inspired by Project Euler Problem 26)
- Numbers spiral diagonals (Part 1)
- Numbers spiral diagonals (Part 2)
Problem Recent Solvers3250
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!