Skip to content

Issues: Burnout-Devil/HacktoberFest-DSA2022

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

6 Open 55 Closed
6 Open 55 Closed
Author
Filter by author
Loading
Label
Filter by label
Loading
Use alt click/return to exclude labels
or ⇧ click/return for logical OR
Projects
Filter by project
Loading
Milestones
Filter by milestone
Loading
Assignee
Filter by who’s assigned
Sort
Sort by
Newest Oldest Most commented Least commented Recently updated Least recently updated Best match
Most reactions
👍 👎 😄 🎉 😕 ❤️ 🚀 👀

Issues list

ADD necessary Rules for this Repo good first issue Good for newcomers Hacktoberfest hacktoberfest-2022 Extra attention is needed
#140 opened Oct 31, 2022 by Burnout-Devil
@Burnout-Devil
1
Given the head of a singly linked list, return the middle node of the linked list. If there are two middle nodes, return the second middle node. Hacktoberfest
#136 opened Oct 29, 2022 by SrigiriSruthi
1
Given the head of a singly linked list, return true if it is a palindrome or false otherwise.
#135 opened Oct 29, 2022 by SrigiriSruthi
1
Binary Tree in cpp good first issue Good for newcomers Hacktoberfest
#132 opened Oct 28, 2022 by ishita126jain
@ishita126jain
2
Rock paper scissors game
#131 opened Oct 28, 2022 by utkarshaskumbhar
1
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order.Input: nums = [2,7,11,15], target = 9 Output: [0,1] Explanation: Because nums[0] nums[1] == 9, we return [0, 1].
#13 opened Oct 17, 2022 by SrigiriSruthi
2
ProTip! Mix and match filters to narrow down what you’re looking for.