Programming world

Love for Characters Send Feedback Ayush loves the characters ‘a’, ‘s’, and ‘p’. He got a string of lowercase letters and he wants to find out how many times characters ‘a’, ‘s’, and ‘p’ occurs in the string respectively. Help him find it out.   Input: First line contains an integer denoting length of the string. Next line contains the string.  Constraints: 1<=n<=10^5 ‘a’<= each character of string <= ‘z’  Output: Three space separated integers denoting the occurrence of letters ‘a’, ‘s’ and ‘p’ respectively.  Sample Input: 6 aabsas  Sample output: 3 2 0 solution --> #include<bits/stdc++.h> using namespace std; #include<unordered_map> int main() {   int n;  cin>>n;  string s;  cin>>s;  int count =0,vount=0,bount=0;  for(int i =0; i<=s.size(); i++)  {     if(s[i]=='a' )     {         count++;     }     else if( s[i]=='s') ...

  We have many problems around us which are of different types. But we want to solve these problems in an efficient and effective way. For our daily life, if you have any problem, then we find a solution to solve it. We face three phases for problem-solving in our daily life: Define the solution Analyze the solution Implement the solution There is the same situation in the field of computer science. The solution we applied to solve computer problems is called an algorithm. We have to design this algorithm, then analyze it according to the business requirement, then implement this to solve the problem. The algorithm is nothing but a procedure that contains a specific set of rules to get output from input. We’ll learn the ways and techniques to analyze algorithms in this article.   Data structure is all about how to design, analyze and implement the “efficient” algorithms. So data structure is the most fundamental and building block concept in computer science to solve computer ...

  1. PRE REQUIREMENT Learn the programming language  master it. by learn basics of the language . 2. START WITH TOPICS basic topics 1.arrays 2.single linked list 3.double linked list 4.stack 5.queue Medium difficulty topics 1.Binary Tree 2. Binary  Search Tree 3.N- Ary Tree 4. backtracking  5.Recursion 6. Hashing Difficult Topics 1. Graph 2. Dynamic programming 3. PLATFORM 1. frist start with hacker rank then you get 5 star at hackerrank then move to another platform. 2. most power full platform for practice is LEETCODE.                                                           THANK YOU                                                           

BEST  THINGS  OF COMPITITIVE PROGRAMMING 1.  Coding ninjas 2.  code blocks 3. youtube - luv channel 4. youtube - stiver chnnel 5. geeks  for geeks  6. udemy 7. unacademy VOTE IT ! Best Resource of Competitive Programming 1. Coding ninjas 2. code blocks 3. youtube - luv channel 4. youtube - stiver chnnel 5. geeks for geeks 6. udemy 7.unacademy Create an Online Poll

Training for and participating in programming competitions have several benefits: You will become a better, more efficient, and less error-prone coder. Your technical programming interviews will be a piece of cake. Getting one will be easier as well — Gayle Laakmann McDowell, author of Cracking the Coding Interview, mentioned in a Quora post that “competitive programming [on a resume] usually merits an automatic “yes” for an interview”. You will increase your problem solving abilities that will help you solve, design, and implement difficult real-world programming problems and algorithms in the future. Win prizes and trips to places around the world as you compete with and meet other motivated and smart students. It’s really fun! At least, I hope it will be for you.

   The  prerequisite  for jumping into  competitive programming  is a good working knowledge of your favorite  programming  language, and some basic data structures. C++ is by far the most popular language of choice for  competitive programmers  due to its speed, and most resources/solution  will probably be written in C++.