Giter Site home page Giter Site logo

ayushi-ras / beginner-contribution- Goto Github PK

View Code? Open in Web Editor NEW
13.0 1.0 64.0 242 KB

Beginners Friendly

License: MIT License

C++ 28.60% Java 13.93% Python 6.14% JavaScript 12.61% CSS 12.50% HTML 21.83% SCSS 4.40%
beginner-friendly hacktoberfest hacktoberfest-accepted hactoberfest2023

beginner-contribution-'s Introduction

Hello I'm Ayushi Rastogi👋



  • 👀 I’m interested in Development
  • 🌱 I’m currently learning Full Stack Web Development
  • 📫 How to reach me [email protected]

Languages and Tools:

ayushi-ras Github Stats

Top Langs

An image of @ayushirastogi9191's Holopin badges, which is a link to view their full Holopin profile

ayu181's GitHub stats

beginner-contribution-'s People

Contributors

akanshbende avatar ayan-joshi avatar ayushi-ras avatar blindaks avatar charithacs avatar gva-cse avatar haris-mohanty avatar hritik-6918 avatar karanjot786 avatar m-soumik avatar namika0305 avatar notsointresting avatar pawarp19 avatar shehzansk avatar shimrangupta22 avatar shreya-spr avatar suryakantdubalgunde avatar tanushree713 avatar vaibhav-rm avatar vaibhav67979 avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar

beginner-contribution-'s Issues

Add Implementations of .map, .fitler and .reduce in JS ES6

Issue: Implement .map, .filter, and .reduce in JavaScript ES6

Description

Summary:

Implement custom versions of .map, .filter, and .reduce array methods in JavaScript ES6.

Details:

JavaScript provides powerful array methods like .map(), .filter(), and .reduce() that are commonly used for data manipulation. This task aims to create custom implementations of these methods to better understand how they work internally.

Requirements:

  • Create custom implementations for .map(), .filter(), and .reduce() in JavaScript ES6.
  • Include comments explaining the logic and usage of each method.
  • Test your implementations with sample arrays and verify that they produce the same results as the built-in methods.
  • Ensure that your custom methods work with both arrays and array-like objects.

Hacktoberfest: Please label this issue as hacktoberfest.

Kadane's Algorithm

I want to add Kadane's Algorithm to this repository.
Kadane's algorithm is a dynamic programming approach used to solve the maximum subarray problem, which involves finding the contiguous subarray with the maximum sum in an array of numbers. The algorithm was proposed by Jay Kadane in 1984 and has a time complexity of O(n).

DSA Problem: Reverse a Linked List

Problem Description:

Given the head of a singly linked list, reverse the list and return its head.
Write a function or algorithm to solve this problem efficiently.

Input:

The head node of a singly linked list.

Output:

Return the head node of the reversed linked list.

Example:

## Input:
        1 -> 2 -> 3 -> 4 -> 5 -> null
## Output:
      5 -> 4 -> 3 -> 2 -> 1 -> null

REPOSITORY EXCLUDED FROM HACKTOBERFEST

This is for the information that the repository has been excluded by the Hacktoberfest team from the event. This was done to maintain the quality standards and promote good quality open source contributions.

I apologize for making this repo as a source of making PRs not worth the standards of the Hacktoberfest. It was an unintentional thing and I don't want to misguide anyone. Though I didn't allow any spam, checked the code, made contributors raise issues and then make the PR, made them use the template properly but I think the repo was misused.

My intention was good but it went in the wrong direction for the wrong kind of projects

I am making this repo an "archive".

Diameter of a tree in cpp

Hey, @ayushi-ras I would like to contribute a program in C++, that calculates the diameter of a tree using the DFS algorithm.
So please assign me this issue under the tag of Haktoberfest2023.

Add 4sum problem solution in C++

Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that:

0 <= a, b, c, d < n
a, b, c, and d are distinct.
nums[a] + nums[b] + nums[c] + nums[d] == target

Please assign this issue to me under Hacktoberfest.

Add Leetcode Wildcard Matching solution in cpp

Issue: Add Leetcode 44. Wildcard Matching solution in C++

Description

Summary:

Add a C++ solution for LeetCode problem 44. Wildcard Matching.

Details:

LeetCode problem 44, "Wildcard Matching," requires implementing a function to determine if a given string (s) can be matched against a pattern string (p) where '?' matches any single character, and '*' matches zero or more characters.

Requirements:

  • Provide a detailed solution with comments explaining the logic.
  • Ensure the solution passes all test cases on LeetCode.
  • Include sample test cases to validate the solution.

Hacktoberfest: Please label this issue as hacktoberfest and assign it to me.

Game Projects

Create a simple game using a framework like Phaser for JavaScript, Pygame for Python, or similar. It could be something like a maze game, memory puzzle, or a basic platformer.

Better Structure

The structure of the repository should be changed like , We should create different folders or java , python and c++.
Mostly students use this three languages so it will be easy to keep all three different language problems separately.

Please assign me this issue under hacktoberfest label @ayushi-ras

DSA Problem: Finding the Missing Number

Problem Description:

You are given an array containing n distinct numbers taken from 0, 1, 2, ..., n, except for one missing number. Your task is to find and return the missing number.

Input:

 nums: A list of distinct integers containing n elements, where 1 <= n <= 10^4.

Output:

Return the missing number.

Example:

       nums = [3, 0, 1]

Output:

2

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.