Question: 2. Suppose that you read a binary stringthat is, a string of 0s and 1sone character at a time. Write a program that use a
2. Suppose that you read a binary stringthat is, a string of 0s and 1sone character at a time. Write a program that use a stack but no arithmetic to see whether the number of 0s is equal to the number of 1s. When these counts are not equal, show which character0 or 1occurs most frequently and by how much its count exceeds the others. in java
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
