hey people this is my first time contributing to hacktoberfest. I raised an issue. Please assign the labels so that I can make my first ever pr in this repo TheAlgorithms/Python#5279
thanks!
Hey guys,
The
One thing I noticed is that this check fails whenever someone raises a PR from a new branch of their fork and not from
The
Prettify check is failing on TheAlgorithms/Java#2638 and I cannot seem to understand why. Could someone please help?One thing I noticed is that this check fails whenever someone raises a PR from a new branch of their fork and not from
master. All the PRs raised from fork-repo/master pass this check.
My build is repeatedly failing even though I have made the change in the error that occured during the build
Can someone help me out as to what I did wrong
I am thinking about adding an algorithm to reverse a binary tree to the repo, would it be useful ?
Oh its automatically there@
nvm
This is the first time I am here
And I want to know what to do!
how to contribute in community
Can someone please tell me that in this issue #5625 do I have to create a doc file for beginners in Open Source?
can anyone please remove the "invalid" tag for TheAlgorithms/Python#4890 so that I become eligible for "hacktoberfest completion"
Hey inside the data structures folders I noticed that programming questions for Binary trees, linked lists, stacks, and queues already exist. So I would like to add some famous programming questions for Hash Tables too as there aren't any. What does everybody think about this?
Hey there! Feel free to make a PR! The maintainers will review it when they can :)
hello everyone
@Kush1101
So I want to add a new feature in the Java repo but I notice the C++ contributing guidelines are much more detailed, should I basically follow those rules but for the Java repo?
I am bit confused with this problem that whether my approch is correct or not?
question: Suppose we have give an array of items and k, which is an interger value. And we have to tell that how to categories these items in minimum no. of groups and the condition is that in a group only have those item their difference less than or equal to k. Here also we can change the initial order of the items.
My approach: As it is mentioned that we don't need to maintain the initial order so,
Let take arr = {4 2 1 5 6 3}
k = 3
1st we can sort the array:
arr = {12 3 4 5 6}
2nd for simplicity:
check the difference between last and 1st item
if arr[n - 1] - arr[0] <= k, then return 1
Beause all the remaining left items are considering as in the same group.
else
we take a loop for checking from left (initialize with i =0) most item to its right items (j = i + 1)
start loop
while(j < n)
check if(arr[j] - arr[i] <= k) j++
else
i = j
j++
res++
end loop
return res + 1 I soved this proble with this approach, so want to confirm the is it correct or not here I have used greedy or should I use DP if yess..then how?
question: Suppose we have give an array of items and k, which is an interger value. And we have to tell that how to categories these items in minimum no. of groups and the condition is that in a group only have those item their difference less than or equal to k. Here also we can change the initial order of the items.
My approach: As it is mentioned that we don't need to maintain the initial order so,
Let take arr = {4 2 1 5 6 3}
k = 3
1st we can sort the array:
arr = {12 3 4 5 6}
2nd for simplicity:
check the difference between last and 1st item
if arr[n - 1] - arr[0] <= k, then return 1
Beause all the remaining left items are considering as in the same group.
else
we take a loop for checking from left (initialize with i =0) most item to its right items (j = i + 1)
start loop
while(j < n)
check if(arr[j] - arr[i] <= k) j++
else
i = j
j++
res++
end loop
return res + 1 I soved this proble with this approach, so want to confirm the is it correct or not here I have used greedy or should I use DP if yess..then how?
