This repository is for adding codes of data structures and algorithms, leetCode, hackerrank etc solutions in different languages

DSCSRMNCR

Last update: Oct 22, 2021

Related tags

Data Structures hacktoberfest

Overview

DSA-Code-Snippet

This repository is for adding codes of data structures and algorithms, leetCode, hackerrank etc solutions in different languages

Contributing

Go through the Contributing Guidelines for a detailed information on contributing to this repository!
For beginners - Jump to this section.
PRs made without adding any useful Resource / Code / Solving Issues will be marked as invalid/spam.

For beginners

If this is your first time creating a Pull Request - go through the next section to know how to create one.
If you feel you don't have any code, don't worry! You can pick up one of the issues, solve them in your preferred language and add that code in a Markdown file inside the respective folder according to the contributing guidelines.

Creating a pull request

Fork and Star this repository
Create a new git branch
Add files / Modify files
Add and commit your changes
Push your changes to your forked repository
Open this repository and click on Pull requests and then the New Pull Request button
Click on compare across forks and select head repository as your own forked repository and the new branch with changes
Click on Create pull request

And voila! You have created a new pull request! Now all that's left is for the maintainer for the project/repository to review your PR and merge it if it is good to go! 😀

To connect with the community, join the DSC SRM Ghaziabad Telegram Group.

Happy coding! 🚀

Svector (pronounced Swag-tor) provides extension methods to pyrsistent data structures

Svector Svector (pronounced Swag-tor) provides extension methods to pyrsistent data structures. Easily chain your methods confidently with tons of add

5 Dec 9, 2022

Python library for doing things with Grid-like structures

gridthings Python library for doing things with Grid-like structures Development This project uses poetry for dependency management, pre-commit for li

2 Dec 21, 2021

Supporting information (calculation outputs, structures)

2 Feb 2, 2022

Final Project for Practical Python Programming and Algorithms for Data Analysis

Final Project for Practical Python Programming and Algorithms for Data Analysis (PHW2781L, Summer 2020) Redlining, Race-Exclusive Deed Restriction Lan

1 Jan 27, 2022

Datastructures such as linked list, trees, graphs etc

datastructures datastructures such as linked list, trees, graphs etc Made a public repository for coding enthusiasts. Those who want to collaborate on

0 Dec 1, 2021

Basic sort and search algorithms written in python.

Basic sort and search algorithms written in python. These were all developed as part of my Computer Science course to demonstrate understanding so they aren't 100% efficent

0 Dec 14, 2022

RLStructures is a library to facilitate the implementation of new reinforcement learning algorithms.

RLStructures is a lightweight Python library that provides simple APIs as well as data structures that make as few assumptions as possibl

262 Nov 18, 2022

Integrating C Buffer Data Into the instruction of `.text` segment instead of on `.data`, `.rodata` to avoid copy.

gcc-bufdata-integrating2text Integrating C Buffer Data Into the instruction of .text segment instead of on .data, .rodata to avoid copy. Usage In your

1 Jan 31, 2022

A DSA repository but everything is in python.

DSA Status Contents A: Mathematics B: Bit Magic C: Recursion D: Arrays E: Searching F: Sorting G: Matrix H: Hashing I: String J: Linked List K: Stack

63 Dec 23, 2022

Comments

Concatenation of Array
Given an integer array nums of length n, you want to create an array ans of length 2n where ans[i] == nums[i] and ans[i + n] == nums[i] for 0 <= i < n (0-indexed).

Specifically, ans is the concatenation of two nums arrays.

Return the array ans.

Example 1:

Input: nums = [1,2,1] Output: [1,2,1,1,2,1] Explanation: The array ans is formed as follows:

ans = [nums[0],nums[1],nums[2],nums[0],nums[1],nums[2]]

ans = [1,2,1,1,2,1] #

good first issue hacktoberfest
opened by iaryangoyal 2
Concatenation of Array
Given an integer array nums of length n, you want to create an array ans of length 2n where ans[i] == nums[i] and ans[i + n] == nums[i] for 0 <= i < n (0-indexed).

Specifically, ans is the concatenation of two nums arrays. Example 1:

Input: nums = [1,2,1] Output: [1,2,1,1,2,1] Explanation: The array ans is formed as follows:

ans = [nums[0],nums[1],nums[2],nums[0],nums[1],nums[2]]

ans = [1,2,1,1,2,1]
opened by iaryangoyal 0