Its a Advance DSA repo for honing your skills in Data Structures and Algorithms. Packed with diverse questions of GFG and Leetcode . It's the perfect resource for learners of all levels. Contribute, give feedback, and start mastering DSA today!

This Advanced DSA repository is your go-to resource for sharpening your skills in Data Structures and Algorithms. Filled with a variety of questions from GFG and LeetCode, it caters to learners at all levels. Contribute, provide feedback, and begin your journey to mastering DSA today!

A collection of useful HashSet extension methods

A javascript standard data structure library which benchmark against C++ STL.

Here i will write code for the interview questions that can be asked

Rust implementation of the DCSO Bloom filter

Java data structures for primitive and/or Object items

The go-set package provides generic Set implementations for Go, including HashSet for types with a Hash() function and TreeSet for orderable data

This repository contains a collection of Java projects and exercises that I've worked on, including applications, algorithms, and small code snippets. Each project is organized into separate directories and demonstrates my progress and learning in Java programming. Feel free to explore and provide feedback!

A very performant, fairly lightweight HashSet implementation in C.

Solution Repository for Technical Coding Interviews!

An optimised type-safe enum comparer that doesn't box enum values, created specifically for .NET Framework 3.5 and older.

Concurrent multiplatform hashset with simple API, exception safety, and sequential collision resolution.

A TwinCAT library for creating and manipulating dynamic collections of data in TwinCAT. It provides multiple data structures such as ArrayList (a dynamic array), List (a doubly linked list that is optimized for sequential access and mutation), Set, Map, Queue, Stack and more. Examples are in the project.

Collecting students details.

This is a repository created to store the leetcode questions. This maynot be the most efficient way of solving the problem.

Generic hash set