Interested to Buy Any Domain ? << Click Here >> for more details...
Finding first/last occurrence of a character in a string
without using strchr( ) /strrchr( ) function.
- 2 Answers
- 11960 Views
- I also Faced
- E-Mail Answers
Answer Posted / sepideh
#include<iostream>
#include<conio.h>
using namespace std;
int main(){
char m[20];
char x;
gets(m);
x=getch();
for(int i=0;i!=null;i++)
if(m[i]==x){
cout<<i;}
getch();}
| Is This Answer Correct ? | 9 Yes | 0 No |
Post New Answer View All Answers
What is the use of putchar function?
What is the difference between functions getch() and getche()?
What does main () mean in c?
The __________ attribute is used to announce variables based on definitions of columns in a table?
What should malloc() do? Return a null pointer or a pointer to 0 bytes?
All technical questions
In a byte, what is the maximum decimal number that you can accommodate?
What is a pointer on a pointer in c programming language?
write a sorting prgm to sort 50 nos and sum them and also remove all the occurrences of 15 and print it?
Why c language?
Explain how do you determine a file’s attributes?
What does %p mean?
When do you not use the keyword 'return' when defining a function a) Always b) Never c) When the function returns void d) dfd
What is the g value paradox?
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.
