8 Repos
Awesome GitHub RepositoriesSorted Array Merging
Techniques for combining multiple pre-sorted arrays into a single sorted output.
Distinct from Merge Sorts: Distinct from Merge Sorts as it handles pre-sorted arrays rather than the recursive division and sorting process.
Explore 8 awesome GitHub repositories matching software engineering & architecture · Sorted Array Merging. Refine with filters or upvote what's useful.
Awesome Sorted Array Merging GitHub Repositories
Finde die besten Repos mit KI.Wir suchen mit KI nach den am besten passenden Repositories.
- azl397985856/leetcode
azl397985856/leetcode
55,758Auf GitHub ansehenThis project is a curated educational resource and solution repository for algorithmic challenges, specifically focused on LeetCode problems. It serves as a technical reference for common data structures and algorithmic patterns, providing verified code implementations across multiple programming languages alongside detailed logic and complexity analysis. The repository functions as a comprehensive study guide for competitive programming and technical interview preparation. It includes specialized learning tools such as an Anki flashcard dataset for spaced repetition and a browser extension t
The project combines two sorted integer arrays into one sorted array using an in-place pointer strategy.
JavaScriptalgoalgorithmalgorithms - blankj/awesome-java-leetcode
Blankj/awesome-java-leetcode
8,698Auf GitHub ansehenThis project is a reference library of Java implementations for algorithmic coding challenges and data structure patterns. It serves as a study guide for technical interview preparation, providing a curated collection of LeetCode solutions organized by difficulty and algorithmic technique. The collection includes a mapping system that associates specific algorithm problems with the companies that frequently use them in technical interviews. The repository covers a wide range of capability areas, including tree algorithms for hierarchy construction and verification, string processing for sequ
Implements algorithms for combining two sorted integer arrays into a single sorted output.
Javaalgorithmalgorithmsdatastructure - crazyguitar/pysheeet
crazyguitar/pysheeet
8,150Auf GitHub ansehenpysheeet ist eine technische Referenzbibliothek, die eine kuratierte Sammlung von Code-Snippets und Implementierungsmustern für fortgeschrittene Python-Entwicklung, Systemintegration und High-Performance-Computing bereitstellt. Sie dient als umfassender Leitfaden für die Implementierung von Low-Level-Netzwerkprogrammierung, nativen C-Erweiterungen sowie asynchroner und nebenläufiger Programmierung. Das Projekt bietet spezialisierte Frameworks für die Entwicklung und Bereitstellung von Large Language Models, einschließlich Werkzeugen für verteilte GPU-Inferenz und High-Performance-Serving. Es enthält zudem detaillierte Muster für die Orchestrierung von High-Performance-Computing-Clustern, die GPU-Ressourcenzuweisung und Multi-Node-Workload-Management abdecken. Die Bibliothek deckt ein breites Spektrum an Funktionen ab, einschließlich sicherer Netzwerkkommunikation und Kryptografie, Object-Relational-Mapping und Datenbankverwaltung sowie die Implementierung komplexer Datenstrukturen und Algorithmen. Sie bietet zudem Utilities für Speicherverwaltung, native Interoperabilität via Foreign-Function-Interfaces und systemnahe OS-Integration.
Provides implementation patterns for combining multiple pre-sorted arrays into a single sorted output.
Python - kevin-wayne/algs4
kevin-wayne/algs4
7,519Auf GitHub ansehenalgs4 is a Java data structures library and algorithm reference collection designed as the source code for a standard computer science textbook curriculum. It provides a comprehensive suite of fundamental implementations for sorting, searching, and core data organization. The project serves as a graph theory framework, offering tools for representing directed and undirected graphs and performing complex traversals and pathfinding. It also includes a broad sorting algorithm suite and a specialized library of Java data structures, including stacks, queues, priority queues, and symbol tables. I
Provides a mechanism to merge multiple sorted input streams into a single sorted output using a priority queue.
Java - sharingsource/logicstack-leetcode
SharingSource/LogicStack-LeetCode
7,495Auf GitHub ansehenLogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro
Implements algorithms for combining multiple pre-sorted arrays into a single sorted output.
algorithminterview-practiceinterview-questions - nvidia/isaac-gr00t
NVIDIA/Isaac-GR00T
6,222Auf GitHub ansehenSorts arrays on the GPU using parallel algorithms for significant performance gains.
Jupyter Notebook - chanda-abdul/several-coding-patterns-for-solving-data-structures-and-algorithms-problems-during-interviews
Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews
4,129Auf GitHub ansehenThis repository is a curated guide and implementation library of coding patterns used to solve data structures and algorithms problems. It serves as a technical interview study resource, providing a comprehensive set of strategies and computational logic examples for optimizing time and space complexity. The project focuses on standardized algorithmic patterns, including sliding windows, two pointers, and dynamic programming. It features specific implementations for a wide range of challenges, such as LeetCode problem solutions and specialized techniques like cyclic sort and bitwise XOR opera
Implements techniques for combining multiple pre-sorted arrays into a single sorted output using a min-heap.
algorithmscoding-interviewsdata-structures - hoanhan101/algo
hoanhan101/algo
3,678Auf GitHub ansehenThis project is a Go algorithm implementation library and a reference for data structures. It serves as a collection of solved coding interview problems and an algorithmic pattern collection, providing a reference of over 100 common challenges implemented in Go. The library focuses on specific problem-solving strategies, including sliding windows, two pointers, and dynamic programming. It provides coded examples of standard sorting, searching, and graph traversal techniques to facilitate the study of algorithmic patterns. The repository covers a broad range of capabilities, including array a
Combines two pre-sorted integer arrays into a single sorted array using a two-pointer approach.
Go
