Open Issues Need Help
View All on GitHubAI Summary: Implement a Singly Linked List data structure in Python, including a Node class and methods for appending nodes and displaying the list. Optional: include a delete method. This is part of a larger open-source project focused on algorithm implementations in multiple programming languages.
A beginner-friendly open source repository under HashSlap Summer of Code (HSSoC), focused on implementing, optimizing, and learning popular algorithms across multiple languages. Ideal for first-time contributors to start contributing to open source through real-world algorithmic challenges.
AI Summary: Implement a Queue class in JavaScript with enqueue(), dequeue(), and peek() methods, and demonstrate its usage with example operations. This is part of a larger open-source project focused on implementing algorithms in multiple languages.
A beginner-friendly open source repository under HashSlap Summer of Code (HSSoC), focused on implementing, optimizing, and learning popular algorithms across multiple languages. Ideal for first-time contributors to start contributing to open source through real-world algorithmic challenges.
AI Summary: Implement a Stack class in Python with push(), pop(), and peek() methods, and demonstrate its usage in a main function. This is part of a larger open-source project focused on implementing algorithms in multiple programming languages.
A beginner-friendly open source repository under HashSlap Summer of Code (HSSoC), focused on implementing, optimizing, and learning popular algorithms across multiple languages. Ideal for first-time contributors to start contributing to open source through real-world algorithmic challenges.
AI Summary: Implement a Binary Search Tree (BST) in Java, including a Node class and BST class with insert and inorder traversal methods. The implementation should be well-commented and follow the provided file path and testing instructions.
A beginner-friendly open source repository under HashSlap Summer of Code (HSSoC), focused on implementing, optimizing, and learning popular algorithms across multiple languages. Ideal for first-time contributors to start contributing to open source through real-world algorithmic challenges.
AI Summary: Implement a Binary Tree data structure in JavaScript, including a Node class and a BinaryTree class with insert and inorder traversal methods. The implementation should be added to the specified file path within the HSSoC Algorithm Directory project.
A beginner-friendly open source repository under HashSlap Summer of Code (HSSoC), focused on implementing, optimizing, and learning popular algorithms across multiple languages. Ideal for first-time contributors to start contributing to open source through real-world algorithmic challenges.
AI Summary: Implement a Depth-First Search (DFS) algorithm in C++ using recursion and an adjacency list representation of a graph. The implementation should print the order of nodes visited during the traversal. The task involves creating a `dfs.cpp` file within the specified directory structure and ensuring it compiles and runs correctly.
A beginner-friendly open source repository under HashSlap Summer of Code (HSSoC), focused on implementing, optimizing, and learning popular algorithms across multiple languages. Ideal for first-time contributors to start contributing to open source through real-world algorithmic challenges.
AI Summary: Implement a Breadth-First Search (BFS) algorithm in Java using an adjacency list representation. The implementation should print the traversal order and adhere to the provided file path and comments. Testing is done via a provided bash command.
A beginner-friendly open source repository under HashSlap Summer of Code (HSSoC), focused on implementing, optimizing, and learning popular algorithms across multiple languages. Ideal for first-time contributors to start contributing to open source through real-world algorithmic challenges.
AI Summary: Implement a binary search algorithm in C, taking a sorted array and search element as input, and returning the index of the element if found, or a message indicating it's not present. The implementation should be testable via a provided compilation and execution command.
A beginner-friendly open source repository under HashSlap Summer of Code (HSSoC), focused on implementing, optimizing, and learning popular algorithms across multiple languages. Ideal for first-time contributors to start contributing to open source through real-world algorithmic challenges.
AI Summary: Implement the Quick Sort algorithm in C, including a `main` function to demonstrate its functionality with a sample array. The implementation should be recursive, utilize partitioning, and adhere to the provided file path and comments.
A beginner-friendly open source repository under HashSlap Summer of Code (HSSoC), focused on implementing, optimizing, and learning popular algorithms across multiple languages. Ideal for first-time contributors to start contributing to open source through real-world algorithmic challenges.
AI Summary: Implement the Bubble Sort algorithm in Python. The function should take a list of integers as input and return a sorted list. A `main()` function should demonstrate the implementation with a sample list. The code should be added to `algo-and-data-structures/sorting/bubble-sort.py` and adhere to the provided guidelines.
A beginner-friendly open source repository under HashSlap Summer of Code (HSSoC), focused on implementing, optimizing, and learning popular algorithms across multiple languages. Ideal for first-time contributors to start contributing to open source through real-world algorithmic challenges.