Hey, let me know if you want to add this file also

In the documentation, on clicking the button of the problem section, there can be two options- info and problems. For example - on clicking the Linked List button, two options will be popped. The first one is information about the Linked list and the second is about the actual redirection to the problems page.

Hello @Abhijit2505 !
I am Samrendra, a Participant of SWOC'21. I have found a few issues on the page - First Missing Integer in the section One Dimensional Array and would like to work on them.
Link to the page - https://abhijit2505.github.io/Algorithmic-Treasure-Site/Pages/Array/firstMissingInt.html

Following are the issues:
1. The current C++ code sorts the vector using stl::sort(); this has an amortized time complexity of O(nlogn), but the given algorithm is wrongly marked as an O(n) time complexity. This needs to be corrected.

2. The current C++ code can be further optimised to reach the required O(n) time and O(1) space complexity by using swapping of elements. I would like to provide that code too.
3. There is no explanation of test cases provided. I would like to provide explained sample input and sample output.

Please assign this issue to me, would like to work on them.

This question is asked in amazon.
ques link : https://www.interviewbit.com/problems/matrix-median/
ques description : Given a matrix of integers A of size N x M in which each row is sorted.
Find an return the overall median of the matrix A.

As this project aims to build a website which will contain the codes along with the techniques and explanations so that it can be helpful for students preparing for an interview and. The string is one of the important topics for interview preparation, so I want to add questions of String.

@Abhijit2505 Sir,Please assign me this issue under SWOC.

Can I change contributors card to neumorphism cards?

hey @Abhijit2505

In this link : https://abhijit2505.github.io/Algorithmic-Treasure-Site/Pages/Array/array.html
Last 3 buttons are connected by same problem .[Remove duplicated problem]

And
C++ code is not written in problem remove duplicates . I want to add the code .

Please assign the this task to me . [SWOC'21].

Description -
The buttons in the documentation section can be aligned and by hovering on them we can give some brief info. For example on hovering one-dimensional array, we can add what a one-dimensional array is. Else the second idea could be to make two buttons for which one button will give the info and the second will redirect to problems.

@Abhijit2505 I am a participant in SWOC. I would like to work on this issue if you liked this idea. Kindly assign this to me.

I want to add the question of the Rotate Array in the database of One Dimensional array. Link to the question https://leetcode.com/problems/rotate-array/

I/P: We are given with head of linked list and value of k.
1->2->3->4->5->6->7->8 , k=3

O/P:
3->2->1->6->5->4->7->8

Here we only reverse in groups of k.

-The p of problem statement on the left sidebar should be capital.
-Similarly h of hashmaps.
-In the footer it is written "We welcome every C++ & python lover to come forwards " , forwads should be corrected to forward and "Keep coding, keep loving python & ++", ++ should be corrected to C++.

I would like to work on this issue . Please assign me for the same.

I want to implement all the functions of stack

• Push
• Pop
• Top
• IsEmpty
• IsFull

I would like to add a problem to find the maximum subarray sum.
Input is: [-2,1,-3,4,-1,2,1,-5,4]
Output is 6 ,as [4,-1,2,1] has the largest sum = 6
I would like to work on this issue for SWOC'21.
Problem link:https://leetcode.com/problems/maximum-subarray/

@Abhijit2505 to understand the concepts of brute force and using mathematic problem, what if we can add bruteforce programs.

• First Come First Serve (FCFS) is an operating system scheduling algorithm that automatically executes queued requests and processes in order of their arrival.

Issue-
On Each Click a new tab opens up which ends up opening too many tabs and causes confusion.

Solution-
The new page should open up on the tab and on pressing back button it should navigate back to previous page.

I would like too work on this issue under SWOC2021, so please it would be huge help if you could assign this issue to me.
Thank You.

Adding Dijkstra's algorithm in the graph section which is an algorithm for finding the shortest paths between nodes in a graph.

Finding the largest rectangular area possible in a given histogram where the largest rectangle can be made of a number of contiguous bars using stack data structure.

Description -
Adding Kruskal's Algorithm in the graph section which is used to find the minimum cost spanning tree.

@Abhijit2505 Please assign me this issue under SWOC.

Given an array of size N and two elements x and y, use counter variables to find which element appears most in the array, x or y. If both elements have the same frequency, then return the smaller element.

Input:
N = 11
arr[] = {1,1,2,2,3,3,4,4,4,4,5}
x = 4, y = 5
Output: 4
Explanation:
frequency of 4 is 4.
frequency of 5 is 1.

I would like to work on this in SWoC2021

Input:
N = 3
Array = {1, 2, 2}
Output: 1 2

stacks are important data structure and there are a few examples of stack implementation in the repo. Let me update the repo with the same .so please assign me the issue. some important stack implemetations include 2stack implementation, The celebrity problem,arithmetic expression evaluation etc. I am a participant in swoc21

I want to implement all the functions of stack

• Push
• Pop
• Top
• IsEmpty
• IsFull

I want to add the question of the maximum sum of a subarray in the database of One Dimensional array. Link to the question https://leetcode.com/problems/maximum-subarray/

Hello @Abhijit2505 !
I am Rashi, a Participant of SWOC'21. I have found a few issues on the page - Maximum Absolute Difference in the section One Dimensional Array and would like to work on them.
Link to the page - https://abhijit2505.github.io/Algorithmic-Treasure-Site/Pages/Array/maxAbsoluteDiff.html

Following are the issues:

1. Only Python code is available for this problem. I would like to add C++ code as well and add its tag at the top.
   

2. The title has been mistyped as Adding One to Number instead of Maximum Absolute Difference
   

3. The four cases are not at all clear.
   

4. There is error in Python code.
   

Please assign this issue to me, would like to work on them.

THIS IS VERY IMPORTANT QUESTION IN INTERVIEW WHICH IS SOLVED BY USING GRAPH DATA STRUCTURE.

Suppose the array is :
11 12 13 14 15
21 22 23 24 25
31 32 33 34 35
Output :
11 21 31 32 33 34 35 25 15 14 13 12 22 23 24

Painters partition problem is a very famous problem of DP . But it can be solved easily using binary search algorithm.
link for problem : https://www.interviewbit.com/problems/painters-partition-problem/

Input:
LinkedList: 1->2->3->4->5->6
Output: 6 5 4 3 2 1

Asked In: Accolite, Adobe, Amazon, Cisco, Cognizant, D-E-Shaw, and many more.

@Abhijit2505 From SWOC2021, As I was visiting the webpage I found we do not have programs for 1> Mathematic problems, 2>Hashmap and 3> OOP design.

I want to work on these topics. If we can discuss, do let me know how can I get going to add interesting program for above mentioned topics

Tower of Hanoi is a mathematical puzzle where we have three rods and n disks. The objective of the puzzle is to move all disks from source rod to destination rod using a third rod (say auxiliary). The rules are :

1. Only one disk can be moved at a time.
2. A disk can be moved only if it is on the top of a rod.
3. No disk can be placed on top of a smaller disk.
   Print the steps required to move n disks from source rod to destination rod.
   Source Rod is named as 'a', auxiliary rod as 'b', and destination rod as 'c'.
   Input Format :
   Integer n
   Output Format :
   Steps in different lines (in one line print source and destination rod name separated by space)
   Constraints :
   0 <= n <= 20
   Sample Input 1 :
   2
   Sample Output 1 :
   a b
   a c
   b c
   Sample Input 2 :
   3
   Sample Output 2 :
   a c
   a b
   c b
   a c
   b a
   b c
   a c

I WILL USE CPP FOR SOLVE THIS ISSUE

can i add a different code snippets related to strings and also different sorting and searching algorithms

And can i work this for swoc?

For a given string say abc. It will print all the possible permutations. That are:
abc
acb
bac
bca
cab
cba

I want to correct the spelling mistake in the heading titled 'Probelm Section'.
Here is the image:

I would like to work on this issue.

Would like to add one code_of_conduct file let me know

#Given a generic tree, find and return the node with maximum data. You need to return the node which is having maximum data.
Return null if the tree is empty.

Input format :
The first line of input contains data of the nodes of the tree in level order form. The order is: data for root node, number of children to root node, data of each of child nodes, and so on and so forth for each node. The data of the nodes of the tree is separated by space.
Output Format :
The first and only line of output contains the data of the node with the largest data in the given tree.
Constraints:
Time Limit: 1 sec
Sample Input 1:
10 3 20 30 40 2 40 50 0 0 0 0
Sample Output 1:
50

I would want to work on this issue for SWOC and would want to implement this in CPP.

I will implement functions such as

• Front
• Pop
• Push
• IsFull
• IsEmpty

Q. Find Kth smallest element in a row-column sorted matrix
Difficulty: hard
Input: matrix, k
output: kth smallest element from the matrix

Issue-
On Each Click a new tab opens up which ends up opening too many tabs and causes confusion.

Solution-
The new page should open up on the tab and on pressing back button it should navigate back to previous page.

I would like too work on this issue under SWOC2021, so please it would be huge help if you could assign this issue to me.
Thank You.

The task is to delete the node. Pointer/ reference to head node is not given.

Input:
N = 4
value[] = {10,20,4,30}
node = 20
Output: 10 4 30

Kindly assign me this issue under SWOC

For a given Binary Tree of type integer, print all the nodes without any siblings.

The first and the only line of input will contain the node data, all separated by a single space. Since -1 is used as an indication of whether the left or right node data exist for root, it will not be a part of the node data.

Input Sample

2 4 5 6 -1 -1 7 20 30 80 90 -1 8 9 -1 -1 -1 -1 -1 -1 -1 -1 -1

Output Sample

6 8 7 9

There will be given a sorted circular linked list, the task is to insert a new node in this circular list so that it remains a sorted circular linked list.

Input:
LinkedList = 1->2->4
(the first and last node is connected, 4 --> 1)
data = 2
Output: 1 2 2 4

Under the Dark theme, the current BWLU(Build With LetsUpgrade) [July,20 - Sept,20] Logo is not visible, and also I am trying to add SWoC also in the 'Participated Opensource Programs section' with its logo which is mentioned below.
1.BWLU

2.SWoC

Definition

A word w is an anagram of a word v if a permutation of the letters transforming w
into v exists. Given a set of n words of length at most k, we would like to detect all
possible anagrams.

• input: below the car is a rat drinking cider and bending its elbow while this thing
  is an arc that can act like a cat which cried during the night caused by pain in its
  bowel
• output: {bowel below elbow}, {arc car}, {night thing}, {cried cider}, {act cat}

I can implement this in python and C++

Please assign me this issue under SWOC

Input: abracadabra
Output: abra abra

An important classic problem on character strings is the detection of occurrences
of a pattern t in a string s. The Knuth–Morris–Pratt algorithm solves this problem
in optimal linear time O(|t| + |s|)

I would want to work on this issue for SWOC and would want to implement this in python.

I would like to work on dynamic programming algorithms. I can provide all the important algorithms such as knapsack, coin change, staircase, etc. Please assign this issue to me as a SWOC 2021 participant.

Can I add Issue Template, Pull Request template, Code Of Conduct suitable for this project?