A repo that might help you for Data structures and Algorithms (DSA) interviews
-
Updated
Oct 4, 2023 - C++
A repo that might help you for Data structures and Algorithms (DSA) interviews
Efficient Prefix-Sum data structures in C++.
My Leetcode Solutions
Some of the leetcode problems that I have solved
leet-code problem's solutions
Topic-wise DSA Problems using C++
HPC - OpenCL: work efficient scan implementation
Solutions with comments for Leetcode-75
A set of parallel programming primitives written in C++ and OpenMP
Love babbar Array sheet
This repository contains my solutions to the LeetCode Daily Challenges of August implemented in C++
Parallel and Distributed Algorithms - Project - Line-of-Sight
Work-efficient Parallel Prefix Scan with Blelloch Algorithm
O(1) region count queries using sparse prefix sums
Implementation of several algorithms in OpenCL
Parallel Scan Algorithm Implemented with OpenMP
Algorithmia: Backtracking, Prefix Sums problems, Multiple Knapsack problem (Dinamyc programing). Adapted BFS, Kruskal, Dijkstra implementations. Heuristics, Greedy algorithms, k-opt search.
Paralelní a distribuované algoritmy - Projekt - Viditelnost
Add a description, image, and links to the prefix-sum topic page so that developers can more easily learn about it.
To associate your repository with the prefix-sum topic, visit your repo's landing page and select "manage topics."