Nishanta Lenka (Nishant207)

Nishant207

Geek Repo

Company:IBM

Location:Bhubneswar

Home Page:https://nishant207.github.io/Portfolio/

Github PK Tool:Github PK Tool

Nishanta Lenka's repositories

Hacktoberfest2023-Beginners-New

This repository accepts PRs for Hacktoberfest2023

Stargazers:0Issues:0Issues:0

C-problems-Hacktoberfest2023

Make some contribution in c programming on Hacktoberfest2023

Language:CLicense:GPL-3.0Stargazers:0Issues:0Issues:0

community_issues

Hacktoberfest 2023

Language:JavaStargazers:0Issues:0Issues:0

Hacktoberfest-2023

This repository aims to help code beginners with their first successful pull request and open source contribution. 🥳🎯🚀

Language:C++License:MITStargazers:0Issues:0Issues:0

DSA_LIBRARY

Repository for Hacktoberfest 2023

Language:JavaLicense:MITStargazers:0Issues:0Issues:0

Hacktoberfest2023-Open

Accepting all PR's for Hacktoberfest 2023 just raise an issue and a PR , your PR will get accepted!

Language:Jupyter NotebookLicense:GPL-3.0Stargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:PythonStargazers:0Issues:0Issues:0
Language:HTMLStargazers:0Issues:0Issues:0

Hello-World-hacktoberfest2023

⭐ You can contribute to this Repository by creating programs to print "hello world" in different programming languages.⭐

Language:PythonLicense:GPL-3.0Stargazers:0Issues:0Issues:0

Hacktoberfest2023-Open-source-

Send your valuable codes here

License:MITStargazers:0Issues:0Issues:0
Stargazers:0Issues:0Issues:0
Language:HTMLStargazers:0Issues:0Issues:0
Language:HTMLStargazers:0Issues:0Issues:0

Hacktoberfest2023

Make your first Pull Request on Hacktoberfest 2023. Don't forget to spread love and if you like give us a ⭐️

License:GPL-3.0Stargazers:0Issues:0Issues:0

Btecky

Hacktoberfest 2023

Stargazers:0Issues:0Issues:0

Projects

I completed a project involving the algorithmic design of the closest pair of points, This project likely focused on algorithms that efficiently find the two points with the smallest distance between them in a set of points. One common approach is the Divide and Conquer algorithm, which can achieve a time complexity of O(nlogn

Stargazers:0Issues:0Issues:0
Stargazers:0Issues:0Issues:0
Language:HTMLStargazers:0Issues:0Issues:0

score-helm

Reference implementation for Helm charts integrationsupport

License:Apache-2.0Stargazers:0Issues:0Issues:0

storybook

Storybook is a frontend workshop for building UI components and pages in isolation. Made for UI development, testing, and documentation.

License:MITStargazers:0Issues:0Issues:0

Nishant207

Config files for my GitHub profile.

Stargazers:0Issues:0Issues:0