Basics of C++ | C++ Tutorial

This is our first tutorial on C++. and there are a lot of features in C++. but we will focus on those part which is beneficial for competitive programming. and after learning new concept we will solve some questions related to those concepts, so that we can use these concepts to solve bigger problems.

First of all let's get some theoritical knowledge about C++:

1.C++ is an Object Oriented Programming language(we will explain this point later).

2.It is developed by Bjarne Stroustrup in 1979.

3.C++ is high level language.

What is High level language?

->they are those language which is machine independent, that means we can compile or run it on any machine.

->Easy to debug and maintain.

->Portable. so if any language has these features then we can consider it as a High level language.

eg:C++, Java etc..

4.C++ provides data security.

5.Main features of C++ is Polymorphism, Inheritance, Encapsulation and Data Abstraction.

This is little bit theoritical concept of C++. so just do one thing install code block or dev c++ in your system or any code editor, so that you can easily write programs and run it on your PC.

In the next tutorial we will start learning in depth.

Next tutorial:

https://codingshading.blogspot.com/2020/07/basic-structure-of-c-program-c-tutorial.html

best of luck.

Comments

Disjiont Set Union-Find Data Structure | Code In C++

Introduction: In this tutorial we are going to write full program of disjoint set union find advance data structure in c++. Problem Description: Disjoint Set Union (DSU) is an advance data structure, which basically uses in graph algorithms to find cycles. Codes: Method1: Brute Force #include<bits/stdc++.h> using namespace std; int find(int f,vector<int>&dsuf){ if(dsuf[f]==-1) return f; return find(dsuf[f],dsuf); } void union_op(int from, int to, vector<int>& dsuf){ dsuf[from]=to; } bool isCycle(vector<pair<int,int> >&edge_list, vector<int>&dsuf){ for(int i=0;i<edge_list.size();i++){ int parent1=find(edge_list[i].first,dsuf); int parent2=find(edge_list[i].second,dsuf); if(parent1==pare...

Target Sum | Backtracking Problem

Introduction: In this tutorial we are going to solve a problem "Target Sum" which is from leetcode. and believe me it's really a good problem to understand Backtracking(Recursion). and if you try to understand the problem as well as code you will get a clear picture of Backtracking. Problem Statement: Link To Problem You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and - . For each integer, you should choose one from + and - as its new symbol. Find out how many ways to assign symbols to make sum of integers equal to target S. Input: nums is [1, 1, 1, 1, 1], S is 3. Output: 5 Explanation: -1+1+1+1+1 = 3 +1-1+1+1+1 = 3 +1+1-1+1+1 = 3 +1+1+1-1+1 = 3 +1+1+1+1-1 = 3 There are 5 ways to assign symbols to make the sum of nums be target 3. Solution: As given in question, we have two operation + and -. so we will make recursive call for + and - . and if we have sum as target and we have reached upto the last ind...

Group Anagrams solution with explanation:Leetcode solution

what is Anagrams? suppose we have two strings and the characters present in both of the strings are same. then both will be called anagram of each other. eg:" rat" and "art" both are anagram of each other. the characters present in both string are same. eg: "raat" and "art" these are not anagrams of each other. and the reason is that the frequency of "a" in "raat" is 2. while the frequency of "a" in "art" is 1. so these are not anagrams of each other. in short two strings will be anagram of each other if they have same characters and the count(frequency) of each and every character must be same in both strings. Solution: There are different ways to solve this question, so here we are going to use Hashmap to solve this question. cause whenever there is need to search we should go with the data structure which use balanced binary tress or hashing. and we know that Hashmap uses balanced binary trees. so using...

programming for beginners

Search This Blog