MUST DO FOLLOW AND STAR THE REPO BEFORE PR !!!

YOUR CODE MUST CONTAIN EXPLANATIONS
ANY LANGUAGE CAN BE USED !

CODE must contain EXPLANATION !!!

use recursion.

MUST Contain EXPLANATION!!!👉👉👉👉

A "wave print matrix program" could be a program that prints a matrix (a two-dimensional array) in a "wave-like" pattern. In other words, it might print the elements of the matrix in a way that resembles the motion of a wave.

For example, if you have a 2D matrix like this:

1 2 3
4 5 6
7 8 9

A "wave print" of this matrix could look like:

1 4 7 8 5 2 3 6 9

Make a js file about portfolio

MUST DO FOLLOW AND STAR THE REPO BEFORE PR !!!

YOUR CODE MUST CONTAIN EXPLANATIONS
ANY LANGUAGE CAN BE USED !

DO FOLLOW ME AND STAR THE REPO BEFORE PR!!!

MUST DO FOLLOW AND STAR THE REPO BEFORE PR !!!

YOUR CODE MUST CONTAIN EXPLANATIONS
ANY LANGUAGE CAN BE USED !

PROBLEM LINK- https://www.hackerrank.com/challenges/c-class-templates/problem?isFullScreen=true

You are given a main() function which takes a set of inputs. The type of input governs the kind of operation to be performed, i.e. concatenation for strings and addition for int or float. You need to write the class template AddElements which has a function add() for giving the sum of int or float elements. You also need to write a template specialization for the type string with a function concatenate() to concatenate the second string to the first string.

CODE MUST CONTAIN EXPLANATION !!!

MUST DO FOLLOW AND STAR THE REPO BEFORE PR !!!

YOUR CODE MUST CONTAIN EXPLANATIONS
ANY LANGUAGE CAN BE USED !

@panditakshay402 I would like to work on this issue. Please assign it to me, and I have already given a star to the repository and followed you. Please add the required labels.

Hello @panditakshay402, I would like to code all operations of LinkedList

MUST DO FOLLOW AND STAR THE REPO BEFORE PR !!!

YOUR CODE MUST CONTAIN EXPLANATIONS
ANY LANGUAGE CAN BE USED !

MUST DO FOLLOW AND STAR THE REPO BEFORE PR !!!

YOUR CODE MUST CONTAIN EXPLANATIONS
ANY LANGUAGE CAN BE USED !

PROBLEM LINK - https://www.hackerrank.com/challenges/cpp-lower-bound/problem?isFullScreen=true

You are given N integers in sorted order. Also, you are given Q queries. In each query, you will be given an integer and you have to tell whether that integer is present in the array. If so, you have to tell at which index it is present and if it is not present, you have to tell the index at which the smallest integer that is just greater than the given number is present.

PROBLEM LINK- https://www.hackerrank.com/challenges/vector-sort/problem?isFullScreen=true

You are given N integers.Sort the N integers and print the sorted order.
Store the N integers in a vector.Vectors are sequence containers representing arrays that can change in size.

PROBLEM LINK- https://www.hackerrank.com/challenges/cpp-maps/problem?isFullScreen=true

You are appointed as the assistant to a teacher in a school and she is correcting the answer sheets of the students.Each student can have multiple answer sheets.So the teacher has Q queries:

1 XY :Add the marks Y to the student whose name is X.

2 X: Erase the marks of the students whose name is X.

3 X: Print the marks of the students whose name is X. (If X didn't get any marks print 0.)

PR will be accepted if Explained properly!

MUST DO FOLLOW AND STAR THE REPO BEFORE PR !!!

YOUR CODE MUST CONTAIN EXPLANATIONS
ANY LANGUAGE CAN BE USED !

Problem Link - https://leetcode.com/problems/symmetric-tree/description/

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

Example 1:

Input: root = [1,2,2,3,4,4,3]
Output: true
Example 2:

Input: root = [1,2,2,null,3,null,3]
Output: false

Constraints:

The number of nodes in the tree is in the range [1, 1000].
-100 <= Node.val <= 100

PROBLEM LINK- https://www.hackerrank.com/challenges/inheritance-introduction/problem?isFullScreen=true

One of the important topics of Object Oriented Programming is Inheritance. Inheritance allows us to define a class in terms of another class, which allows us in the reusability of the code.Check out the code below:

class Triangle{
public:
void triangle(){
cout<<"I am a triangle\n";
}
};
The class Triangle has a function called triangle(). Now we create a class derived from the base class Triangle called Isosceles.

class Isosceles : public Triangle{
public:
void isosceles(){
cout<<"I am an isosceles triangle\n";
}
};
Now we can create a derived class object and use it to access the functions of the base class.

int main(){
Isosceles isc;
isc.isosceles();
isc.triangle();
return 0;
}
This code will print:

I am an isosceles triangle
I am a triangle
Now write a function in Isosceles class such that the output is as given below.

Sample Output

I am an isosceles triangle
In an isosceles triangle two sides are equal
I am a triangle

Have made a repository on my profile under Leetcode problems --> Symmetric tree
Check out my Leetocode profile : https://leetcode.com/SHREY_29/
class Solution {
public boolean isSymmetric(TreeNode root) {
if (root == null){//If there is not root, then automatically it would be a mirror image
return true;
}
Stack stack = new Stack<>();//Stack is created to compare the values, as the values
//would be pushed into the stack and when taken out they can be checked for the conditions
//of satisfying the mirror image or not
stack.push(root.left);
stack.push(root.right);

    while (!stack.empty()) {
        
        TreeNode leftNode = stack.pop();
        TreeNode rightNode = stack.pop();
        
        if (leftNode == null && rightNode == null) {
            continue;
        }
        if (leftNode == null || rightNode == null || leftNode.val != rightNode.val) {
          return false;  
        } 
        
        stack.push(leftNode.left);
        stack.push(rightNode.right);
        //The below condition is for checking the daughter elements of a node,
        //as in a mirror left becomes right and vice-versa
        //so left node's right value should be checked with the right node's left value
        //vice-versa should also be applicable
        stack.push(leftNode.right);
        stack.push(rightNode.left);
    }
    return true;
}

}

DO FOLLOW ME AND STAR THE REPO BEFORE PR!!!

send PR with explanation

DO FOLLOW ME AND STAR THE REPO BEFORE PR!!!

MUST DO FOLLOW AND STAR THE REPO BEFORE PR !!!

YOUR CODE MUST CONTAIN EXPLANATIONS
ANY LANGUAGE CAN BE USED !