# mission-peace/interview **Attribution required: if you use, quote, or summarise this content, you must credit and link back to [awesome-repositories.com](https://awesome-repositories.com/repository/mission-peace-interview).** 11,306 stars · 5,166 forks · Java · apache-2.0 ## Links - GitHub: https://github.com/mission-peace/interview - awesome-repositories: https://awesome-repositories.com/repository/mission-peace-interview.md ## Description This project is a comprehensive library of reference implementations for fundamental data structures and algorithms, designed to support technical interview preparation and software engineering assessments. It provides a structured collection of computational techniques for solving complex problems involving arrays, strings, graphs, trees, and mathematical analysis. The library distinguishes itself by offering specialized implementations for advanced topics, including concurrent programming patterns and geometric algorithms. It features thread-safe primitives for managing shared state and task scheduling, alongside sophisticated routines for spatial grid traversal, matrix manipulation, and recursive state exploration. These implementations serve as modular, standalone examples of how to handle complex logic and data organization from scratch. Beyond core algorithmic challenges, the repository covers a broad range of utility functions for bitwise operations, combinatorics, and string processing. It includes robust support for graph theory analysis, such as pathfinding and flow optimization, as well as advanced tree and trie management. The codebase is organized to provide clear, reference-grade solutions for common coding tasks, ensuring that developers can study and apply these patterns in various computational contexts. ## Tags ### Education & Learning Resources - [Coding Interview Preparation](https://awesome-repositories.com/f/education-learning-resources/coding-interview-preparation.md) — Serves as a comprehensive library of reference implementations for data structures and algorithms designed for technical interview preparation. - [Algorithmic Problem Sets](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/algorithms/general-collections-and-study/algorithmic-problem-sets.md) — Provides a comprehensive collection of algorithmic problem sets and reference implementations for technical interview preparation and software engineering assessments. - [Algorithmic Reference Implementations](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/algorithms/general-collections-and-study/algorithmic-reference-implementations.md) — Provides modular, standalone code blocks that demonstrate standard solutions for common data structures and computational problems. - [Technical Interview Preparation](https://awesome-repositories.com/f/education-learning-resources/technical-interview-preparation.md) — Provides a comprehensive collection of algorithmic patterns and data structures for technical interview preparation. - [Recursive Problem Solving](https://awesome-repositories.com/f/education-learning-resources/technical-domain-education/computer-science-education/algorithmic-problem-solving/recursive-problem-solving.md) — Solves complex combinatorial and optimization challenges by decomposing problems into smaller sub-problems and memoizing intermediate results. - [Disjoint-Set](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/data-structure-implementations/data-structures/disjoint-set.md) — Maintains disjoint set data structures using path compression and union-by-rank to efficiently track connected components. ([source](https://github.com/mission-peace/interview/wiki/Graph)) - [Graph Theory Algorithms](https://awesome-repositories.com/f/education-learning-resources/graph-theory-algorithms.md) — Implements graph theory algorithms for pathfinding, flow optimization, and connectivity analysis. - [Tree Data Structures](https://awesome-repositories.com/f/education-learning-resources/tree-data-structures.md) — Offers reference implementations for binary trees, binary search trees, B-trees, and segment trees. ([source](https://github.com/mission-peace/interview/wiki/Tree)) - [Network Flow Algorithms](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/algorithms/data-ordering-and-retrieval/network-flow-algorithms/network-flow-algorithms.md) — Calculates the maximum flow between a source and sink in a directed graph using the Ford-Fulkerson method. ([source](https://github.com/mission-peace/interview/wiki/Graph)) - [Simulators](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/computer-science-foundations/cellular-automata/simulators.md) — Updates a grid of cells based on predefined rules of survival and birth to model complex systems. ([source](https://github.com/mission-peace/interview/wiki/Multi-Array)) - [Balanced Search Trees](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/data-structure-implementations/data-structures/balanced-search-trees.md) — Implements ternary search trees to optimize memory usage and search performance for string sets. ([source](https://github.com/mission-peace/interview/wiki/Suffix-Prefix)) ### Data & Databases - [Data Structure Implementations](https://awesome-repositories.com/f/data-databases/data-structure-implementations.md) — Offers a comprehensive library of fundamental data structures including trees, graphs, and linked lists with clear, reference-grade implementations. - [Array Manipulation Utilities](https://awesome-repositories.com/f/data-databases/data-processing-pipelines/data-transformation/array-tensor-manipulation/array-manipulation-utilities.md) — Provides standard computational patterns for searching, sorting, and transforming array-based data structures. ([source](https://github.com/mission-peace/interview/wiki/Arrays)) - [Graph Libraries](https://awesome-repositories.com/f/data-databases/graph-computing-systems/graph-theory/graph-libraries.md) — Identifies graph properties including articulation points, bridges, cycles, connectivity, Eulerian paths, and strongly connected components. ([source](https://github.com/mission-peace/interview/wiki/Graph)) - [Stream Median Calculators](https://awesome-repositories.com/f/data-databases/data-processing-pipelines/stream-processing-systems/stream-processing/stream-median-calculators.md) — Calculates the median value of a continuous stream of incoming numbers by maintaining a balanced data structure. ([source](https://github.com/mission-peace/interview/wiki/Stack-Queue)) - [Graph Traversal Strategies](https://awesome-repositories.com/f/data-databases/graph-computing-systems/graph-processing/graph-traversal-strategies.md) — Implements standard graph traversal strategies like Breadth-First Search and Depth-First Search. ([source](https://github.com/mission-peace/interview/wiki/Graph)) - [Recursive Structure Traversers](https://awesome-repositories.com/f/data-databases/recursive-structure-processors/recursive-structure-traversers.md) — Explores paths through grids, trees, or linked structures to identify specific sequences or optimal routes. ([source](https://github.com/mission-peace/interview/wiki/Recursion)) - [Grid-Based](https://awesome-repositories.com/f/data-databases/graph-computing-systems/graph-processing/grid-based.md) — Solves spatial problems like flood filling, island counting, and distance calculations within 2D matrices. ([source](https://github.com/mission-peace/interview/wiki/Graph)) - [Bipartite Matching Algorithms](https://awesome-repositories.com/f/data-databases/graph-computing-systems/graph-theory/graph-libraries/bipartite-matching-algorithms.md) — Identifies the maximum set of edges in a bipartite graph such that no two edges share a common endpoint. ([source](https://github.com/mission-peace/interview/wiki/Graph)) - [Specialized Cache and Stack Structures](https://awesome-repositories.com/f/data-databases/specialized-cache-and-stack-structures.md) — Constructs specialized data structures like least-recently-used caches or stacks with middle-element access using linked list primitives. ([source](https://github.com/mission-peace/interview/wiki/LinkList)) - [Anomaly Detection Algorithms](https://awesome-repositories.com/f/data-databases/anomaly-detection-algorithms.md) — Implements algorithms for detecting missing values and numerical anomalies within ordered sequences. ([source](https://github.com/mission-peace/interview/wiki/Binary-Search)) - [Buffered Data Readers](https://awesome-repositories.com/f/data-databases/buffered-data-readers.md) — Constructs data readers of arbitrary size using restricted functions that only read fixed-length chunks. ([source](https://github.com/mission-peace/interview/wiki/Misc)) - [Graph Coloring Algorithms](https://awesome-repositories.com/f/data-databases/graph-computing-systems/graph-theory/graph-libraries/graph-coloring-algorithms.md) — Assigns colors to graph vertices such that no two adjacent vertices share the same color. ([source](https://github.com/mission-peace/interview/wiki/Graph)) - [Hamiltonian Cycle Detection](https://awesome-repositories.com/f/data-databases/graph-computing-systems/graph-theory/graph-libraries/hamiltonian-cycle-detection.md) — Determines if a graph contains a path that visits every vertex exactly once and returns to the starting point. ([source](https://github.com/mission-peace/interview/wiki/Graph)) ### Software Engineering & Architecture - [Dynamic Programming Solvers](https://awesome-repositories.com/f/software-engineering-architecture/dynamic-programming-solvers.md) — Provides reference implementations for solving classic algorithmic challenges using dynamic programming techniques. ([source](https://github.com/mission-peace/interview/wiki/Dynamic-Programming)) - [Sorting Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms.md) — Organizes collections of data into a specific order using standard techniques like merge, heap, quick, counting, and radix sort. ([source](https://github.com/mission-peace/interview/wiki/Sorting)) - [Interval Merging Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/merge-sorts/interval-merging-algorithms.md) — The library combines two sets of non-overlapping intervals into a single set of merged ranges. ([source](https://github.com/mission-peace/interview/wiki/Misc)) - [Algorithmic Problem Solving](https://awesome-repositories.com/f/software-engineering-architecture/algorithmic-problem-solving.md) — Provides optimized algorithmic solutions for complex computational tasks involving arrays, strings, and graphs. ([source](https://github.com/mission-peace/interview/wiki/Numbers)) - [Array Selection Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/array-selection-algorithms.md) — The library identifies the kth largest value within a two-dimensional array that is sorted by both rows and columns. ([source](https://github.com/mission-peace/interview/wiki/Misc)) - [Concurrency Primitives](https://awesome-repositories.com/f/software-engineering-architecture/concurrency-primitives.md) — Implements thread-safe concurrency primitives and synchronization mechanisms for managing shared state and task scheduling in multi-threaded environments. - [Concurrency Synchronization Primitives](https://awesome-repositories.com/f/software-engineering-architecture/concurrency-synchronization-primitives.md) — Provides thread-safe primitives and synchronization mechanisms for managing shared state and task scheduling in concurrent environments. - [Constraint Satisfaction Solvers](https://awesome-repositories.com/f/software-engineering-architecture/constraint-satisfaction-solvers.md) — Solves complex puzzles and state-space problems by enforcing local rules across variables. ([source](https://github.com/mission-peace/interview/wiki/Recursion)) - [Spatial Grid Traversal Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/spatial-grid-traversal-algorithms.md) — Implements sophisticated routines for spatial grid traversal and matrix manipulation to solve complex algorithmic problems. - [Concurrent Programming Patterns](https://awesome-repositories.com/f/software-engineering-architecture/concurrent-programming-patterns.md) — Features thread-safe primitives and architectural patterns for managing shared state and task scheduling. - [Memory Manipulation](https://awesome-repositories.com/f/software-engineering-architecture/integer-arithmetic/pointer-arithmetic/memory-manipulation.md) — Manages dynamic memory structures by traversing and reordering node references to perform efficient insertions, deletions, and transformations. - [Sorted Array Searchers](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/sorted-array-searchers.md) — Locates elements or ranges within sorted data structures using efficient logarithmic time complexity algorithms. ([source](https://github.com/mission-peace/interview/wiki/Binary-Search)) - [Task Scheduling](https://awesome-repositories.com/f/software-engineering-architecture/task-scheduling.md) — Coordinates the execution of multiple tasks using thread pools and dependency-aware schedulers to optimize parallel processing. ([source](https://github.com/mission-peace/interview/wiki/Multithreading)) - [Date and Time Utilities](https://awesome-repositories.com/f/software-engineering-architecture/date-and-time-utilities.md) — Computes the duration between two time values provided in a four-digit format. ([source](https://github.com/mission-peace/interview/wiki/Misc)) - [Linked List Analysis Utilities](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists/linked-list-analysis-utilities.md) — Detects structural characteristics such as palindromes, loops, middle elements, and duplicate nodes within a list. ([source](https://github.com/mission-peace/interview/wiki/LinkList)) - [Linked List Manipulation Utilities](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists/linked-list-manipulation-utilities.md) — Provides fundamental operations for creating, traversing, and modifying singly and doubly linked lists including insertion, deletion, and rotation. ([source](https://github.com/mission-peace/interview/wiki/LinkList)) - [Linked List Sorting Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists/linked-list-sorting-algorithms.md) — Organizes linked list elements into a specific order using algorithms such as merge sort, quick sort, and insertion sort. ([source](https://github.com/mission-peace/interview/wiki/LinkList)) - [Producer-Consumer Workflow Managers](https://awesome-repositories.com/f/software-engineering-architecture/producer-consumer-workflow-managers.md) — Manages data flow between threads using bounded queues to prevent overflow and ensure orderly processing of incoming messages. ([source](https://github.com/mission-peace/interview/wiki/Multithreading)) - [Randomized Selection Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/randomized-selection-algorithms.md) — Selects elements from a collection based on assigned weights to ensure higher-value items have a greater probability of selection. ([source](https://github.com/mission-peace/interview/wiki/Randomization)) - [Stream Samplers](https://awesome-repositories.com/f/software-engineering-architecture/randomized-selection-algorithms/stream-samplers.md) — Selects a fixed number of elements from a data stream of unknown size with equal probability. ([source](https://github.com/mission-peace/interview/wiki/Randomization)) - [Pattern Occurrence Location Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/string-processing-algorithms/pattern-occurrence-location-algorithms.md) — Locates occurrences of patterns within text using efficient algorithms like Rabin-Karp or Knuth-Morris-Pratt. ([source](https://github.com/mission-peace/interview/wiki/String)) - [Anagram Substring Identifiers](https://awesome-repositories.com/f/software-engineering-architecture/string-processing-algorithms/substring-counting/anagram-substring-identifiers.md) — Determines if any anagram of a given string exists as a substring within another provided string. ([source](https://github.com/mission-peace/interview/wiki/String)) - [Suffix Trees](https://awesome-repositories.com/f/software-engineering-architecture/suffix-trees.md) — Builds compressed trie structures containing all suffixes of a string for rapid querying. ([source](https://github.com/mission-peace/interview/wiki/Suffix-Prefix)) - [Tree Traversal Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/tree-traversal-algorithms.md) — Executes standard and specialized tree traversals including vertical, boundary, and level-order methods. ([source](https://github.com/mission-peace/interview/wiki/Tree)) - [Trie Data Structures](https://awesome-repositories.com/f/software-engineering-architecture/trie-data-structures.md) — Manages prefix tree operations including insertion, search, and deletion for efficient string storage. ([source](https://github.com/mission-peace/interview/wiki/Suffix-Prefix)) - [Linked List Arithmetic Routines](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists/linked-list-arithmetic-routines.md) — Computes sums and products of numbers represented by linked list nodes and returns the result as a new linked list. ([source](https://github.com/mission-peace/interview/wiki/LinkList)) - [Linked List Topology Transformers](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists/linked-list-topology-transformers.md) — Reorganizes list structures by flattening nested lists, converting lists to binary trees, or reversing nodes based on specific grouping criteria. ([source](https://github.com/mission-peace/interview/wiki/LinkList)) - [Load Balancer Design Patterns](https://awesome-repositories.com/f/software-engineering-architecture/load-balancer-design-patterns.md) — Maintains a collection of servers with constant-time operations for adding, removing, and selecting a random instance. ([source](https://github.com/mission-peace/interview/wiki/Misc)) - [Histogram Area Calculators](https://awesome-repositories.com/f/software-engineering-architecture/performance-reliability/performance-engineering/latency-optimization/latency-histograms/histogram-area-calculators.md) — Determines the largest rectangular area possible within a histogram by analyzing bar heights and widths. ([source](https://github.com/mission-peace/interview/wiki/Stack-Queue)) - [Queue Implementations](https://awesome-repositories.com/f/software-engineering-architecture/queue-implementations.md) — Implements fixed-size circular array structures for efficient data insertion and removal. ([source](https://github.com/mission-peace/interview/wiki/Stack-Queue)) - [String Processing Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/string-processing-algorithms.md) — Identifies the shortest substring in a primary string that contains all characters present in a secondary target string. ([source](https://github.com/mission-peace/interview/wiki/String)) - [Longest Common Substring Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/string-processing-algorithms/longest-common-substring-algorithms.md) — Identifies the longest contiguous sequence of characters in a string that contains no repeating characters. ([source](https://github.com/mission-peace/interview/wiki/String)) - [Prefix-Based Pattern Matching Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/string-processing-algorithms/prefix-based-pattern-matching-algorithms.md) — Applies the Z algorithm to identify occurrences of a pattern within a string by precomputing prefix information. ([source](https://github.com/mission-peace/interview/wiki/Suffix-Prefix)) - [Suffix Array Construction](https://awesome-repositories.com/f/software-engineering-architecture/string-processing-algorithms/suffix-array-construction.md) — Generates sorted suffix arrays to facilitate efficient string processing and pattern analysis. ([source](https://github.com/mission-peace/interview/wiki/Suffix-Prefix)) - [Trees](https://awesome-repositories.com/f/software-engineering-architecture/trees.md) — Calculates tree metrics including diameter, independent sets, and path sums. ([source](https://github.com/mission-peace/interview/wiki/Tree)) ### Scientific & Mathematical Computing - [Geometric Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/geometric-algorithms.md) — The library determines the maximum number of points from a provided set that can be connected by a single straight line. ([source](https://github.com/mission-peace/interview/wiki/Geometry)) - [Shortest Path Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/algorithms-and-complexity/algorithms/graph-processing/shortest-path-algorithms.md) — Computes shortest paths between vertices using Dijkstra, Bellman-Ford, Floyd-Warshall, and topological sorting. ([source](https://github.com/mission-peace/interview/wiki/Graph)) - [Range Query Structures](https://awesome-repositories.com/f/scientific-mathematical-computing/range-query-structures.md) — The library performs efficient range minimum queries on an array using a sparse table data structure. ([source](https://github.com/mission-peace/interview/wiki/Misc)) - [Bit Manipulation Techniques](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/algorithms-and-complexity/algorithms/bit-manipulation-techniques.md) — Implements bitwise logic for counting set bits and detecting patterns within binary data. ([source](https://github.com/mission-peace/interview/wiki/Bits)) - [Minimum Spanning Tree Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/algorithms-and-complexity/algorithms/graph-processing/minimum-spanning-tree-algorithms.md) — Implements Kruskal's and Prim's algorithms to determine the minimum spanning tree of a graph. ([source](https://github.com/mission-peace/interview/wiki/Graph)) - [Permutation Rank Determinations](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/arithmetic-number-types/multiplication-algorithms/number-theory-algorithms/permutation-rank-determinations.md) — The library computes the numerical rank of a string based on its position among all possible permutations of its characters. ([source](https://github.com/mission-peace/interview/wiki/String)) - [Subarray Sum Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/subarray-sum-algorithms.md) — The library calculates the number of subarray sums that fall within a specified inclusive range. ([source](https://github.com/mission-peace/interview/wiki/Misc)) - [Matrix Pattern Traversal Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/matrix-pattern-traversal-algorithms.md) — Iterates through two-dimensional arrays using specific geometric paths such as diagonals, spirals, or movement rules defined by cell values. ([source](https://github.com/mission-peace/interview/wiki/Multi-Array)) - [Arithmetic Operations](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/arithmetic-number-types/arithmetic-operations.md) — Provides fundamental arithmetic operations for large numbers and arrays without relying on standard library operators. ([source](https://github.com/mission-peace/interview/wiki/Numbers)) - [Bitwise Numerical Derivations](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/arithmetic-number-types/multiplication-algorithms/number-theory-algorithms/power-of-two-identifications/bitwise-numerical-derivations.md) — The library computes powers of two, squares, and missing values in sequences using bitwise logic to bypass standard arithmetic operators. ([source](https://github.com/mission-peace/interview/wiki/Bits)) - [Convex Hull Computation](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/computational-geometry/geometric-algorithms/convex-hull-computation.md) — Implements standard geometric algorithms like Jarvis march and Graham scan to compute the smallest convex polygon enclosing a set of points. ([source](https://github.com/mission-peace/interview/wiki/Geometry)) - [Distance Metrics](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/mathematical-libraries-and-utilities/core-mathematical-concepts/distance-metrics.md) — Identifies the minimum distance between any two points in a two-dimensional coordinate set. ([source](https://github.com/mission-peace/interview/wiki/Geometry)) - [Statistical Metric Calculators](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/statistics-probability/statistical-analysis-libraries/statistical-metric-calculators.md) — Computes medians and boundary values like floors or ceilings across single or multiple sorted datasets. ([source](https://github.com/mission-peace/interview/wiki/Binary-Search)) - [Geometric Skyline Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/geometric-skyline-algorithms.md) — Merges multiple building height and position profiles into a single continuous skyline representation. ([source](https://github.com/mission-peace/interview/wiki/Misc)) - [Matrix Calculation Utilities](https://awesome-repositories.com/f/scientific-mathematical-computing/matrix-calculation-utilities.md) — Combines or aggregates elements across rows and columns to generate new data structures or compute sums of all possible sub-matrices. ([source](https://github.com/mission-peace/interview/wiki/Multi-Array)) - [Matrix Element Transformation Routines](https://awesome-repositories.com/f/scientific-mathematical-computing/matrix-element-transformation-routines.md) — Modifies a matrix by setting entire rows and columns to a specific value based on the presence of a target element. ([source](https://github.com/mission-peace/interview/wiki/Multi-Array)) - [Longest Palindromic Substring Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/algorithms-and-complexity/string-algorithms/palindromic-sequence-analyzers/longest-palindromic-substring-algorithms.md) — Locates the longest contiguous sequence of characters within a string that reads the same forwards and backwards. ([source](https://github.com/mission-peace/interview/wiki/String)) - [Number Sequence Analyzers](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/arithmetic-number-types/multiplication-algorithms/number-theory-algorithms/number-sequence-analyzers.md) — Identifies arithmetic progressions, lucky numbers, and patterns based on digit constraints or lexicographical ordering. ([source](https://github.com/mission-peace/interview/wiki/Numbers)) - [Prime Generation Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/arithmetic-number-types/multiplication-algorithms/number-theory-algorithms/prime-generation-algorithms.md) — Implements algorithms to identify all prime numbers up to a specified limit. ([source](https://github.com/mission-peace/interview/wiki/Misc)) - [Expression Evaluators](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/mathematical-libraries-and-utilities/mathematical-libraries/expression-evaluators.md) — Finds valid operator placements or interpretations of numeric sequences to reach a target value. ([source](https://github.com/mission-peace/interview/wiki/Recursion)) - [Numerical Representation Converters](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/numerical-representation-converters.md) — Provides utilities for converting between numerical bases and generating integer permutations or partitions. ([source](https://github.com/mission-peace/interview/wiki/Numbers)) ### Operating Systems & Systems Programming - [Bitwise Manipulation Primitives](https://awesome-repositories.com/f/operating-systems-systems-programming/bitwise-manipulation-primitives.md) — Provides low-level operations for transforming and manipulating integer bits. ([source](https://github.com/mission-peace/interview/wiki/Bits)) ### Programming Languages & Runtimes - [Graph-Based Modeling](https://awesome-repositories.com/f/programming-languages-runtimes/programming-utilities/data-structure-type-helpers/data-structures/directed-acyclic-graphs/graph-based-modeling.md) — Represents relationships and spatial constraints as nodes and edges to enable pathfinding, connectivity analysis, and flow optimization. - [Sequence Algorithms](https://awesome-repositories.com/f/programming-languages-runtimes/programming-utilities/standard-libraries/standard-library-implementations/sequence-algorithms.md) — Generates permutations, combinations, and interleavings of input elements. ([source](https://github.com/mission-peace/interview/wiki/Recursion)) - [Sequence Transformation Optimizers](https://awesome-repositories.com/f/programming-languages-runtimes/programming-utilities/standard-libraries/standard-library-implementations/sequence-algorithms/sequence-transformation-optimizers.md) — Calculates the minimum number of edits, swaps, or removals required to transform one sequence into another. ([source](https://github.com/mission-peace/interview/wiki/Recursion)) - [Random Number Generators](https://awesome-repositories.com/f/programming-languages-runtimes/language-features-paradigms/language-features/core-conceptual-frameworks/programming-language-concepts/random-number-generation/random-number-generators.md) — Expands small-range random number generators into larger ranges using rejection sampling. ([source](https://github.com/mission-peace/interview/wiki/Randomization)) - [Array Shufflers](https://awesome-repositories.com/f/programming-languages-runtimes/programming-utilities/standard-libraries/standard-library-implementations/sequence-algorithms/randomization-algorithms/array-shufflers.md) — Rearranges collection items into a random order such that every permutation is equally likely. ([source](https://github.com/mission-peace/interview/wiki/Randomization)) - [Character Distance Rearrangers](https://awesome-repositories.com/f/programming-languages-runtimes/programming-utilities/string-utilities/string-manipulators/edit-distance-calculators/character-distance-rearrangers.md) — Reorders characters in a string so that identical characters are separated by at least a specified minimum distance. ([source](https://github.com/mission-peace/interview/wiki/String)) - [Hamming Distance Calculators](https://awesome-repositories.com/f/programming-languages-runtimes/programming-utilities/string-utilities/string-manipulators/edit-distance-calculators/hamming-distance-calculators.md) — Calculates the bitwise difference between pairs of numbers within arrays. ([source](https://github.com/mission-peace/interview/wiki/Misc)) ### Development Tools & Productivity - [Date and Time Utilities](https://awesome-repositories.com/f/development-tools-productivity/date-and-time-utilities.md) — Computes the total number of days elapsed between two specific calendar dates. ([source](https://github.com/mission-peace/interview/wiki/Misc)) ### User Interface & Experience - [Skyline Merging Algorithms](https://awesome-repositories.com/f/user-interface-experience/element-positioning-utilities/overlap-detection-systems/skyline-merging-algorithms.md) — Combines multiple overlapping building profiles into a single continuous skyline representation by calculating the union of their shapes. ([source](https://github.com/mission-peace/interview/wiki/Geometry))