init docs and dir structure

Author: tarolling

.github/workflows/ci.yml

@@ -0,0 +1,25 @@
+name: Cargo Build & Test
+
+on:
+  push:
+  pull_request:
+
+env: 
+  CARGO_TERM_COLOR: always
+
+jobs:
+  build_and_test:
+    name: Rust project - latest
+    runs-on: ubuntu-latest
+    strategy:
+      matrix:
+        toolchain:
+          - stable
+          - beta
+          - nightly
+    steps:
+      - uses: actions/checkout@v4
+      - run: rustup update ${{ matrix.toolchain }} && rustup default ${{ matrix.toolchain }}
+      - run: cargo build --verbose
+      - run: cargo test --verbose
+  

Cargo.toml

@@ -0,0 +1,6 @@
+[package]
+name = "leetcoders"
+version = "0.0.1"
+edition = "2021"
+
+[dependencies]

src/easy.rs

@@ -0,0 +1,39 @@
+/// Given an array of integers `nums` and an integer `target`, return indices of the two numbers such that they add up to `target`.
+///
+/// You may assume that each input would have **exactly one solution**, and you may not use the same element twice.
+///
+/// You can return the answer in any order.
+///
+/// #### Example 1:
+/// > **Input:** ```nums = [2,7,11,15], target = 9```
+///
+/// > **Output:** ```[0,1]```
+///
+/// > **Explanation:** ```Because nums[0] + nums[1] == 9, we return [0, 1].```
+/// #### Example 2:
+/// > **Input:** ```nums = [3,2,4], target = 6```
+///
+/// > **Output:** ```[1,2]```
+/// #### Example 3:
+/// > **Input:** ```nums = [3,3], target = 6```
+///
+/// > **Output:** ```[0,1]```
+///
+/// #### Constraints:
+/// - <code>2 <= nums.length <= 10<sup>4</sup></code>
+/// - <code>-10<sup>9</sup> <= nums\[i\] <= 10<sup>9</sup></code>
+/// - <code>-10<sup>9</sup> <= target <= 10<sup>9</sup></code>
+/// - **Only one valid answer exists.**
+pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
+    let mut nums: Vec<(usize, i32)> = nums.into_iter().enumerate().collect::<Vec<(usize, i32)>>();
+    nums.sort_unstable_by_key(|&(_, v)| v);
+    for (i, (k, v)) in nums.iter().enumerate() {
+        match nums[i + 1..].binary_search_by_key(&(target - *v), |&(_, b)| b) {
+            Ok(j) => {
+                return vec![*k as i32, nums[j + i + 1].0 as i32];
+            }
+            Err(_) => {}
+        }
+    }
+    unreachable!();
+}

src/hard.rs

@@ -0,0 +1 @@
+

src/lib.rs

@@ -0,0 +1,18 @@
+pub mod easy;
+pub mod hard;
+pub mod medium;
+
+pub fn add(left: u64, right: u64) -> u64 {
+    left + right
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn it_works() {
+        let result = add(2, 2);
+        assert_eq!(result, 4);
+    }
+}

src/medium.rs

@@ -0,0 +1,8 @@
+use leetcoders::easy;
+
+#[test]
+fn test_two_sum() {
+    assert_eq!(easy::two_sum(vec![2, 7, 11, 15], 9), vec![0, 1]);
+    assert_eq!(easy::two_sum(vec![3, 2, 4], 6), vec![1, 2]);
+    assert_eq!(easy::two_sum(vec![3, 3], 6), vec![0, 1]);
+}

tests/easy_tests.rs

@@ -0,0 +1 @@
+