chandrikadeb7 / hacktoberfest_2021 Goto Github PK
View Code? Open in Web Editor NEWThis repository aims to help code beginners with their first successful pull request and open source contribution. Happy coding!
License: MIT License
This repository aims to help code beginners with their first successful pull request and open source contribution. Happy coding!
License: MIT License
Hello, I want to solve this problem where balanced parenthesis and unbalanced parenthesis are validated.
Kindly assign me this task.
I want to contribute my portfolio in this repo. This portfolio can be made using html, css, javascript.
Please assign me this issue under Hacktoberfest21.
Please take this as part of Task 3
Open to discussion. Please comment your ideas.
I will be adding a python code for this solution
Given two strings s and t, return true if t is an anagram of s, and false otherwise. Implemented in C++.
I want to work on this issue. Kindly assign me this @chandrikadeb7
Complete the Hackerranl Box it Question
Please assign me an issue under Hacktoberfest21. I want to add my portfolio. This portfolio can be made using HTML, CSS, Bootstrap, javascript.
Thank you
Add
On behalf of Hactober Fest
#278
I want to make and add an edge detector for images in python under task 1. Please assign me this task
Add algorithm implementations in various languages here: https://github.com/chandrikadeb7/Hacktoberfest_2020/tree/main/Task%203
When I logged into my Hacktoberfest profile this morning, my pull request here was labeled as being part of an excluded project. I wasn't sure if you were aware that Hacktoberfest had labeled this project as excluded.
Having Issue Templates makes it easy to report a bug, feature, or documentation for both contributor & maintainer.
Like for Task1 Task2 Task3, adding an issue before starting any PR.
I'd be submitting a program to display t the pascal's pyramid using C language.
Write a program that, given an array A[] of n numbers and another number x, determines whether or not there exist two elements in A[] whose sum is exactly x.
This is missing, I would like to contribute in this repo the problem itself and its solution with time complexity analysis
Add max=300 param in contributors section in Readme.md file (append to img src)
&max=300
Add competitive programming questions and solutions in Task 1 folder here: https://github.com/chandrikadeb7/Hacktoberfest_2020/tree/main/Task%201
Platforms can be HackerEarth, Codechef, Hackerrank, GeeksforGeeks, Leetcode etc.
question and solution on floor of a number in sorted array is added. please check #385 .
I am willing to provide the solution to this question, please assign me this issue
I would like to submit my Solution for the competitive coding task @chandrikadeb7
@chandrikadeb7 please assign this task to me
Want to contribute using CPP codes for leetcode
Completed Task-2 .Made a Portfolio
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.