Effective100
Effective100
-------------------------------------------------------------------
STRING-----------------------------------------------------------------
71- Accept a string from user and print its each character on a new line
72- Accept a string and print it in reverse order
73- Check if the string is Pallindromic or not
74- Pallindromic String using method and Two pointer algorithm (hint: Array reverse
algo)
75- Count vowels , consonents and space in a string
76- Toggle each alphabet of String
In - AcgDfD Output - aCGdFd
77- Take an array of strings words and a String Prefix. Print the number of strings
in words that contain pref as a prefix.
Example - Input: words = ["pay","attention","practice","attend"], pref =
"at"
Output: 2
78- Accept a space seperated sentence and split in into words. Print each word
on a new line with first letter capitalized.
IN- Hello bhai kaise ho
OP- Hello
Bhai
Kaise
Ho
79- Extend the prev question and capitalize first & last character of each word
in the sentence and print the new sentence
Ex - Hello bhai Kaise ho a
HellO BhaI KaisE HO A
80- 2114. Maximum Number of Words Found in Sentences
81- Accept a string and print the frequency of each character
present in the string
82- Check Two Strings are Anagram or Not
Anagrams words have the same word length & same character count
Examples of anagram words are arc and car, state and taste, night and thing
etc.
83- Sort the words of the sentence
---------------------------------------------------------------
HASHING-------------------------------------------------------------------
---------------------------------------------------------------OOPS &
DESIGN-----------------------------------------------------------
91- Design Private Cab Service - Graphic
92- Design a class RailwayTicket - Graphic
93- Design Hotel
94- Design Student Management
95- Project Restuarent V 2.0
--------------------------------------------------------------
MISCELLANEOUS-----------------------------------------------------------