├── .github
└── ISSUE_TEMPLATE
│ ├── add-a-question.md
│ ├── add-a-topic-subtopic.md
│ ├── ask-a-query.md
│ └── suggest-an-idea.md
├── Arrays
├── 1D Arrays
│ ├── All or any
│ │ └── All_or_any.cpp
│ ├── Count_inversion
│ │ ├── Question.txt
│ │ └── Solution.cpp
│ ├── Welcome.txt
│ └── maxsubbarraysum.cpp
└── 2D Arrays
│ ├── LongestIncreasingPath.cpp
│ ├── MatrixRotation_90_clockwise.cpp
│ ├── Welcome.txt
│ ├── setmatrixaszero.cpp
│ ├── sortAndPrintBoundaryElementsOf2dArray.java
│ └── spirallyTraversingAMatrix.cpp
├── Basic Codes
├── Operation_Choice.cpp
├── Welcome.txt
├── average.cpp
├── bubble_sort.cpp
├── digit_names.cpp
├── factorial_1.cpp
├── positive_negative.cpp
├── prime_range_upto_50.cpp
├── reverse.cpp
├── roots_of_quad_Eq.cpp
├── swap.cpp
└── swap_1.cpp
├── Bit Manipulation
└── Welcome.txt
├── CODE_OF_CONDUCT.md
├── CONTRIBUTING.md
├── CodeChef
├── ATM.cpp
├── Chef Zomo and Zoo.cpp
├── Chef and his bookstore.cpp
├── CuriousMatrix.cpp
├── Longest AND Subarray.cpp
├── Mahasena.cpp
├── Maximise the Subsequence Sum.cpp
├── Movie Weekend
│ ├── Question.txt
│ ├── Solution.cpp
│ └── readme.md
├── PROBDIFF.cpp
├── PrimeGame.cpp
├── SHUFFLIN.cpp
├── Welcome.txt
├── XOR_Equal.cpp
├── alicevsbobfaceoff.cpp
├── chefWars.cpp
├── lapindrome.cpp
└── polynomial_root.cpp
├── CodeForces
├── A_Array_with_Odd_Sum.cpp
├── A_Beautiful_Matrix.cpp
├── Array_Optimization_by_Deque.cpp
├── Boats_Competition.cpp
├── D. Productive Meeting.cpp
├── Deep_Down_Below.cpp
├── Hacking_Cypher.cpp.cpp
├── Higher_Order_Functions.cpp
├── Jury_Meeting.cpp
├── K-th Not Divisible by n
├── K-th Not Divisible by n.cpp
├── Less or Equal.cpp
├── Maximum Light Up.cpp
├── Nastia and Nearly Good Numbers.cpp
├── Non-zero_Segments.cpp
├── Non_Decreasing_Dilemma.cpp
├── Permutation_Minimization.cpp
├── Registration_system.cpp
├── Shifting_Sort.cpp
├── Similar_Pairs.cpp
├── Sum_of_Cubes
├── Ternary String.cpp
├── Turn_the_Rectangles.cpp
├── Welcome.txt
└── Yet_Another_Palindromic_Problem.cpp
├── CodersArena
├── Coders Arena.md
└── coders arena logo.png
├── Coding Competition
├── Consistency-1.cpp
└── Xs_and_Os.cpp
├── Data Structure
├── Graph
│ ├── Directed Graph
│ │ └── Welcome.txt
│ └── Undirected Graph
│ │ └── Welcome.txt
├── Heap
│ ├── Find k’th largest element in an array.cpp
│ ├── Implementation-using-vector.cpp
│ └── Welcome.txt
├── Linked List
│ ├── Circular Linked List
│ │ └── Welcome.txt
│ ├── Doubly Linked List
│ │ └── Welcome.txt
│ └── Single Linked List
│ │ ├── DetectLoopInSinglyLinkedList.cpp
│ │ ├── Welcome.txt
│ │ └── reverseKNodes.cpp
├── Queue
│ ├── Basic Queue
│ │ └── Welcome.txt
│ ├── Circular Queue
│ │ └── Welcome.txt
│ └── Priority Queue
│ │ └── Welcome.txt
├── Stack
│ ├── Balanced parenthesis.cpp
│ ├── Next_Greater_Element.cpp
│ ├── Questions.txt
│ ├── Stack Using Linked List.cpp
│ ├── Stack using array.cpp
│ ├── dynamic_stacks_using_array_and_template.cpp
│ └── kstack in a array.cpp
└── Trees
│ ├── AVL Trees
│ └── Welcome.txt
│ ├── B+ Trees
│ └── Welcome.txt
│ ├── Binary Trees
│ ├── Diameter_of_Tree.cpp
│ ├── Height_of_Tree.cpp
│ ├── LeftViewOfBinaryTree.cpp
│ ├── Levelorder.cpp
│ ├── No_of_Nodes.cpp
│ ├── SumReplacement.cpp
│ ├── Sum_of_Nodes.cpp
│ ├── Verticalorder.cpp
│ ├── Welcome.txt
│ └── sumatk.cpp
│ └── Red Black Trees
│ └── Welcome.txt
├── Datatype-String
└── string.txt
├── Datatype-double
└── double.txt
├── Datatype-int
└── int.txt
├── Documentation
├── Create char.txt
├── Installing IDE- Eclipse for C++
│ ├── Steps to install Eclipse for C++.txt
│ ├── img1.png
│ ├── img10.png
│ ├── img11.png
│ ├── img2.png
│ ├── img3.png
│ ├── img4.png
│ ├── img5.png
│ ├── img6.png
│ ├── img7.png
│ ├── img8.png
│ └── img9.png
├── Installing IDE-CodeBlocks_c++
│ ├── Steps to install CodeBlocks for C++.txt
│ ├── img (1).png
│ ├── img (14).png
│ ├── img (15).png
│ ├── img (2).png
│ ├── img (3).png
│ ├── img (4).png
│ ├── img (5).png
│ ├── img (6).png
│ ├── img (7).png
│ └── img (9).png
├── Installing IDE-Dev C++
│ ├── Agreement.png
│ ├── Download.png
│ ├── Hello.png
│ ├── Installation_Guide.txt
│ ├── components.png
│ ├── file.png
│ ├── finish.png
│ ├── fonts.png
│ ├── installing.png
│ ├── language.png
│ ├── location.png
│ ├── output.png
│ ├── select_lang.png
│ └── success.png
├── Installing IDE-Turbo_C++
│ ├── 1.PNG
│ ├── 10.png
│ ├── 11.png
│ ├── 2.PNG
│ ├── 3.png
│ ├── 4.png
│ ├── 5.png
│ ├── 6.png
│ ├── 7.png
│ ├── 8.png
│ ├── 9.png
│ └── StepsToInstall.txt
├── Installing IDE-VScode
│ ├── Check.png
│ ├── Installation_completion.png
│ ├── Installer_Vscode.png
│ ├── Installer_mingw.png
│ ├── SYstemSetting.jfif
│ ├── SourceForge.jfif
│ ├── Steps to install Vscode For C++.docx
│ ├── StepsToinstall.txt
│ ├── SystemProperties.png
│ ├── apply.png
│ ├── bin.png
│ ├── env_variables.png
│ ├── env_variables2.png
│ ├── ex1.png
│ ├── ex2.png
│ ├── ex3.png
│ ├── extensions.png
│ ├── min.png
│ ├── mingw.png
│ ├── mingw2.png
│ ├── mingw3.png
│ ├── mingwPath.png
│ ├── path.png
│ ├── requirements.png
│ └── vscode.png
├── Installing Sublime in Linux
│ ├── Installation Guide for C++.txt
│ ├── apt setup.png
│ ├── build.png
│ ├── gpg key.png
│ ├── installing.png
│ ├── key add success.png
│ ├── output.png
│ ├── stable.png
│ └── terminal.png
├── Intro To C++.md
├── Math - sinh() , cosh() , tanh()
├── String - push_back(), pop_back()
│ ├── pop_back.txt
│ └── push_back.txt
├── Strings_getline
│ └── String_Getline().txt
├── Template_HTML_Reference.html
├── Template_TXT_Reference.md
├── images
│ ├── cpp.png
│ ├── logo.png
│ ├── question.png
│ └── write.png
├── intro.html
└── write.png
├── Dynamic Programming
├── 0-1-KnapsackDP.cpp
├── Editdistance.cpp
├── Eggdrop.cpp
├── Longestpalindromicsequuence.cpp
├── Prisoners_escape
│ └── images
│ │ ├── Escape.cpp
│ │ └── escape_cpp.png
├── Stock Buy Sell to Maximize Profit.cpp
├── Welcome.txt
└── knapsack.cpp
├── Exception Handling
└── Welcome.txt
├── File Handling
└── Welcome.txt
├── Functions-capacity,resize,shrink_to_fit
└── functions.txt
├── Game Theory
└── Welcome.txt
├── GeeksForGeeks
├── Cuttingrod.cpp
├── Huffman_Coding_For_Data_Compression.cpp
├── Job-Sequencing-Problem.cpp
├── Kadane's Algorithm
│ ├── README.md
│ └── main.cpp
├── MatrixChainMultiplicationDP.cpp
├── Median_in_sorted_rowwise_matrix
│ ├── Question.md
│ └── Solution.cpp
├── Median_sorted_array_diff_size
│ ├── Question.md
│ └── solution-tausiq.cpp
├── Minimum-Platform.cpp
├── Subarray_with_zero_sum.cpp
├── doublylinkiedlist.c
├── knap_sack.cpp
├── kth-element-2sorted-arrays.cpp
├── maxincsum.cpp
├── odd-after-even-LinkedList.cpp
├── reverse array.cpp
├── reverselinkedlistusingrec.cpp
└── spiraltraversal.cpp
├── Greedy Algorithms
├── GreedyAlgorithm.txt
├── Question-1_team.cpp
├── Question-2_HelpfulMaths.cpp
├── question-3_choosingTeams.cpp
├── question-4_FairElection.cpp
├── question-5_GreedyPuppy.cpp
└── question-6_GiftsFixing.cpp
├── Hackerearth
└── Welcome.txt
├── Hackerrank
├── Basic Data Types.cpp
├── Birthday_Cake_Candles.cpp
├── Day of the Programmer
│ ├── Question.txt
│ ├── README.md
│ └── Solution.cpp
├── For Loop
│ └── For Loop.cpp
├── Hotel Prices
│ └── Hotel Prices.cpp
├── Magic Spells
│ └── Magic Spells.cpp
├── Maximum HourGlass Sum 2D Array.cpp
├── Variable-sized-arrays
│ ├── question.md
│ └── solution.cpp
└── Welcome.txt
├── Interview Questions
└── Welcome.txt
├── Interviewbit
└── SubstringConcatenation.cpp
├── LICENSE
├── LeetCode
├── Dungeon Game
│ ├── Question.txt
│ ├── Screen Shot 2021-10-02 at 10.09.01 PM.png
│ ├── Solution.cpp
│ └── readme.md
├── 3Sum
│ ├── question.txt
│ ├── readme.md
│ └── solution.cpp
├── Check If It Is a Straight Line.cpp
├── Climbing Stairs.cpp
├── Delete Duplicate folders.cpp
├── Find All Duplicates in an Array
│ ├── question.txt
│ ├── readme.md
│ └── solution.cpp
├── Find the Highest Altitude
│ ├── question.txt
│ ├── readme.md
│ └── solution.cpp
├── Fizz Buzz.cpp
├── GenerateParentheses
│ ├── generateparentheses.cpp
│ └── ques.txt
├── Gray Code.cpp
├── House Robber
│ ├── README.md
│ ├── question.txt
│ └── solution.cpp
├── Interger To Roman
│ ├── Question.txt
│ ├── Solution.cpp
│ └── readme.md
├── Island perimeter
│ ├── question.txt
│ ├── readme.md
│ └── solution.cpp
├── Jump Game II
│ ├── Question.txt
│ ├── readme.md
│ └── solution.cpp
├── Jump Game
│ ├── question.txt
│ ├── readme.md
│ └── solution.cpp
├── Letter Combinations of a Phone Number
│ ├── README.md
│ ├── question.md
│ └── solution.cpp
├── Merge k Sorted Lists
│ ├── question.txt
│ ├── readme.md
│ └── solution.cpp
├── MiddleLL.cpp
├── Permutation.cpp
├── Power-of-four
│ ├── Readme.md
│ └── Solution.cpp
├── Remove Outermost Paranthesis
│ ├── question.txt
│ ├── readme.md
│ └── solution.cpp
├── Repeated DNA Sequences
│ ├── README.md
│ ├── question.txt
│ └── solution.cpp
├── ReverseInteger
│ ├── ques.txt
│ └── reverseInteger.cpp
├── Search Insert Position.cpp
├── Smallest String With A Given Numeric Value
│ ├── README.md
│ ├── question.txt
│ └── solution.cpp
├── Sorting Ascending.cpp
├── Subtract the Product and Sum of Digits of an Integer.cpp
├── Welcome.txt
├── ZigZagConversion
│ ├── ques.txt
│ └── zigzag.cpp
├── reverseKNodes.cpp
├── spirallyTraversingAMatrix.cpp
└── trappingRainWater.cpp
├── Number Theory
└── Special_Number.cpp
├── OOPs
└── Welcome.txt
├── Pattern printing
├── Basic_pattern_1.cpp
├── Letter J.cpp
├── Letter W.cpp
├── Letter_A.cpp
├── Letter_B.cpp
├── Letter_C.cpp
├── Letter_E.cpp
├── Letter_F.cpp
├── Letter_H.cpp
├── Letter_I.cpp
├── Letter_K.cpp
├── Letter_L.cpp
├── Letter_M.cpp
├── Letter_N.cpp
├── Letter_V.cpp
├── Letter_X.cpp
├── Letter_Y.cpp
├── Letter_Z.cpp
├── butterfly Pattern.cpp
└── welcome.txt
├── Questions.xlsx
├── README.md
├── Recursion
├── GCD-HCF.cpp
├── Pascaltriangle.cpp
├── Welcome.txt
└── factorial.cpp
├── SECURITY.md
├── Searching
└── Welcome.txt
├── Sorting
├── Bubble_Sort.cpp
├── Insertion_sort.cpp
├── Merge Sort.cpp
├── Merge_sort.cpp
├── Selection_sort.cpp
├── SemiSort_2.cpp
├── Semisort_1.cpp
└── Welcome.txt
├── String Handling
├── Date validation.cpp
├── Longestcommonsequenec.cpp
├── Longestincreasingsubseq.cpp
├── Welcome.txt
├── ZippedString.cpp
└── rotating digits and max number.cpp
├── Theory Questions and Answers
└── Welcome.txt
├── index.html
├── logo.png
├── pull_request_template.md
└── website_name.txt
/.github/ISSUE_TEMPLATE/add-a-question.md:
--------------------------------------------------------------------------------
1 | ---
2 | name: Add a question
3 | about: Purpose your own question
4 | title: "[Question Title]"
5 | labels: ''
6 | assignees: ''
7 |
8 | ---
9 |
10 | ### Enter your question -
11 | Your answer
12 |
13 | ### Enter link to the question(if question belongs to any online platform) -
14 | Your answer
15 |
16 | ### Tags for the question(eg - Array, Basic, Stack, etc.) -
17 | Your answer
18 |
--------------------------------------------------------------------------------
/.github/ISSUE_TEMPLATE/add-a-topic-subtopic.md:
--------------------------------------------------------------------------------
1 | ---
2 | name: Add a topic/subtopic
3 | about: Purpose a topic/sub-topic to add in Documentation
4 | title: "[Topic -> Subtopics you wish to work upon]"
5 | labels: documentation
6 | assignees: ''
7 |
8 | ---
9 |
10 | ### Enter topic you want to work upon(eg- String, Loop) -
11 | Write your answer here
12 |
13 | ### Enter sub-topic you want to work upon(eg- for loop, pow())
14 | Write your answer here
15 |
16 | ### While claiming the issue, kindly mention your real name and document type that you will submit (**Choices available** -> .txt or .html).
17 |
18 |
19 |
20 |
21 | ### Templates for reference - [.txt](https://github.com/SarthakKeshari/CPP-Questions-and-Solutions/blob/main/Documentation/Template_TXT_Reference.md) and [.html](https://github.com/SarthakKeshari/CPP-Questions-and-Solutions/blob/main/Documentation/Template_HTML_Reference.html)
22 | #### For contributors opting for .txt are requested to visit .html too in order to get clear idea what content to write and how it will be diplayed on the webpage.
23 |
24 |
25 |
26 | By creating/claiming the issue or by creating PR(pull request) for this issue you agree to the below conditions -
27 |
28 | - [x] I affirm that my document is less than **20%** plagarised.
29 | - [x] If my document is found to be more than **20%** plagarised, my PR(pull request) can be rejected without any prior information.
30 | - [x] I give the right to maintainers/admins/collaborators of this repository/project/website to amend/add/remove my document wherever/whenever is found necessary.
31 |
32 | **For clear details you may visit - #419**
33 |
--------------------------------------------------------------------------------
/.github/ISSUE_TEMPLATE/ask-a-query.md:
--------------------------------------------------------------------------------
1 | ---
2 | name: Ask a query
3 | about: Have a doubt?
4 | title: Query - [Query Title]
5 | labels: doubt
6 | assignees: ''
7 |
8 | ---
9 |
10 | ### Enter your query -
11 | Write your query here
12 |
--------------------------------------------------------------------------------
/.github/ISSUE_TEMPLATE/suggest-an-idea.md:
--------------------------------------------------------------------------------
1 | ---
2 | name: Suggest an idea
3 | about: What more can be implemented in this repository to help students
4 | title: "[Idea Title]"
5 | labels: ''
6 | assignees: ''
7 |
8 | ---
9 |
10 | ### A brief about your proposal -
11 | Your answer
12 |
--------------------------------------------------------------------------------
/Arrays/1D Arrays/Count_inversion/Question.txt:
--------------------------------------------------------------------------------
1 | Two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j and we have to calculate the total number of inversion in that array.
2 |
--------------------------------------------------------------------------------
/Arrays/1D Arrays/Count_inversion/Solution.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | using namespace std;
3 |
4 | //for sum of array
5 | int sum(int aa[],int x)
6 | { int s = 0;
7 | while(x > 0)
8 | {s += aa[x];
9 | x -= x & (-x);
10 | }
11 | return s;
12 | }
13 |
14 | //change bst at a given node
15 | void change(int aa[],int n,int x,int val)
16 | {
17 | while(x<=n)
18 | {aa[x]+= val;
19 | x+=x&(-x);
20 | }
21 | }
22 |
23 | //central function to work
24 | int count(int arr[], int n)
25 | {
26 | int ic=0;
27 |
28 | int max=0;
29 | for (int i=0;i=0;i--)
38 | {
39 | ic += sum(aa,arr[i]-1);
40 | change(aa,max,arr[i],1);
41 | }
42 |
43 | return ic;
44 | }
45 |
46 | int main()
47 | {
48 | int n;
49 | cin>>n;
50 | int arr[n];
51 | for(int i=0;i>arr[i];
53 | }
54 | cout <
3 | #include
4 | using namespace std;
5 | //maxsubarraysum function to find max sum
6 | int maxsubarraysum(int arr[],int n)
7 | {
8 | int max_sum=0; //initialize max_sum
9 | int curr_sum=INT_MIN; //initialize curr_sum=INT_MIN to overcome negative values.
10 | for(int i=0;imax_sum)
14 | {
15 | max_sum=curr_sum;
16 | }
17 | if(curr_sum<0)
18 | {
19 | curr_sum=0;
20 | }
21 | }
22 | return max_sum;
23 | }
24 |
25 | //Driver program to test maxsubarraysum
26 | int main()
27 | {
28 | cout<<"Enter the number of Elements"<>n;
31 | cout<<"Enter the elements in array"<>arr[i];
36 | }
37 | int maximumsum=maxsubarraysum(arr,n);
38 | cout<<"Maximum contiguous sum of array is "<
4 | using namespace std;
5 |
6 | #define N 4
7 |
8 | // Function to rotate the matrix 90 degree clockwise
9 | void rotate90Clockwise(int a[N][N])
10 | {
11 |
12 | // Traverse each cycle
13 | for (int i = 0; i < N / 2; i++) {
14 | for (int j = i; j < N - i - 1; j++) {
15 |
16 | // Swap elements of each cycle
17 | // in clockwise direction
18 | int temp = a[i][j];
19 | a[i][j] = a[N - 1 - j][i];
20 | a[N - 1 - j][i] = a[N - 1 - i][N - 1 - j];
21 | a[N - 1 - i][N - 1 - j] = a[j][N - 1 - i];
22 | a[j][N - 1 - i] = temp;
23 | }
24 | }
25 | }
26 |
27 | // Function to Display Matrix
28 | void printMatrix(int arr[N][N])
29 | {
30 | for (int i = 0; i < N; i++) {
31 | for (int j = 0; j < N; j++)
32 | cout << arr[i][j] << " ";
33 | cout << '\n';
34 | }
35 | }
36 |
37 |
38 | int main()
39 | {
40 | int arr[N][N] = { { 2, 10, 5, 3},
41 | { 7, 8, 9, 11},
42 | { 14, 15, 16, 13 },
43 | { 1, 4, 6, 10 } };
44 | cout<<"Matrix Before Rotation"<
4 |
5 | using namespace std;
6 |
7 | int main()
8 | {
9 | //Showing the menu for the user
10 | cout<<"Options are:-"<>a>>b;
25 |
26 | int ch;
27 |
28 | cout<<"\nEnter you choice\n";
29 | cin>>ch;
30 | //Performing operations and printing the output based on user choice.
31 | if(ch == 1){
32 | cout<<"Additon of two no's is:- "<<(a+b);
33 |
34 |
35 |
36 | }
37 |
38 |
39 | else if(ch == 2){
40 |
41 | cout<<"subtraction of two no's is:- "<<(a-b);
42 |
43 | }
44 |
45 |
46 | else if(ch == 3){
47 |
48 | cout<<"multiplication of two no's is:- "<<(a*b);
49 |
50 | }
51 |
52 |
53 |
54 | else if(ch == 4){
55 | if (b == 0){
56 | cout<<"Division by 0 not allowed";
57 | }
58 | else{
59 |
60 | cout<<"multiplication of two no's is:- "<<(a*b);
61 | }
62 | }
63 | else{
64 |
65 | cout<<"Invalid Choice";
66 | }
67 |
68 | return 0;
69 | }
70 |
--------------------------------------------------------------------------------
/Basic Codes/Welcome.txt:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/SarthakKeshari/CPP-Questions-and-Solutions/b3097685322caac5124ecfbfd41a221fb6bc8318/Basic Codes/Welcome.txt
--------------------------------------------------------------------------------
/Basic Codes/average.cpp:
--------------------------------------------------------------------------------
1 | // write the program for calculation average of 10 marks
2 | #include
3 |
4 | using namespace std;
5 |
6 | int main()
7 | {
8 | int arr []={1,3,5,7,9,5,2,9,9,2}; //taken 10 marks of students
9 | int sum=0;
10 |
11 | for(int i=0;i<10;i++) // traversing the array
12 | {
13 | sum=sum+arr[i] ;
14 | }
15 | double average = sum/10.0;
16 |
17 | cout<<"Average: "<
3 |
4 | using namespace std;
5 |
6 | int main()
7 | {
8 | int a = 1;
9 | if(a == 1)
10 | {
11 | cout << "one";
12 |
13 | }
14 | else if(a == 2)
15 | {
16 | cout << "two";
17 | }
18 | else if(a == 3)
19 | {
20 | cout << "three";
21 | }
22 | else if(a == 4)
23 | {
24 | cout << "four";
25 | }
26 | else if(a == 5)
27 | {
28 | cout << "five";
29 | }
30 | else if(a == 6)
31 | {
32 | cout << "six";
33 | }
34 | else if(a == 7)
35 | {
36 | cout << "seven";
37 | }
38 | else if(a == 8)
39 | {
40 | cout << "eight";
41 | }
42 | else if(a == 9)
43 | {
44 | cout << "nine";
45 | }
46 | else if(a == 0)
47 | {
48 | cout << "zero";
49 | }
50 | else
51 | {
52 | cout << "invalid input";
53 | }
54 | return 0;
55 | }
--------------------------------------------------------------------------------
/Basic Codes/factorial_1.cpp:
--------------------------------------------------------------------------------
1 | /**
2 | * @file factorial_1.cpp
3 | * @author BodaleDenis (denisbodale.work@gmail.com)
4 | * @brief This program implements factorial of a number N (using loop)
5 | * @date 2021-09-29
6 | */
7 |
8 | // Write a program to find factorial of a number entered by the user. (Using loop)
9 | #include
10 |
11 | int factorial(int number)
12 | {
13 | int product = 1, iter; // Product should be initialised by 1 since 0 would produce 0 outcome on final result
14 | if(number < 0)
15 | {
16 | std::cout << "Impossible, factorial is available only for positive numbers";
17 | }
18 | else if(number == 0)
19 | {
20 | return 1; // 0! is equal to 1
21 | }
22 | else
23 | {
24 | for(iter = 1; iter <= number; iter++)
25 | {
26 | product = product * iter;
27 | }
28 | }
29 | return product;
30 |
31 | }
32 |
33 | // Driver code
34 |
35 | int main()
36 | {
37 | int number;
38 | std::cout << "Choose the number to calculate factorial:" << "\n";
39 | std::cin >> number;
40 | std::cout << "Factorial of " << number <<" is " << factorial(number) << "\n";
41 |
42 | return 0;
43 | }
44 |
--------------------------------------------------------------------------------
/Basic Codes/positive_negative.cpp:
--------------------------------------------------------------------------------
1 | #include
2 |
3 | using namespace std;
4 |
5 | int main()
6 | {
7 | int N;
8 | cin>>N;
9 | if (N<0)
10 |
11 | cout << "Negative" << endl;
12 | else
13 | cout << "Positive" << endl;
14 | return 0;
15 | }
16 |
--------------------------------------------------------------------------------
/Basic Codes/prime_range_upto_50.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | using namespace std;
4 | int main()
5 | {
6 | cout<<"Prime nos from 1 to 50 are : \n";
7 |
8 | for (int i=2;i<=50;i++)
9 | {
10 | int c=0;
11 | for (int a=2 ; a<=sqrt(i);++a)
12 | {
13 | if (i%a==0)
14 | c=1;
15 | }
16 | if (c==0)
17 | cout<
2 | using namespace std;
3 | int main()
4 | {
5 | int arr[100], i, n;
6 | cout<<"Enter No. of Elements: ";
7 | cin>>n
8 | cout<<"Enter Array Elements: ";
9 | for(i=0; i>arr[i];
11 | cout<<"\n\nThe Reverse of Given Array is:\n";
12 | for(i=(n-1); i>=0; i--)
13 | cout<
2 | #include
3 |
4 | using namespace std;
5 |
6 | int main()
7 | {
8 | float a,b,c,D,X1,X2,img,real;
9 | char ch=253;
10 | cout<<"please enter the coefficients of x"<>a>>b>>c;
12 | D=b*b-4*a*c;
13 |
14 | if(D>0)
15 | {
16 | X1=(-b+sqrt(D))/(2*a);
17 | X2=(-b-sqrt(D))/(2*a);
18 | cout<<"The roots are Real and Different."<
3 | using namespace std;
4 | int main() {
5 |
6 | // Assume x = 32, y = 35 belongs to Natural number.
7 |
8 | int x = 32, y = 35;
9 |
10 | cout<<"Before swapping" <>a>>b;
11 |
12 | cout<<"the numbers before the swapping are:"<
17 | using namespace std;
18 |
19 | int main(){
20 |
21 | int withdraw;
22 | double balance;
23 | cin >> withdraw >> balance;
24 |
25 | if (withdraw % 5 == 0 && withdraw + 0.5 <= balance)
26 | {
27 | cout << balance - withdraw - 0.5 << endl;
28 | }
29 | else
30 | {
31 | cout << balance;
32 | }
33 | return 0;
34 | }
35 |
--------------------------------------------------------------------------------
/CodeChef/Chef and his bookstore.cpp:
--------------------------------------------------------------------------------
1 |
2 | // question link :- https://www.codechef.com/CDSP2021/problems/SEPT202/
3 |
4 | #include
5 | #define N 100005
6 | #define mod 1000000007
7 | #define INF 2147483647
8 | #define ll long long
9 | #define ln "\n"
10 | #define fast() ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
11 | using namespace std;
12 | int main()
13 | {
14 |
15 | fast();
16 | // n is the input taking from the user
17 | ll n;
18 | cin>>n;
19 |
20 | // we have declared an array of size n
21 | ll array[n];
22 | for(ll i=0;i>array[i];
26 | }
27 |
28 | /* Here we have take three parameters, the beginning of the
29 | array , the length n upto which we want the array to
30 | be sorted and to demonstrate descending order sort have used greater<>().*/
31 | sort(array,array+n,greater<>());
32 |
33 |
34 | // initially initialized to zero
35 | ll count = 0;
36 |
37 | for(ll i=0;i Fury-MadMax)
51 |
--------------------------------------------------------------------------------
/CodeChef/Longest AND Subarray.cpp:
--------------------------------------------------------------------------------
1 |
2 | /*
3 |
4 | Codechef - Longest AND Subarray question
5 |
6 | Link to the question-
7 |
8 | https://www.codechef.com/OCT21C/problems/ANDSUBAR
9 |
10 |
11 | */
12 |
13 | #include
14 | using namespace std;
15 |
16 | int main()
17 | {
18 | // your code goes here
19 | long long int t, n, i, p, temp, ans;
20 | cin >> t;
21 | while (t--)
22 | {
23 | cin >> n;
24 | // Initialize the value of temp
25 | temp = 1;
26 |
27 | // Find the maximum value of temp for which (2*temp) should be less than equal to n.
28 | while ((temp * 2) <= n)
29 | {
30 | temp = temp * 2;
31 | }
32 | p = temp / 2;
33 |
34 | // store the range of longest subarray in variable name ans
35 | ans = max(n - temp + 1, temp - p);
36 |
37 | // Print ans
38 | cout << ans << "\n";
39 | }
40 | return 0;
41 | }
42 |
--------------------------------------------------------------------------------
/CodeChef/Mahasena.cpp:
--------------------------------------------------------------------------------
1 | /* Question
2 | Kattapa, as you all know was one of the greatest warriors of his time. The kingdom of Maahishmati had never lost a battle under him (as army-chief), and the reason
3 | for that was their really powerful army, also called as Mahasena.
4 |
5 | Kattapa was known to be a very superstitious person. He believed that a soldier is "lucky" if the soldier is holding an even number of weapons, and "unlucky"
6 | otherwise. He considered the army as "READY FOR BATTLE" if the count of "lucky" soldiers is strictly greater than the count of "unlucky" soldiers, and "NOT READY" otherwise.
7 |
8 | Given the number of weapons each soldier is holding, your task is to determine whether the army formed by all these soldiers is "READY FOR BATTLE" or "NOT READY".
9 | https://www.codechef.com/problems/AMR15A */
10 |
11 | /* Input
12 | The first line of input consists of a single integer N denoting the number of soldiers. The second line of input consists of N space separated integers
13 | A1, A2, ..., AN, where Ai denotes the number of weapons that the ith soldier is holding. */
14 |
15 | /* Output
16 | Generate one line output saying "READY FOR BATTLE", if the army satisfies the conditions that Kattapa requires or "NOT READY" otherwise (quotes for clarity). */
17 |
18 | #include
19 | using namespace std;
20 |
21 | int main()
22 | {
23 | int t;
24 | int lucky=0,unlucky=0;
25 |
26 | cin>>t;
27 | for(int i=0;i>m;
31 | if(m%2==0)
32 | lucky++;
33 | else
34 | unlucky++;
35 |
36 |
37 | }
38 | if(lucky>unlucky)
39 | cout<<"READY FOR BATTLE";
40 | else
41 | cout<<"NOT READY";
42 | return 0;
43 | }
44 |
--------------------------------------------------------------------------------
/CodeChef/Maximise the Subsequence Sum.cpp:
--------------------------------------------------------------------------------
1 |
2 | // question link :- https://www.codechef.com/START10C/problems/SIGNFLIP/
3 |
4 | #include
5 | #define N 100005
6 | #define mod 1000000007
7 | #define INF 2147483647
8 | #define ll long long
9 | #define ln "\n"
10 | #define fast() ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
11 | using namespace std;
12 | int main()
13 | {
14 |
15 | fast();
16 | // d is the number of test cases
17 | int d;
18 | cin>>d;
19 | while(d--)
20 | {
21 | // taking the input from the user
22 | ll n,k;
23 | cin>>n>>k;
24 |
25 | // we have declared an array of size n
26 | ll array[n];
27 | ll sum=0;
28 | for(int j=0;j>array[j]; // taking the inputs as an array inside the loop
31 | }
32 |
33 | /* Here we have take two parameters, the beginning of the
34 | array , the length n upto which we want the array to
35 | be sorted */
36 |
37 | sort(array,array+n);
38 |
39 |
40 | for(int j=0;j0)
51 | {
52 | sum+=array[j]; // total sum
53 | }
54 | }
55 | cout< Fury-MadMax)
60 |
61 |
--------------------------------------------------------------------------------
/CodeChef/Movie Weekend/Question.txt:
--------------------------------------------------------------------------------
1 | Question:
2 |
3 | Little Egor is a huge movie fan. He likes watching different kinds of movies: from drama movies to comedy movies, from teen movies to horror movies. He is planning to visit cinema this weekend, but he's not sure which movie he should watch.
4 |
5 | There are n movies to watch during this weekend. Each movie can be characterized by two integers Li and Ri, denoting the length and the rating of the corresponding movie. Egor wants to watch exactly one movie with the maximal value of Li × Ri. If there are several such movies, he would pick a one with the maximal Ri among them. If there is still a tie, he would pick the one with the minimal index among them.
6 |
7 | Your task is to help Egor to pick a movie to watch during this weekend.
8 |
9 | Input
10 | The first line of the input contains an integer T denoting the number of test cases.
11 |
12 | The first line of the test case description contains an integer n.
13 |
14 | The second line of the test case description contains n integers L1, L2, ...,Ln. The following line contains n integers R1, R2, ..., Rn.
15 |
16 | Output
17 | For each test case, output a single integer i denoting the index of the movie that Egor should watch during this weekend. Note that we follow 1-based indexing.
18 |
19 | Constraints
20 | 1 ≤ T ≤ 5
21 | 1 ≤ n ≤ 100
22 | 1 ≤ Li, Ri ≤ 100
23 | Sample Input 1
24 | 2
25 | 2
26 | 1 2
27 | 2 1
28 | 4
29 | 2 1 4 1
30 | 2 4 1 4
31 | Sample Output 1
32 | 1
33 | 2
34 |
35 |
36 |
--------------------------------------------------------------------------------
/CodeChef/Movie Weekend/Solution.cpp:
--------------------------------------------------------------------------------
1 | // https://www.codechef.com/problems/MOVIEWKN
2 |
3 | #include
4 | using namespace std;
5 |
6 | int main() {
7 | // test cases
8 | int t;
9 | cin>>t;
10 | while(t--)
11 | {
12 | // there are n no of movies
13 | int n;
14 | cin>>n;
15 | //where as arr and brr are two array for accepting input ie. rating and length of the movie.
16 | int arr[n],brr[n];
17 | int product=0,rating=0,index=0;
18 | // loop for taking input ie. length of all the movies.
19 | for(int i=0;i>arr[i];
22 |
23 | }
24 | // loop for taking input ie. reting of all the movies.
25 | for(int i=0;i>brr[i];
28 | }
29 | // now here our main logic. ittreate a loop for n times ie. n is the no of movies.
30 | for(int i=0;i=product && brr[i] > rating )
37 | {
38 | product=arr[i]*brr[i];
39 | rating = brr[i];
40 | index=i;
41 |
42 | }
43 | }
44 | cout<
6 | using namespace std;
7 |
8 | int main(){
9 | int t;
10 | cin>>t;//inputing number of test cases
11 | if(t>=1 && t<=1000){
12 | while(t--){ //will repeat till variable t becomes 0
13 | int a,b,c,d; //problems
14 | cin>>a>>b>>c>>d;
15 | if(a>=1 && a<=10 && b>=1 && b<=10 && c>=1 && c<=10 && d>=1 && d<=10){ //problems and their conditions
16 | if(a==b && b==c && c==d) cout<<"0\n";
17 | else if(a==b || a==c || a==d || b==c || b==d || c==d) cout<<"1\n";
18 | else if(a!=b && a!=c && a!=d && b!=c && b!=d && c!=d) cout<<"2\n";
19 | }
20 | }
21 | }
22 | return 0;
23 | }
--------------------------------------------------------------------------------
/CodeChef/SHUFFLIN.cpp:
--------------------------------------------------------------------------------
1 | /*Chef is given an array A consisting of N positive integers. Chef shuffles the array A and creates a new array B of length N, where Bi=(Ai+i)mod2, for each i(1≤i≤N).
2 | Find the maximum possible sum of integers of the array B, if Chef shuffles the array A optimally.
3 | https://www.codechef.com/SEPT21B/problems/SHUFFLIN/ */
4 |
5 | #include
6 | using namespace std;
7 | #define ll long long
8 | #define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
9 |
10 | int main(){//start of main function
11 | fast;
12 | ll t,n,e,o,ele,s;
13 | cin>>t;
14 | while(t--){
15 | cin>>n;
16 | if(n%2!=0){
17 | o=(n+1)/2;//calculating how many odd positions are present in the length n
18 | e=n/2;//calculating how many even positions are present in the length n
19 | }
20 | else
21 | e=o=n/2;
22 | s=0;//initialising s(sum variable) as 0
23 | for(int i=1;i<=n;i++){
24 | cin>>ele;
25 | if(ele%2==0&&o>0){//counting for even numbers
26 | o--;
27 | s++;
28 | }
29 | else if(ele%2!=0&&e>0){//counting for odd numbers
30 | e--;
31 | s++;
32 | }
33 | else{
34 | if(ele%2==0)
35 | e--;
36 | else
37 | o--;
38 | }
39 | }
40 | cout<
5 | using namespace std;
6 |
7 | int main()
8 | {
9 | int tc; //Number of Test Cases
10 | cin >> tc;
11 | while(tc--)
12 | {
13 | int h,p;
14 | cin >> h >> p; // h is Darth's Health and p is Chef Power
15 | while(h!=0 && p!=0) //Check till h becomes zero or p comes to zero
16 | {
17 | if(h>p)
18 | h = h-p; //decrease p from h
19 | else
20 | h=0;
21 |
22 | p/=2; //On every attack Chef's power becomes half
23 | }
24 | if(h)
25 | {
26 |
27 | cout << 0 << endl; //If p becomes zero before h did not become zero
28 | }
29 | else
30 | {
31 | cout << 1 << endl; //p is non-negative integer and h decreases to zero
32 | }
33 | }
34 | return 0;
35 | }
36 |
--------------------------------------------------------------------------------
/CodeChef/lapindrome.cpp:
--------------------------------------------------------------------------------
1 |
2 | /*Lapindrome is defined as a string which when split in the middle, gives two halves having the same characters and same frequency of each character. If there are odd number of characters in the string, we ignore the middle character and check for lapindrome. For example gaga is a lapindrome, since the two halves ga and ga have the same characters with same frequency. Also, abccab, rotor and xyzxy are a few examples of lapindromes. Note that abbaab is NOT a lapindrome. The two halves contain the same characters but their frequencies do not match.
3 | Your task is simple. Given a string, you need to tell if it is a lapindrome.*/
4 |
5 |
6 | #include
7 | using namespace std;
8 |
9 | int main() {
10 | // your code goes here
11 |
12 | //Insert number of values you want to enter
13 | int t;
14 | cin>>t;
15 | //the loop would run until t !=0
16 | while(t--){
17 | string s;
18 | //insert a string
19 | cin>>s;
20 | int l=s.length();
21 | //intializing the arrays a and b
22 | int a[26]={0};
23 | int b[26]={0};
24 |
25 |
26 |
27 | //we spilt the string into halves and compare the halves
28 | for(int i=0;i
2 | using namespace std;
3 |
4 | void solve()
5 | {
6 | int n; // n is number of test cases.
7 |
8 | cin>>n;
9 |
10 | int a[n]; // array of size n.
11 |
12 | int sum = 0; // sum variable will store sum of elements of array.
13 | for (int i = 0; i>a[i];
17 |
18 | sum += a[i]; // this is storing sum of elements.
19 | }
20 | if (sum % 2 == 0) // if value of sum of elements of array is odd then output will be no.
21 | {
22 | cout<<"NO"<>t;
38 |
39 | while(t--)
40 | {
41 | solve();
42 | }
43 | }
--------------------------------------------------------------------------------
/CodeForces/A_Beautiful_Matrix.cpp:
--------------------------------------------------------------------------------
1 | // 263A - Beautiful Matrix
2 | // http://codeforces.com/problemset/problem/263/A
3 | // importing the libraries
4 | #include
5 | #include
6 |
7 | using namespace std;
8 |
9 | // Defining the main Function
10 | int main()
11 | {
12 | int x = 0; // Initialising the integer X.
13 | for (int i = 1; i <= 5; ++i)
14 | {
15 | for (int j = 1; j <= 5; ++j) // Opening a 'for' loop for taking the input
16 | {
17 | cin >> x;
18 | if (x == 1)
19 | {
20 | cout << abs(i - 3) + abs(j - 3) << endl; // Here 'abs' returns the absolute value of the parameter
21 | }
22 | }
23 | }
24 | return 0; // Evidence that our code will terminate here
25 | }
--------------------------------------------------------------------------------
/CodeForces/Deep_Down_Below.cpp:
--------------------------------------------------------------------------------
1 | // que link -->https://codeforces.com/problemset/problem/1561/C
2 | // SANYAM JAIN //
3 | #include
4 | #include
5 | #include
6 | #include
7 | #include