Discussed in https://github.com/SarthakKeshari/CPP-Questions-and-Solutions/discussions/251

Enter your question -

Given two sorted arrays array1 and array2 of size m and n respectively. Find the median of the two sorted arrays in the best time complexity.

Enter link to the question(if question belongs to any online platform) -

https://practice.geeksforgeeks.org/problems/median-of-2-sorted-arrays-of-different-sizes/1#

Tags for the question(eg - Array, Basic, Stack, etc.) -

Arrays, Searching

Enter your question -

Given an array arr[ ] of size N having distinct elements, the task is to find the next greater element for each element of the array in order of their appearance in the array. Next greater element of an element in the array is the nearest element on the right which is greater than the current element. If there does not exist next greater of current element, then next greater element for current element is -1. For example, next greater of the last element is always -1.

Enter link to the question(if question belongs to any online platform) -

https://practice.geeksforgeeks.org/problems/next-larger-element-1587115620/1

Tags for the question(eg - Array, Basic, Stack, etc.) -

Array, Stack

Issue Id you have worked upon -

#409

Briefly explain your program logic -

I have worked on basic concepts and pattern logics It is made with the help of for loop.

Screenshots(Attach 2 screenshots of your own input and output) -

Attach here

Checklist:

Eg - If your code follow the below guidelines. Kindly change [] to [x]

All the conditions should be fulfilled for considering your code for merging -

[x] I have mentioned the question as comment in my solution file.
[x] My code follows the guidelines of this project.
[x] I have performed a self-review of my own code.
[x] I have commented my code.
[x] My code gives the correct output.
[x] I confirm that I have not copied the code from anywhere. In case its found that I have copied I can be banned from the repository.

[x] I affirm that I strictly follow contributing guidelines and code of conduct.

Enter your question -

Write a program to swap two numbers (WITHOUT the help of third variable).

Enter link to the question(if question belongs to any online platform) -

No Link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Basic

Enter your question -

Given an array of n positive integers. Write a program to find the sum of maximum sum subsequence of the given array such that the integers in the subsequence are sorted in increasing order.

##Test cases- Test case 1) For input {1, 101, 2, 3, 100, 4, 5}} output should be 106 because the max sum increasing sequence 1,2,3,100 Because we have find the Maximum Maximum Sum Increasing Subsequence and length of subsequence is 4, Test case 2) For input {3, 4, 5, 10} output should be 3+4+5+10=22 Max longest subsequence is 4.

Enter link to the question(if question belongs to any online platform) -

https://practice.geeksforgeeks.org/problems/maximum-sum-increasing-subsequence4749/1

Tags for the question(eg - Array, Basic, Stack, etc.) -

Recursion , Dynamic Programming , Array

Enter your question -

Write a program in Java to sort the boundary elements of a Two Dimensional Matrix and print the sorted and original matrices.

Constraints: The program MUST take input from the user for the dimensions of the matrix.

Enter link to the question(if question belongs to any online platform) -

N/A

Tags for the question(eg - Array, Basic, Stack, etc.) -

Array, Basic

Enter your question -

Create a stack using linked list.

Enter link to the question(if question belongs to any online platform) -

No

Tags for the question(eg - Array, Basic, Stack, etc.) -

linked list , stack , functions

Enter your question -

Find k’th largest element in an array Input:

arr = [7, 4, 6, 3, 9, 1] k = 2

Output:

The 2nd largest array element is 7

Enter link to the question(if question belongs to any online platform) -

Tags for the question(eg - Array, Basic, Stack, etc.) -

DataStructure, Heap, CPP

Enter your question -

Given a two-dimensional integer matrix, find the length of the longest strictly increasing path. You can move up, down, left, or right.

Constraints : n, m ≤ 500 where n and m are the number of rows and columns in matrix

Example : Input-: matrix = [ [1, 3, 5], [0, 4, 6], [2, 2, 9] ] Output-: 6 Explanation-: The longest path is [0, 1, 3, 5, 6, 9]

Enter link to the question(if question belongs to any online platform) -

https://binarysearch.com/problems/Longest-Increasing-Path

Tags for the question(eg - Array, Basic, Stack, etc.) -

Dynamic Programming

Choose your form and fill it -

1. Form 1(C++ Solution contributors)

2. Form 2(C++ Documentation Contributors)

1) Form 1

Issue Id you have worked upon -

#503

Briefly explain your program logic -

Initially, after taking the input for the number of values, that the user wants to check, I stored the array in s variable. After this, a loop checked if all the numbers are positive and then another nested loop checked for the number of palindrome numbers the array contains. If it contains at least one palindrome number, the output is True, otherwise False. Hence, in this way, I checked for both conditions.

Screenshots(Attach 2 screenshots of your own input and output) -

Checklist:

Eg - If your code follow the below guidelines. Kindly change [] to [x]

All the conditions should be fulfilled for considering your code for merging -

• [x] I have mentioned the question as comment in my solution file.
  

• [x] My code follows the guidelines of this project.
  

• [x] I have performed a self-review of my own code.
  

• [x] I have commented my code.
  

• [x] My code gives the correct output.
  

• [x] I confirm that I have not copied the code from anywhere. In case its found that I have copied even after successful merge then I can be banned from the repository and hacktoberfest.
  

• [x] I affirm that I strictly follow contributing guidelines and code of conduct.

Enter your question -

Given an integer num, return a string representing its hexadecimal representation. For negative integers, two’s complement method is used.

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/convert-a-number-to-hexadecimal/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Maths

Enter your question -

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/min-stack/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Stack

Enter your question -

Given head of singly list, return true if list is palindrome.

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/palindrome-linked-list/

Tags for the question(eg - Array, Basic, Stack, etc.) -

LinkedList, Two Pointers, Stack

Enter your question -

Given an array of string, need to group anagrams together.

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/group-anagrams/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Sorting, String

Enter your question -

Given Target element, find sum of three numbers from an array which is closest to the target element.

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/3sum-closest/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Arrays, Two Pointers, Sorting

Choose your form and fill it -

1. Form 1(C++ Solution contributors)

1) Form 1

Issue Id you have worked upon -

Given a target element, need to find the sum of exactly three numbers from an array which should be around or equal to that target element.

Briefly explain your program logic -

Sort the array provided, then using two pointer approach need to calculate the sum of (currentIndex) + (currentIndex+1) + (RightIndex) and find the absolute difference and keep track of a variable "closest" which will be updated if the resultant value is lower than existing closest value.

Screenshots(Attach 2 screenshots of your own input and output) -

Checklist:

Eg - If your code follow the below guidelines. Kindly change [] to [x]

All the conditions should be fulfilled for considering your code for merging -

• [x] I have mentioned the question as comment in my solution file.
  

• [x] My code follows the guidelines of this project.
  

• [x] I have performed a self-review of my own code.
  

• [x] I have commented my code.
  

• [x] My code gives the correct output.
  

• [x] I confirm that I have not copied the code from anywhere. In case its found that I have copied even after successful merge then I can be banned from the repository and hacktoberfest.
  

• [x] I affirm that I strictly follow contributing guidelines and code of conduct.