https://github.com/zcemycl/algotest

Solving algorithm problems with C++ (Cmake,gtest), C# (dotnet,xunit), Py (pip,pytest), Js (NodeJS,mocha), bash scripts and github actions, under Win10/OSX/Ubuntu.
https://github.com/zcemycl/algotest
algorithms cmake cpp csharp dotnet github-actions googletest javascript leetcode macosx makefile mocha nodejs pip pytest python3 ubuntu unit-testing win2019 xunit
Last synced: 9 days ago
JSON representation
Solving algorithm problems with C++ (Cmake,gtest), C# (dotnet,xunit), Py (pip,pytest), Js (NodeJS,mocha), bash scripts and github actions, under Win10/OSX/Ubuntu.
Host: GitHub
URL: https://github.com/zcemycl/algotest
Owner: zcemycl
License: mit
Created: 2021-11-01T12:29:15.000Z (over 3 years ago)
Default Branch: main
Last Pushed: 2023-02-13T23:14:20.000Z (about 2 years ago)
Last Synced: 2025-04-21T15:14:33.862Z (11 days ago)
Topics: algorithms, cmake, cpp, csharp, dotnet, github-actions, googletest, javascript, leetcode, macosx, makefile, mocha, nodejs, pip, pytest, python3, ubuntu, unit-testing, win2019, xunit
Language: C++
Homepage:
Size: 2.35 MB
Stars: 3
Watchers: 2
Forks: 1
Open Issues: 2
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project

README

        # Algorithm Tests [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT) [![Hits](https://hits.seeyoufarm.com/api/count/incr/badge.svg?url=https%3A%2F%2Fgithub.com%2Fzcemycl%2FalgoTest&count_bg=%2379C83D&title_bg=%23555555&icon=&icon_color=%23E7E7E7&title=hits&edge_flat=false)](https://hits.seeyoufarm.com)

|Ubuntu|MacOS|Win2019|

|---|---|---|

|![example workflow](https://github.com/zcemycl/algoTest/actions/workflows/py_main.yml/badge.svg)|![example workflow](https://github.com/zcemycl/algoTest/actions/workflows/py-main_macOS_Monterey.yml/badge.svg)|![example workflow](https://github.com/zcemycl/algoTest/actions/workflows/py_main_Win2019.yml/badge.svg)|

|![example workflow](https://github.com/zcemycl/algoTest/actions/workflows/c-cpp.yml/badge.svg)|![example workflow](https://github.com/zcemycl/algoTest/actions/workflows/c-cpp17_macOS_Monterey.yml/badge.svg)|![example workflow](https://github.com/zcemycl/algoTest/actions/workflows/c-cpp_win2019.yml/badge.svg)|

|![example workflow](https://github.com/zcemycl/algoTest/actions/workflows/dotnet.yml/badge.svg)|![example workflow](https://github.com/zcemycl/algoTest/actions/workflows/dotnet_macOS_Monterey.yml/badge.svg)|![example workflow](https://github.com/zcemycl/algoTest/actions/workflows/dotnet_win2019.yml/badge.svg)|

|![example workflow](https://github.com/zcemycl/algoTest/actions/workflows/node.js.yml/badge.svg)|![example workflow](https://github.com/zcemycl/algoTest/actions/workflows/nodejs_macOS_Monterey.yml/badge.svg)|![example workflow](https://github.com/zcemycl/algoTest/actions/workflows/node.js_win2019.yml/badge.svg)|




The repo is about transitioning from Python to C family programming. It implements algorithms with C++(Cmake), C#(dotnet), Python(pip) and Javascript(node), and test them with gtest, Xunits, pytest and mocha respectively. To ensure the code quality, it deploys testings via github actions.

## Structures

```

algoTest 

├── cpp [C++] 

│   └── example (Leetcode c++ questions)

│       ├── build (from configure.sh)

│       ├── lib (google tests placeholder)

│       ├── src (solutions)

│       └── tst (test scripts)

├── cs [C#] 

│   └── sample (Leetcode c# questions)

│       ├── Sample (solutions)

│       └── Sample.Tests (test scripts)

├── cu [cuda]

├── py [Python3] 

│   ├── solns (solutions)

│   └── tests (test scripts)

├── js [NodeJS]

├── sh [Shell] 

└── sql [SQL] 

```

## How to start?

- For C++ questions, change directory to `cpp/example`, and then run

```

./init.sh questionName # to initiate a template

./configure.sh # for cmake and debug

./del.sh questionName # to delete the question

```

- Similarily for C#, change directory to `cs/sample`, 

```

./init.sh questionName # to initiate a template

./del.sh questionName # to delete the question

dotnet build

dotnet run

```

- Similarily for Python3, change directory to `py`,

```

./init.sh questionName # to initiate a template

./del.sh questionName # to delete the question

pytest

```

- To operate on same question with all languages, 

```

./initAll.sh questionName

./delAll.sh questionName

```

## Contents 

:shipit: : Solution | :heavy_check_mark: : Test | Click on Icon to read the code.

### Stanford Algorithm Courses

  Click to expand!

  

|Tasks|C++|C#|Python|Topics|

|---|---|---|---|---|

|Karatsuba Multiplication|[:shipit:](cpp/example/src/KaratsubaMultiply/karatsubaMultiply.cpp) [:heavy_check_mark:](cpp/example/tst/KaratsubaMultiply/KaratsubaMultiply-test.cpp)|||Divide and Conquer|

|Bubble Sort|[:shipit:](cpp/example/src/BubbleSort/bubbleSort.cpp) [:heavy_check_mark:](cpp/example/tst/BubbleSort/BubbleSort-test.cpp)|[:shipit:](cs/sample/Sample/BubbleSort/BubbleSort.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/BubbleSort/testBubbleSort.cs)|[:shipit:](py/solns/bubbleSort/bubbleSort.py) [:heavy_check_mark:](py/tests/testBubbleSort/test_BubbleSort.py)|Sorting Algorithm|

|Merge Sort|[:shipit:](cpp/example/src/MergeSort/mergeSort.cpp) [:heavy_check_mark:](cpp/example/tst/MergeSort/MergeSort-test.cpp)|[:shipit:](cs/sample/Sample/MergeSort/MergeSort.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/MergeSort/testMergeSort.cs)|[:shipit:](py/solns/mergeSort/mergeSort.py) [:heavy_check_mark:](py/tests/testMergeSort/test_MergeSort.py)|Sorting Algorithm, Divide and Conquer|

|Count Inversions|[:shipit:](cpp/example/src/CountInversions/countInversions.cpp) [:heavy_check_mark:](cpp/example/tst/CountInversions/CountInversions-test.cpp)||[:shipit:](py/solns/countInversions/countInversions.py) [:heavy_check_mark:](py/tests/testCountInversions/test_CountInversions.py)|Divide and Conquer|

|Quick Sort|[:shipit:](cpp/example/src/QuickSort/quickSort.cpp) [:heavy_check_mark:](cpp/example/tst/QuickSort/QuickSort-test.cpp)||[:shipit:](py/solns/quickSort/quickSort.py) [:heavy_check_mark:](py/tests/testQuickSort/test_QuickSort.py)|Sorting Algorithm, Divide and Conquer|

|N-th Order Statistics|[:shipit:](cpp/example/src/OrderStats/orderStats.cpp) [:heavy_check_mark:](cpp/example/tst/OrderStats/OrderStats-test.cpp)|||Divide and Conquer, Randomized Algorithm|

|Minimum Cuts|[:shipit:](cpp/example/src/CountMinCuts/countMinCuts.cpp) [:heavy_check_mark:](cpp/example/tst/CountMinCuts/CountMinCuts-test.cpp)||[:shipit:](py/solns/countMinCuts/countMinCuts.py) [:heavy_check_mark:](py/tests/testCountMinCuts/test_CountMinCuts.py)|Graph, Randomized Algorithm|

|Breadth First Search|[:shipit:](cpp/example/src/Bfs/bfs.cpp) [:heavy_check_mark:](cpp/example/tst/Bfs/Bfs-test.cpp)||[:shipit:](py/solns/bfs/bfs.py) [:heavy_check_mark:](py/tests/testBfs/test_Bfs.py)|Graph, BFS, Queue|

|Shortest Paths|||[:shipit:](py/solns/bfsShortestPaths/bfsShortestPaths.py) [:heavy_check_mark:](py/tests/testBfsShortestPaths/test_BfsShortestPaths.py)|Graph, BFS|

|Undirected Connectivity|||[:shipit:](py/solns/bfsConnectivity/bfsConnectivity.py) [:heavy_check_mark:](py/tests/testBfsConnectivity/test_BfsConnectivity.py)|Undirected Graph, BFS|

|Depth First Search|||[:shipit:](py/solns/dfs/dfs.py) [:heavy_check_mark:](py/tests/testDfs/test_Dfs.py)|Graph, DFS|

|Topological Sort|||[:shipit:](py/solns/topologicalSort/topologicalSort.py) [:heavy_check_mark:](py/tests/testTopologicalSort/test_TopologicalSort.py)|Directed Acyclic Graph, DFS|

|Strongly Connected Components|||[:shipit:](py/solns/stronglyConnectedComponents/stronglyConnectedComponents.py) [:heavy_check_mark:](py/tests/testStronglyConnectedComponents/test_StronglyConnectedComponents.py)|Directed Graph, DFS|

|Dijkstra Algorithm|||[:shipit:](py/solns/dijkstra/dijkstra.py) [:heavy_check_mark:](py/tests/testDijkstra/test_Dijkstra.py)|Directed Graph, Heap|

|Heap||||Array, Heap|

|Selection Sort||||Sorting Algorithm|

|Heap Sort||||Sorting Algorithm, Heap|

|Median Maintenance|||[:shipit:](py/solns/medianMaintenance/medianMaintenance.py) [:heavy_check_mark:](py/tests/testMedianMaintenance/test_MedianMaintenance.py)|Heap|

|Red Black Trees||||Binary Search Tree|

|Hash Table||||Hashmap|

|Bloom Filters||||Bloom Filters|

|Union Find||||Union Find|

|Two Sums||||Hashmap|

### Leetcode

  Click to expand!

  

||Tasks|C++|C#|Python|Topics|

|---|---|---|---|---|---|

||ListNode|[:shipit:](cpp/example/src/ListNode/listNode.cpp) [:heavy_check_mark:](cpp/example/tst/ListNode/ListNode-test.cpp)|[:shipit:](cs/sample/Sample/ListNode/ListNode.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/ListNode/testListNode.cs)||Linked List|

||TreeNode|[:shipit:](cpp/example/src/TreeNode/treeNode.cpp) [:heavy_check_mark:](cpp/example/tst/TreeNode/TreeNode-test.cpp)|[:shipit:](cs/sample/Sample/TreeNode/TreeNode.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/TreeNode/testTreeNode.cs)|[:shipit:](py/solns/treeNode/treeNode.py) [:heavy_check_mark:](py/tests/testTreeNode/test_TreeNode.py)|Tree|

||Graph|[:shipit:](cpp/example/src/Graph/graph.cpp) [:heavy_check_mark:](cpp/example/tst/Graph/Graph-test.cpp)|[:shipit:](cs/sample/Sample/Graph/Graph.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/Graph/testGraph.cs)|[:shipit:](py/solns/graph/graph.py) [:heavy_check_mark:](py/tests/testGraph/test_Graph.py)|Graph (Directed, Undirected)|

|1*|Two Sum|[:shipit:](cpp/example/src/TwoSum/twoSum.cpp) [:heavy_check_mark:](cpp/example/tst/TwoSum/TwoSum-test.cpp)|[:shipit:](cs/sample/Sample/TwoSum/TwoSum.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/TwoSum/testTwoSum.cs)|[:shipit:](py/solns/twoSum/twoSum.py) [:heavy_check_mark:](py/tests/testTwoSum/test_TwoSum.py)|Array, Hash map|

|2|Add Two Numbers|[:shipit:](cpp/example/src/AddTwoNumbers/addTwoNumbers.cpp) [:heavy_check_mark:](cpp/example/tst/AddTwoNumbers/AddTwoNumbers-test.cpp)|[:shipit:](cs/sample/Sample/AddTwoNumbers/AddTwoNumbers.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/AddTwoNumbers/testAddTwoNumbers.cs)|[:shipit:](py/solns/addTwoNumbers/addTwoNumbers.py) [:heavy_check_mark:](py/tests/testAddTwoNumbers/test_AddTwoNumbers.py)|Linked List|

|3*|Longest Substring Without Repeating Characters|[:shipit:](cpp/example/src/LengthOfLongestSubString/lengthOfLongestSubString.cpp) [:heavy_check_mark:](cpp/example/tst/LengthOfLongestSubString/LengthOfLongestSubString-test.cpp)|[:shipit:](cs/sample/Sample/LengthOfLongestSubString/LengthOfLongestSubString.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/LengthOfLongestSubString/testLengthOfLongestSubString.cs)|[:shipit:](py/solns/lengthOfLongestSubString/lengthOfLongestSubString.py) [:heavy_check_mark:](py/tests/testLengthOfLongestSubString/test_LengthOfLongestSubString.py)|String, Set, Two Pointers, Sliding Window|

|5*|Longest Palindromic Substring|[:shipit:](cpp/example/src/LongestPalindromicSubstr/longestPalindromicSubstr.cpp) [:heavy_check_mark:](cpp/example/tst/LongestPalindromicSubstr/LongestPalindromicSubstr-test.cpp)||[:shipit:](py/solns/longestPalindromicSubstr/longestPalindromicSubstr.py) [:heavy_check_mark:](py/tests/testLongestPalindromicSubstr/test_LongestPalindromicSubstr.py)|String|

|7|Reverse Integer|[:shipit:](cpp/example/src/ReverseInt/reverseInt.cpp) [:heavy_check_mark:](cpp/example/tst/ReverseInt/ReverseInt-test.cpp)|[:shipit:](cs/sample/Sample/ReverseInt/ReverseInt.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/ReverseInt/testReverseInt.cs)|[:shipit:](py/solns/reverseInt/reverseInt.py) [:heavy_check_mark:](py/tests/testReverseInt/test_ReverseInt.py)||

|9|Palindrome Number|[:shipit:](cpp/example/src/IsPalindrome/isPalindrome.cpp) [:heavy_check_mark:](cpp/example/tst/IsPalindrome/IsPalindrome-test.cpp)|[:shipit:](cs/sample/Sample/IsPalindrome/IsPalindrome.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/IsPalindrome/testIsPalindrome.cs)|[:shipit:](py/solns/isPalindrome/isPalindrome.py) [:heavy_check_mark:](py/tests/testIsPalindrome/test_IsPalindrome.py)||

|11*|Container With Most Water|[:shipit:](cpp/example/src/ContainerWithMostH2O/containerWithMostH2O.cpp) [:heavy_check_mark:](cpp/example/tst/ContainerWithMostH2O/ContainerWithMostH2O-test.cpp)|[:shipit:](cs/sample/Sample/ContainerWithMostH2O/ContainerWithMostH2O.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/ContainerWithMostH2O/testContainerWithMostH2O.cs)|[:shipit:](py/solns/containerWithMostH2O/containerWithMostH2O.py) [:heavy_check_mark:](py/tests/testContainerWithMostH2O/test_ContainerWithMostH2O.py)|Array, Pointer|

|13|Roman to Integer|[:shipit:](cpp/example/src/Roman2Int/roman2Int.cpp) [:heavy_check_mark:](cpp/example/tst/Roman2Int/Roman2Int-test.cpp)|[:shipit:](cs/sample/Sample/Roman2Int/Roman2Int.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/Roman2Int/testRoman2Int.cs)|[:shipit:](py/solns/roman2Int/roman2Int.py) [:heavy_check_mark:](py/tests/testRoman2Int/test_Roman2Int.py)||

|15*|3Sum|||[:shipit:](py/solns/threeSum/threeSum.py) [:heavy_check_mark:](py/tests/testThreeSum/test_ThreeSum.py)|Array, Binary Search|

|17|Letter Combinations of a Phone Number|||[:shipit:](py/solns/letterCombinationsOfPhoneNo/letterCombinationsOfPhoneNo.py)|DFS|

|19*|Remove Nth Node from End of List|||[:shipit:](py/solns/rmNthNodeFromEndOfLinkedList/rmNthNodeFromEndOfLinkedList.py) [:heavy_check_mark:](py/tests/testRmNthNodeFromEndOfLinkedList/test_RmNthNodeFromEndOfLinkedList.py)|Linked List|

|20*|Valid Parentheses|[:shipit:](cpp/example/src/ValidParentheses/validParentheses.cpp) [:heavy_check_mark:](cpp/example/tst/ValidParentheses/ValidParentheses-test.cpp)|[:shipit:](cs/sample/Sample/ValidParentheses/ValidParentheses.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/ValidParentheses/testValidParentheses.cs)|[:shipit:](py/solns/validParentheses/validParentheses.py) [:heavy_check_mark:](py/tests/testValidParentheses/test_ValidParentheses.py)|Stack, Hashmap, Set|

|21*|Merge Two Sorted Lists|[:shipit:](cpp/example/src/Merge2SortedLs/merge2SortedLs.cpp) [:heavy_check_mark:](cpp/example/tst/Merge2SortedLs/Merge2SortedLs-test.cpp)|[:shipit:](cs/sample/Sample/Merge2SortedLs/Merge2SortedLs.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/Merge2SortedLs/testMerge2SortedLs.cs)|[:shipit:](py/solns/merge2SortedLs/merge2SortedLs.py) [:heavy_check_mark:](py/tests/testMerge2SortedLs/test_Merge2SortedLs.py)|Linked List|

|23*|Merge K Sorted Lists|||[:shipit:](py/solns/mergeKSortedLs/mergeKSortedLs.py) [:heavy_check_mark:](py/tests/testMergeKSortedLs/test_MergeKSortedLs.py)|Linked List, Heap|

|26|Remove Duplicates from Sorted Array|[:shipit:](cpp/example/src/RemoveDuplicatesFromSortedArr/removeDuplicatesFromSortedArr.cpp) [:heavy_check_mark:](cpp/example/tst/RemoveDuplicatesFromSortedArr/RemoveDuplicatesFromSortedArr-test.cpp)|[:shipit:](cs/sample/Sample/RemoveDuplicatesFromSortedArr/RemoveDuplicatesFromSortedArr.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/RemoveDuplicatesFromSortedArr/testRemoveDuplicatesFromSortedArr.cs)|[:shipit:](py/solns/removeDuplicatesFromSortedArr/removeDuplicatesFromSortedArr.py) [:heavy_check_mark:](py/tests/testRemoveDuplicatesFromSortedArr/test_RemoveDuplicatesFromSortedArr.py)|Pointers, Inplace Operation|

|27|Remove Element|[:shipit:](cpp/example/src/RmElement/rmElement.cpp) [:heavy_check_mark:](cpp/example/tst/RmElement/RmElement-test.cpp)|[:shipit:](cs/sample/Sample/RmElement/RmElement.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/RmElement/testRmElement.cs)|[:shipit:](py/solns/rmElement/rmElement.py) [:heavy_check_mark:](py/tests/testRmElement/test_RmElement.py)|Pointers, Inplace Operation|

|31|Next Permutation|||[:shipit:](py/solns/nextPermutation/nextPermutation.py)|Pointers|

|33*|Search in Rotated Sorted Array|[:shipit:](cpp/example/src/SearchInRotatedSortedArr/searchInRotatedSortedArr.cpp) [:heavy_check_mark:](cpp/example/tst/SearchInRotatedSortedArr/SearchInRotatedSortedArr-test.cpp)|[:shipit:](cs/sample/Sample/SearchInRotatedSortedArr/SearchInRotatedSortedArr.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/SearchInRotatedSortedArr/testSearchInRotatedSortedArr.cs)|[:shipit:](py/solns/searchInRotatedSortedArr/searchInRotatedSortedArr.py) [:heavy_check_mark:](py/tests/testSearchInRotatedSortedArr/test_SearchInRotatedSortedArr.py)|Array|

|34|Find First and Last Position of Element in Sorted Array|||[:shipit:](py/solns/find1stAndLastPositionOfElementInSortedArr/find1stAndLastPositionOfElementInSortedArr.py)|Array, Binary Search|

|35|Search Insert Position|||[:shipit:](py/solns/searchInsertPos/searchInsertPos.py) [:heavy_check_mark:](py/tests/testSearchInsertPos/test_SearchInsertPos.py)|Two Pointers|

|36|Valid Sudoku|||[:shipit:](py/solns/validSudoku/validSudoku.py) [:heavy_check_mark:](py/tests/testValidSudoku/test_ValidSudoku.py)|Set|

|37|Sudoku Solver|||[:shipit:](py/solns/sudokuSolver/sudokuSolver.py) [:heavy_check_mark:](py/tests/testSudokuSolver/test_SudokuSolver.py)|Set|

|39*|Combination Sum|||[:shipit:](py/solns/combinationSum/combinationSum.py) [:heavy_check_mark:](py/tests/testCombinationSum/test_CombinationSum.py)|Recursive, DFS, Backtracking|

|40|Combination Sum II|||[:shipit:](py/solns/combinationSum2/combinationSum2.py)|DFS|

|42|Trapping Rain Water|||[:shipit:](py/solns/trapRain/trapRain.py)|List|

|46|Permutations|||[:shipit:](py/solns/permutations/permutations.py) [:heavy_check_mark:](py/tests/testPermutations/test_Permutations.py)|Recursive, DFS, Backtracking|

|47|Permutations II|||[:shipit:](py/solns/permutations2/permutations2.py) [:heavy_check_mark:](py/tests/testPermutations2/test_Permutations2.py)|Recursive, DFS, Backtracking|

|48*|Rotate Image|[:shipit:](cpp/example/src/RotateImg/rotateImg.cpp) [:heavy_check_mark:](cpp/example/tst/RotateImg/RotateImg-test.cpp)||[:shipit:](py/solns/rotateImg/rotateImg.py) [:heavy_check_mark:](py/tests/testRotateImg/test_RotateImg.py)|Matrix|

|49*|Group Anagrams|||[:shipit:](py/solns/groupAnagrams/groupAnagrams.py) [:heavy_check_mark:](py/tests/testGroupAnagrams/test_GroupAnagrams.py)|String, Hashmap|

|53*|Maximum Subarray|[:shipit:](cpp/example/src/MaxSubarray/maxSubarray.cpp) [:heavy_check_mark:](cpp/example/tst/MaxSubarray/MaxSubarray-test.cpp)|[:shipit:](cs/sample/Sample/MaxSubarray/MaxSubarray.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/MaxSubarray/testMaxSubarray.cs)|[:shipit:](py/solns/maxSubarray/maxSubarray.py) [:heavy_check_mark:](py/tests/testMaxSubarray/test_MaxSubarray.py)|Array|

|54*|Spiral Matrix|||[:shipit:](py/solns/spiralMatrix/spiralMatrix.py) [:heavy_check_mark:](py/tests/testSpiralMatrix/test_SpiralMatrix.py)|Matrix|

|55*|Jump Game|||[:shipit:](py/solns/jumpGame/jumpGame.py) [:heavy_check_mark:](py/tests/testJumpGame/test_JumpGame.py)|Dynamic Programming, Greedy|

|56*|Merge Intervals|||[:shipit:](py/solns/mergeIntervals/mergeIntervals.py) [:heavy_check_mark:](py/tests/testMergeIntervals/test_MergeIntervals.py)|Interval|

|57*|Insert Interval|||[:shipit:](py/solns/insertInterval/insertInterval.py) [:heavy_check_mark:](py/tests/testInsertInterval/test_InsertInterval.py)|Interval|

|58|Length of Last Word|||[:shipit:](py/solns/lenOfLastWord/lenOfLastWord.py)|String|

|62*|Unique Paths|||[:shipit:](py/solns/uniquePaths/uniquePaths.py) [:heavy_check_mark:](py/tests/testUniquePaths/test_UniquePaths.py)|Dynamic Programming|

|63|Unique Paths II|||[:shipit:](py/solns/uniquePaths2/uniquePaths2.py)|Dynamic Programming|

|64|Minimum Path Sum|||[:shipit:](py/solns/minPathSum/minPathSum.py) [:heavy_check_mark:](py/tests/testMinPathSum/test_MinPathSum.py)|Dynamic Programming, DFS|

|66|Plus One|[:shipit:](cpp/example/src/PlusOne/plusOne.cpp) [:heavy_check_mark:](cpp/example/tst/PlusOne/PlusOne-test.cpp)|[:shipit:](cs/sample/Sample/PlusOne/PlusOne.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/PlusOne/testPlusOne.cs)|[:shipit:](py/solns/plusOne/plusOne.py) [:heavy_check_mark:](py/tests/testPlusOne/test_PlusOne.py)||

|68|Text Justification|||[:shipit:](py/solns/txtJustification/txtJustification.py)|String|

|69|Sqrtx|[:shipit:](cpp/example/src/Sqrtx/sqrtx.cpp) [:heavy_check_mark:](cpp/example/tst/Sqrtx/Sqrtx-test.cpp)|[:shipit:](cs/sample/Sample/Sqrtx/Sqrtx.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/Sqrtx/testSqrtx.cs)|[:shipit:](py/solns/sqrtx/sqrtx.py) [:heavy_check_mark:](py/tests/testSqrtx/test_Sqrtx.py)|Binary Search|

|70*|Climbing Stairs|[:shipit:](cpp/example/src/ClimbingStairs/climbingStairs.cpp) [:heavy_check_mark:](cpp/example/tst/ClimbingStairs/ClimbingStairs-test.cpp)|[:shipit:](cs/sample/Sample/ClimbingStairs/ClimbingStairs.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/ClimbingStairs/testClimbingStairs.cs)|[:shipit:](py/solns/climbingStairs/climbingStairs.py) [:heavy_check_mark:](py/tests/testClimbingStairs/test_ClimbingStairs.py)|Dynamic Programming|

|73*|Set Matrix Zeros|||[:shipit:](py/solns/setMatrixZeros/setMatrixZeros.py) [:heavy_check_mark:](py/tests/testSetMatrixZeros/test_SetMatrixZeros.py)|Matrix|

|74|Search a 2D Matrix|||[:shipit:](py/solns/search2DMat/search2DMat.py)|Binary Search, Matrix|

|76*|Minimum Window Substring|||[:shipit:](py/solns/minWindowSubstr/minWindowSubstr.py) [:heavy_check_mark:](py/tests/testMinWindowSubstr/test_MinWindowSubstr.py)|String|

|77|Combinations|||[:shipit:](py/solns/combinations/combinations.py) [:heavy_check_mark:](py/tests/testCombinations/test_Combinations.py)|DFS|

|78|Subsets|||[:shipit:](py/solns/subsets/subsets.py) [:heavy_check_mark:](py/tests/testSubsets/test_Subsets.py)|DFS|

|79*|Word Search|||[:shipit:](py/solns/wordSearch/wordSearch.py) [:heavy_check_mark:](py/tests/testWordSearch/test_WordSearch.py)|Matrix|

|82|Remove Duplicates from Sorted Array 2|||[:shipit:](py/solns/rmDuplicatesFromSortedArr2/rmDuplicatesFromSortedArr2.py) [:heavy_check_mark:](py/tests/testRmDuplicatesFromSortedArr2/test_RmDuplicatesFromSortedArr2.py)|Linked List|

|90|Subsets II|||[:shipit:](py/solns/subsets2/subsets2.py) [:heavy_check_mark:](py/tests/testSubsets2/test_Subsets2.py)|DFS, Set, Sorting|

|91*|Decode Ways|||[:shipit:](py/solns/decodeWays/decodeWays.py) [:heavy_check_mark:](py/tests/testDecodeWays/test_DecodeWays.py)|DFS, Recursive, Dynamic Programming|

|94|Binary Tree Level Order Traversal|[:shipit:](cpp/example/src/BinaryTreeInorderTraversal/binaryTreeInorderTraversal.cpp) [:heavy_check_mark:](cpp/example/tst/BinaryTreeInorderTraversal/BinaryTreeInorderTraversal-test.cpp)||[:shipit:](py/solns/binaryTreeInorderTraversal/binaryTreeInorderTraversal.py) [:heavy_check_mark:](py/tests/testBinaryTreeInorderTraversal/test_BinaryTreeInorderTraversal.py)|Binary Tree, Inorder Traversal|

|98*|Validate Binary Search Tree|||[:shipit:](py/solns/validateBST/validateBST.py) [:heavy_check_mark:](py/tests/testValidateBST/test_ValidateBST.py)|Binary Search Tree, DFS|

|100*|Same Tree|[:shipit:](cpp/example/src/SameTree/sameTree.cpp) [:heavy_check_mark:](cpp/example/tst/SameTree/SameTree-test.cpp)|[:shipit:](cs/sample/Sample/SameTree/SameTree.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/SameTree/testSameTree.cs)|[:shipit:](py/solns/sameTree/sameTree.py) [:heavy_check_mark:](py/tests/testSameTree/test_SameTree.py)|Tree|

|101|Symmetric Tree|||[:shipit:](py/solns/symmetricTree/symmetricTree.py)|Binary Tree|

|102*|Binary Tree Level Order Traversal|||[:shipit:](py/solns/binaryTreeLevelOrderTraversal/binaryTreeLevelOrderTraversal.py) [:heavy_check_mark:](py/tests/testBinaryTreeLevelOrderTraversal/test_BinaryTreeLevelOrderTraversal.py)|Binary Search Tree, DFS|

|103|Binary Tree Zigzag Level Order Traversal|||[:shipit:](py/solns/btZigzagLevelOrderTraversal/btZigzagLevelOrderTraversal.py)|Binary Tree, DFS|

|104*|Maximum Depth of Binary Tree|||[:shipit:](py/solns/maxDepthBT/maxDepthBT.py) [:heavy_check_mark:](py/tests/testMaxDepthBT/test_MaxDepthBT.py)|Binary Tree, Recursion, DFS|

|105*|Construct Binary Tree from Preorder and Inorder Traversal|||[:shipit:](py/solns/constructBTFromPreorderInorder/constructBTFromPreorderInorder.py) [:heavy_check_mark:](py/tests/testConstructBTFromPreorderInorder/test_ConstructBTFromPreorderInorder.py)|Binary Tree, DFS|

|107|Binary Tree Level Order Traversal II|||[:shipit:](py/solns/btLevelOrderTraversal2/btLevelOrderTraversal2.py)|Binary Tree, DFS|

|111|Minimum Depth of Binary Tree|||[:shipit:](py/solns/minDepthBT/minDepthBT.py)|Binary Tree|

|112|Path Sum|[:shipit:](cpp/example/src/PathSum/pathSum.cpp) [:heavy_check_mark:](cpp/example/tst/PathSum/PathSum-test.cpp)|[:shipit:](cs/sample/Sample/PathSum/PathSum.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/PathSum/testPathSum.cs)|[:shipit:](py/solns/pathSum/pathSum.py) [:heavy_check_mark:](py/tests/testPathSum/test_PathSum.py)|Tree|

|118|Pascal's Triangle|||[:shipit:](py/solns/pascalTriangle/pascalTriangle.py)|List|

|119|Pascal's Triangle II|||[:shipit:](py/solns/pascalTriangle2/pascalTriangle2.py)|List|

|121*|Best Time to Buy and Sell Stock|[:shipit:](cpp/example/src/BestTime2BuyAndSellStock/bestTime2BuyAndSellStock.cpp) [:heavy_check_mark:](cpp/example/tst/BestTime2BuyAndSellStock/BestTime2BuyAndSellStock-test.cpp)|[:shipit:](cs/sample/Sample/BestTime2BuyAndSellStock/BestTime2BuyAndSellStock.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/BestTime2BuyAndSellStock/testBestTime2BuyAndSellStock.cs)|[:shipit:](py/solns/bestTime2BuyAndSellStock/bestTime2BuyAndSellStock.py) [:heavy_check_mark:](py/tests/testBestTime2BuyAndSellStock/test_BestTime2BuyAndSellStock.py)|Array|

|122|Best Time to Buy and Sell Stock II|||[:shipit:](py/solns/bestTime2BuyAndSellStock2/bestTime2BuyAndSellStock2.py)|Array|

|124*|Binary Tree Maximum Path Sum|||[:shipit:](py/solns/binaryTreeMaxPathSum/binaryTreeMaxPathSum.py) [:heavy_check_mark:](py/tests/testBinaryTreeMaxPathSum/test_BinaryTreeMaxPathSum.py)|Binary Tree|

|125*|Valid Palindrome|||[:shipit:](py/solns/validPalindrome/validPalindrome.py) [:heavy_check_mark:](py/tests/testValidPalindrome/test_ValidPalindrome.py)|String, Two Pointers|

|128*|Longest Consecutive Sequence|||[:shipit:](py/solns/longestConsecutiveSeq/longestConsecutiveSeq.py) [:heavy_check_mark:](py/tests/testLongestConsecutiveSeq/test_LongestConsecutiveSeq.py)|Set, Graph|

|129|Sum Root to Leaf Numbers|||[:shipit:](py/solns/sumRoot2LeafNo/sumRoot2LeafNo.py)|Binary Tree|

|133*|Clone Graph|||[:shipit:](py/solns/cloneGraph/cloneGraph.py) [:heavy_check_mark:](py/tests/testCloneGraph/test_CloneGraph.py)|BFS, Graph|

|139*|Word Break|||[:shipit:](py/solns/wordBreak/wordBreak.py) [:heavy_check_mark:](py/tests/testWordBreak/test_WordBreak.py)|Recursive, DFS, Dynamic Programming|

|141*|Linked List Cycle|||[:shipit:](py/solns/linkedListCycle/linkedListCycle.py) [:heavy_check_mark:](py/tests/testLinkedListCycle/test_LinkedListCycle.py)|Linked List|

|142|Linked List Cycle 2|||[:shipit:](py/solns/linkedListCycle2/linkedListCycle2.py) [:heavy_check_mark:](py/tests/testLinkedListCycle2/test_LinkedListCycle2.py)|Linked List|

|143*|Reorder List|||[:shipit:](py/solns/reorderList/reorderList.py) [:heavy_check_mark:](py/tests/testReorderList/test_ReorderList.py)|Linked List|

|144|Binary Tree Preorder Traversal|[:shipit:](cpp/example/src/BinaryTreePreorderTraversal/binaryTreePreorderTraversal.cpp) [:heavy_check_mark:](cpp/example/tst/BinaryTreePreorderTraversal/BinaryTreePreorderTraversal-test.cpp)||[:shipit:](py/solns/binaryTreePreorderTraversal/binaryTreePreorderTraversal.py) [:heavy_check_mark:](py/tests/testBinaryTreePreorderTraversal/test_BinaryTreePreorderTraversal.py)|Binary Tree, Preorder Traversal|

|145|Binary Tree Postorder Traversal|[:shipit:](cpp/example/src/BinaryTreePostorderTraversal/binaryTreePostorderTraversal.cpp) [:heavy_check_mark:](cpp/example/tst/BinaryTreePostorderTraversal/BinaryTreePostorderTraversal-test.cpp)||[:shipit:](py/solns/binaryTreePostorderTraversal/binaryTreePostorderTraversal.py) [:heavy_check_mark:](py/tests/testBinaryTreePostorderTraversal/test_BinaryTreePostorderTraversal.py)|Binary Tree, Postorder Traversal|

|148|Sort List|||[:shipit:](py/solns/sortList/sortList.py)|Linked List, Divide and Conquer|

|152*|Maximum Product Subarray|[:shipit:](cpp/example/src/MaxProdSubarray/maxProdSubarray.cpp) [:heavy_check_mark:](cpp/example/tst/MaxProdSubarray/MaxProdSubarray-test.cpp)|[:shipit:](cs/sample/Sample/MaxProdSubarray/MaxProdSubarray.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/MaxProdSubarray/testMaxProdSubarray.cs)|[:shipit:](py/solns/maxProdSubarray/maxProdSubarray.py) [:heavy_check_mark:](py/tests/testMaxProdSubarray/test_MaxProdSubarray.py)|Array|

|153*|Find Minimum in Rotated Sorted Array|[:shipit:](cpp/example/src/MinRotatedSortedArr/minRotatedSortedArr.cpp) [:heavy_check_mark:](cpp/example/tst/MinRotatedSortedArr/MinRotatedSortedArr-test.cpp)|[:shipit:](cs/sample/Sample/MinRotatedSortedArr/MinRotatedSortedArr.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/MinRotatedSortedArr/testMinRotatedSortedArr.cs)|[:shipit:](py/solns/minRotatedSortedArr/minRotatedSortedArr.py) [:heavy_check_mark:](py/tests/testMinRotatedSortedArr/test_MinRotatedSortedArr.py)|Array|

|167|Two Sum II - Input Array Is Sorted|[:shipit:](cpp/example/src/TwoSum2SortedArr/twoSum2SortedArr.cpp) [:heavy_check_mark:](cpp/example/tst/TwoSum2SortedArr/TwoSum2SortedArr-test.cpp)||[:shipit:](py/solns/twoSum2SortedArr/twoSum2SortedArr.py) [:heavy_check_mark:](py/tests/testTwoSum2SortedArr/test_TwoSum2SortedArr.py)|Binary Search|

|182|Duplicate Emails|[:shipit:](cpp/example/src/DuplicateEmails/duplicateEmails.cpp) [:heavy_check_mark:](cpp/example/tst/DuplicateEmails/DuplicateEmails-test.cpp)|[:shipit:](cs/sample/Sample/DuplicateEmails/DuplicateEmails.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/DuplicateEmails/testDuplicateEmails.cs)|[:shipit:](py/solns/duplicateEmails/duplicateEmails.py) [:heavy_check_mark:](py/tests/testDuplicateEmails/test_DuplicateEmails.py)|SQL, Sqlite3|

|190*|Reverse Bits|[:shipit:](cpp/example/src/ReverseBits/reverseBits.cpp) [:heavy_check_mark:](cpp/example/tst/ReverseBits/ReverseBits-test.cpp)||[:shipit:](py/solns/reverseBits/reverseBits.py) [:heavy_check_mark:](py/tests/testReverseBits/test_ReverseBits.py)|Bitwise Operation|

|191*|Number of 1 Bits|[:shipit:](cpp/example/src/NumOf1Bits/numOf1Bits.cpp) [:heavy_check_mark:](cpp/example/tst/NumOf1Bits/NumOf1Bits-test.cpp)||[:shipit:](py/solns/numOf1Bits/numOf1Bits.py) [:heavy_check_mark:](py/tests/testNumOf1Bits/test_NumOf1Bits.py)|Bitwise Operation|

|193|Valid Phone Numbers||||Shell, Regular Expression|

|195|Tenth Line|[:shipit:](cpp/example/src/TenthLine/tenthLine.cpp) [:heavy_check_mark:](cpp/example/tst/TenthLine/TenthLine-test.cpp)|[:shipit:](cs/sample/Sample/TenthLine/TenthLine.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/TenthLine/testTenthLine.cs)|[:shipit:](py/solns/tenthLine/tenthLine.py) [:heavy_check_mark:](py/tests/testTenthLine/test_TenthLine.py)|Shell|

|198*|House Robber|||[:shipit:](py/solns/houseRobber/houseRobber.py) [:heavy_check_mark:](py/tests/testHouseRobber/test_HouseRobber.py)|Dynamic Programming|

|200*|Number of Islands|||[:shipit:](py/solns/numOfIslands/numOfIslands.py) [:heavy_check_mark:](py/tests/testNumOfIslands/test_NumOfIslands.py)|Graph, DFS|

|203|Remove Linked List Elements|||[:shipit:](py/solns/removeLinkedListElements/removeLinkedListElements.py) [:heavy_check_mark:](py/tests/testRemoveLinkedListElements/test_RemoveLinkedListElements.py)|Linked List|

|206*|Reverse Linked List|||[:shipit:](py/solns/reversedLinkedList/reversedLinkedList.py) [:heavy_check_mark:](py/tests/testReversedLinkedList/test_ReversedLinkedList.py)|Linked List|

|207*|Course Schedule|||[:shipit:](py/solns/courseSchedule/courseSchedule.py) [:heavy_check_mark:](py/tests/testCourseSchedule/test_CourseSchedule.py)|Graph|

|208*|Implement Trie (Prefix Tree)|||[:shipit:](py/solns/implementTrie_PrefixTree/implementTrie_PrefixTree.py) [:heavy_check_mark:](py/tests/testImplementTrie_PrefixTree/test_ImplementTrie_PrefixTree.py)|Prefix Tree|

|211*|Design Add and Search Words Data Structure|||[:shipit:](py/solns/designAddSearchWordsDataStructure/designAddSearchWordsDataStructure.py) [:heavy_check_mark:](py/tests/testDesignAddSearchWordsDataStructure/test_DesignAddSearchWordsDataStructure.py)|Prefix Tree|

|212*|Word Search II||||Tree|

|213*|House Robber 2|||[:shipit:](py/solns/houseRobber2/houseRobber2.py) [:heavy_check_mark:](py/tests/testHouseRobber2/test_HouseRobber2.py)|Dynamic Programming|

|216|Combination Sum III|||[:shipit:](py/solns/combinationSum3/combinationSum3.py)|DFS|

|217*|Contains Duplicate|[:shipit:](cpp/example/src/ContainsDuplicate/containsDuplicate.cpp) [:heavy_check_mark:](cpp/example/tst/ContainsDuplicate/ContainsDuplicate-test.cpp)|[:shipit:](cs/sample/Sample/ContainsDuplicate/ContainsDuplicate.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/ContainsDuplicate/testContainsDuplicate.cs)|[:shipit:](py/solns/containsDuplicate/containsDuplicate.py) [:heavy_check_mark:](py/tests/testContainsDuplicate/test_ContainsDuplicate.py)|Array, Set|

|219|Contains Duplicate 2|[:shipit:](cpp/example/src/ContainsDuplicate2/containsDuplicate2.cpp) [:heavy_check_mark:](cpp/example/tst/ContainsDuplicate2/ContainsDuplicate2-test.cpp)|[:shipit:](cs/sample/Sample/ContainsDuplicate2/ContainsDuplicate2.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/ContainsDuplicate2/testContainsDuplicate2.cs)|[:shipit:](py/solns/containsDuplicate2/containsDuplicate2.py) [:heavy_check_mark:](py/tests/testContainsDuplicate2/test_ContainsDuplicate2.py)|Hashmap|

|226*|Invert Binary Tree|||[:shipit:](py/solns/invertBinaryTree/invertBinaryTree.py) [:heavy_check_mark:](py/tests/testInvertBinaryTree/test_InvertBinaryTree.py)|Binary Tree, DFS|

|230*|Kth Smallest Element in a BST|||[:shipit:](py/solns/kthSmallestElementInBST/kthSmallestElementInBST.py) [:heavy_check_mark:](py/tests/testKthSmallestElementInBST/test_KthSmallestElementInBST.py)|Binary Search Tree, DFS|

|235*|Lowest Common Ancestor of a Binary Search Tree|||[:shipit:](py/solns/lowestCommonAncestorOfBST/lowestCommonAncestorOfBST.py) [:heavy_check_mark:](py/tests/testLowestCommonAncestorOfBST/test_LowestCommonAncestorOfBST.py)|Binary Search Tree|

|238*|Product of Array Except Self|[:shipit:](cpp/example/src/ProdOfArrExceptSelf/prodOfArrExceptSelf.cpp) [:heavy_check_mark:](cpp/example/tst/ProdOfArrExceptSelf/ProdOfArrExceptSelf-test.cpp)|[:shipit:](cs/sample/Sample/ProdOfArrExceptSelf/ProdOfArrExceptSelf.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/ProdOfArrExceptSelf/testProdOfArrExceptSelf.cs)|[:shipit:](py/solns/prodOfArrExceptSelf/prodOfArrExceptSelf.py) [:heavy_check_mark:](py/tests/testProdOfArrExceptSelf/test_ProdOfArrExceptSelf.py)|Array|

|242*|Valid Anagram|||[:shipit:](py/solns/validAnagram/validAnagram.py) [:heavy_check_mark:](py/tests/testValidAnagram/test_ValidAnagram.py)|String, Hashmap|

|252*|Meeting Rooms|||[:shipit:](py/solns/meetingRooms/meetingRooms.py) [:heavy_check_mark:](py/tests/testMeetingRooms/test_MeetingRooms.py)|Interval|

|253*|Meeting Rooms II|||[:shipit:](py/solns/meetingRooms2/meetingRooms2.py) [:heavy_check_mark:](py/tests/testMeetingRooms2/test_MeetingRooms2.py)|Interval|

|257|Binary Tree Paths|||[:shipit:](py/solns/bTPaths/bTPaths.py)|Binary Tree|

|261*|Graph Valid Tree|||[:shipit:](py/solns/graphValidTree/graphValidTree.py) [:heavy_check_mark:](py/tests/testGraphValidTree/test_GraphValidTree.py)|Graph, Tree, DFS|

|268*|Missing Number|[:shipit:](cpp/example/src/MissingNum/missingNum.cpp) [:heavy_check_mark:](cpp/example/tst/MissingNum/MissingNum-test.cpp)||[:shipit:](py/solns/missingNum/missingNum.py) [:heavy_check_mark:](py/tests/testMissingNum/test_MissingNum.py)|Bitwise Operation|

|269*|Alien Dictionary|||[:shipit:](py/solns/alienDict/alienDict.py) [:heavy_check_mark:](py/tests/testAlienDict/test_AlienDict.py)|Graph, DFS, Topological Sort|

|271*|Encode and Decode Strings|||[:shipit:](py/solns/encodeDecodeStrs/encodeDecodeStrs.py) [:heavy_check_mark:](py/tests/testEncodeDecodeStrs/test_EncodeDecodeStrs.py)|String|

|295*|Find Median from Data Stream|||[:shipit:](py/solns/findMedianFromDataStream/findMedianFromDataStream.py) [:heavy_check_mark:](py/tests/testFindMedianFromDataStream/test_FindMedianFromDataStream.py)|Heap|

|297*|Serialize and Deserialize Binary Tree|||[:shipit:](py/solns/serialDeserializeBT/serialDeserializeBT.py) [:heavy_check_mark:](py/tests/testSerialDeserializeBT/test_SerialDeserializeBT.py)|Binary Tree, Preorder Traversal|

|300*|Longest Increasing Subsequence|||[:shipit:](py/solns/longestIncreasingSubseq/longestIncreasingSubseq.py) [:heavy_check_mark:](py/tests/testLongestIncreasingSubseq/test_LongestIncreasingSubseq.py)|Recursive, DFS, Dynamic Programming|

|314|Binary Tree Vertical Order Traversal|||[:shipit:](py/solns/btVerticalOrderTraversal/btVerticalOrderTraversal.py)|Binary Tree, BFS|

|322*|Coin Change|||[:shipit:](py/solns/coinChange/coinChange.py) [:heavy_check_mark:](py/tests/testCoinChange/test_CoinChange.py)|Recursive, DFS, Dynamic Programming|

|323*|Number of Connected Components in an Undirected Graph|||[:shipit:](py/solns/numOfConnectedComponentsInUndirectedGraph/numOfConnectedComponentsInUndirectedGraph.py) [:heavy_check_mark:](py/tests/testNumOfConnectedComponentsInUndirectedGraph/test_NumOfConnectedComponentsInUndirectedGraph.py)|DFS, Graph|

|338*|Counting Bits|||[:shipit:](py/solns/countingBits/countingBits.py) [:heavy_check_mark:](py/tests/testCountingBits/test_CountingBits.py)|Bitwise Operation|

|347*|Top K Frequent Elements|||[:shipit:](py/solns/topKFrequentElements/topKFrequentElements.py) [:heavy_check_mark:](py/tests/testTopKFrequentElements/test_TopKFrequentElements.py)|Heap|

|359|Logger Rate Limiter|||[:shipit:](py/solns/loggerRateLimiter/loggerRateLimiter.py)|Hashmap|

|366|Find Leaves in Binary Tree|||[:shipit:](py/solns/findLeavesBT/findLeavesBT.py)|Binary Tree|

|371*|Sum of Two Integers|[:shipit:](cpp/example/src/SumOfTwoInts/sumOfTwoInts.cpp) [:heavy_check_mark:](cpp/example/tst/SumOfTwoInts/SumOfTwoInts-test.cpp)||[:shipit:](py/solns/sumOfTwoInts/sumOfTwoInts.py) [:heavy_check_mark:](py/tests/testSumOfTwoInts/test_SumOfTwoInts.py)|Bitwise Operation|

|377|Combination Sum IV|||[:shipit:](py/solns/combinationSum4/combinationSum4.py)|Dynamic Programming|

|394|Decode String|||[:shipit:](py/solns/decodeStr/decodeStr.py) [:heavy_check_mark:](py/tests/testDecodeStr/test_DecodeStr.py)|Stack|

|404|Sum of Left Leaves|[:shipit:](cpp/example/src/SumOfLeftLeaves/sumOfLeftLeaves.cpp) [:heavy_check_mark:](cpp/example/tst/SumOfLeftLeaves/SumOfLeftLeaves-test.cpp)|[:shipit:](cs/sample/Sample/SumOfLeftLeaves/SumOfLeftLeaves.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/SumOfLeftLeaves/testSumOfLeftLeaves.cs)|[:shipit:](py/solns/sumOfLeftLeaves/sumOfLeftLeaves.py) [:heavy_check_mark:](py/tests/testSumOfLeftLeaves/test_SumOfLeftLeaves.py)|Tree|

|417*|Pacific Atlantic Water Flow|||[:shipit:](py/solns/pacificAtlanticWaterFlow/pacificAtlanticWaterFlow.py) [:heavy_check_mark:](py/tests/testPacificAtlanticWaterFlow/test_PacificAtlanticWaterFlow.py)|Graph, DFS|

|423|Reconstruct Original Digits from English|||[:shipit:](py/solns/reconstructDigitsFromEng/reconstructDigitsFromEng.py)|DFS|

|424*|Longest Repeating Character Replacement|||[:shipit:](py/solns/longestRepeatingCharReplacement/longestRepeatingCharReplacement.py) [:heavy_check_mark:](py/tests/testLongestRepeatingCharReplacement/test_LongestRepeatingCharReplacement.py)|String, Hashmap, Two Pointers|

|435*|Non-overlapping Intervals|||[:shipit:](py/solns/nonOverlappingIntervals/nonOverlappingIntervals.py) [:heavy_check_mark:](py/tests/testNonOverlappingIntervals/test_NonOverlappingIntervals.py)|Interval|

|442|Find All Duplicates in an Array|[:shipit:](cpp/example/src/FindDuplicatesArr/findDuplicatesArr.cpp) [:heavy_check_mark:](cpp/example/tst/FindDuplicatesArr/FindDuplicatesArr-test.cpp)|[:shipit:](cs/sample/Sample/FindDuplicatesArr/FindDuplicatesArr.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/FindDuplicatesArr/testFindDuplicatesArr.cs)|[:shipit:](py/solns/findDuplicatesArr/findDuplicatesArr.py) [:heavy_check_mark:](py/tests/testFindDuplicatesArr/test_FindDuplicatesArr.py)|Hashmap|

|509|Fibonacci Number|||[:shipit:](py/solns/fibonacciNum/fibonacciNum.py)|Dynamic Programming|

|538|Convert BST to Greater Tree|||[:shipit:](py/solns/convertBST2GreaterTree/convertBST2GreaterTree.py) [:heavy_check_mark:](py/tests/testConvertBST2GreaterTree/test_ConvertBST2GreaterTree.py)|BST, DFS, Recursive|

|572*|Subtree of Another Tree|||[:shipit:](py/solns/subtreeOfAnotherTree/subtreeOfAnotherTree.py) [:heavy_check_mark:](py/tests/testSubtreeOfAnotherTree/test_SubtreeOfAnotherTree.py)|Binary Tree. DFS|

|589|N-ary Tree Preorder Traversal|[:shipit:](cpp/example/src/NaryTreePreorderTraversal/naryTreePreorderTraversal.cpp) [:heavy_check_mark:](cpp/example/tst/NaryTreePreorderTraversal/NaryTreePreorderTraversal-test.cpp)||[:shipit:](py/solns/naryTreePreorderTraversal/naryTreePreorderTraversal.py) [:heavy_check_mark:](py/tests/testNaryTreePreorderTraversal/test_NaryTreePreorderTraversal.py)|Tree, Preorder Traversal|

|590|N-ary Tree Postorder Traversal|[:shipit:](cpp/example/src/NaryTreePostorderTraversal/naryTreePostorderTraversal.cpp) [:heavy_check_mark:](cpp/example/tst/NaryTreePostorderTraversal/NaryTreePostorderTraversal-test.cpp)||[:shipit:](py/solns/naryTreePostorderTraversal/naryTreePostorderTraversal.py) [:heavy_check_mark:](py/tests/testNaryTreePostorderTraversal/test_NaryTreePostorderTraversal.py)|Tree, Postorder Traversal|

|637|Average of Levels in Binary Tree|||[:shipit:](py/solns/avgOfLevelsBT/avgOfLevelsBT.py)|Binary Tree|

|647*|Palindromic Substrings|[:shipit:](cpp/example/src/PalindromicSubstrs/palindromicSubstrs.cpp) [:heavy_check_mark:](cpp/example/tst/PalindromicSubstrs/PalindromicSubstrs-test.cpp)||[:shipit:](py/solns/palindromicSubstrs/palindromicSubstrs.py) [:heavy_check_mark:](py/tests/testPalindromicSubstrs/test_PalindromicSubstrs.py)|String|

|652|Find Duplicate Subtrees|||[:shipit:](py/solns/findDuplicateSubtrees/findDuplicateSubtrees.py)|Binary Tree, DFS, Hashmap|

|662|Maximum Width of Binary Tree|||[:shipit:](py/solns/maxWidthBT/maxWidthBT.py)|Binary Tree|

|695|Max Area of Island|||[:shipit:](py/solns/maxAreaIsland/maxAreaIsland.py) [:heavy_check_mark:](py/tests/testMaxAreaIsland/test_MaxAreaIsland.py)|Graph, DFS|

|696|Count Binary Substrings|||[:shipit:](py/solns/countBinarySubstrs/countBinarySubstrs.py)|List, String|

|700|Search in a Binary Search Tree|||[:shipit:](py/solns/searchInBST/searchInBST.py) [:heavy_check_mark:](py/tests/testSearchInBST/test_SearchInBST.py)|Binary Search Tree|

|704|Binary Search|[:shipit:](cpp/example/src/BinarySearch/binarySearch.cpp) [:heavy_check_mark:](cpp/example/tst/BinarySearch/BinarySearch-test.cpp)|[:shipit:](cs/sample/Sample/BinarySearch/BinarySearch.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/BinarySearch/testBinarySearch.cs)|[:shipit:](py/solns/binarySearch/binarySearch.py) [:heavy_check_mark:](py/tests/testBinarySearch/test_BinarySearch.py)|Binary Search|

|814|Binary Tree Pruning|||[:shipit:](py/solns/binaryTreePruning/binaryTreePruning.py) [:heavy_check_mark:](py/tests/testBinaryTreePruning/test_BinaryTreePruning.py)|Binary Tree, DFS|

|876|Middle of the Linked List|||[:shipit:](py/solns/middleOfLinkedLs/middleOfLinkedLs.py) [:heavy_check_mark:](py/tests/testMiddleOfLinkedLs/test_MiddleOfLinkedLs.py)|Linked List|

|912|Sort an Array|[:shipit:](cpp/example/src/MergeSort/mergeSort.cpp) [:heavy_check_mark:](cpp/example/tst/MergeSort/MergeSort-test.cpp)|[:shipit:](cs/sample/Sample/MergeSort/MergeSort.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/MergeSort/testMergeSort.cs)|[:shipit:](py/solns/mergeSort/mergeSort.py) [:heavy_check_mark:](py/tests/testMergeSort/test_MergeSort.py)|Sorting Algorithm, Divide and Conquer|

|938|Range Sum of BST|||[:shipit:](py/solns/rangeSumBST/rangeSumBST.py) [:heavy_check_mark:](py/tests/testRangeSumBST/test_RangeSumBST.py)|DFS, Binary Search Tree|

|973|K Closest Points to Origin|||[:shipit:](py/solns/kClosestPts2Origin/kClosestPts2Origin.py)|Heap, Sorting|

|980|Unique Paths III|||[:shipit:](py/solns/uniquePaths3/uniquePaths3.py)|Graph, DFS, Backtracking|

|989|Add to Array-Form of Integer|[:shipit:](cpp/example/src/Add2IntArr/add2IntArr.cpp) [:heavy_check_mark:](cpp/example/tst/Add2IntArr/Add2IntArr-test.cpp)|[:shipit:](cs/sample/Sample/Add2IntArr/Add2IntArr.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/Add2IntArr/testAdd2IntArr.cs)|[:shipit:](py/solns/add2IntArr/add2IntArr.py) [:heavy_check_mark:](py/tests/testAdd2IntArr/test_Add2IntArr.py)||

|1009|Complement of Base 10 Integer|[:shipit:](cpp/example/src/ComplementBase10Int/complementBase10Int.cpp) [:heavy_check_mark:](cpp/example/tst/ComplementBase10Int/ComplementBase10Int-test.cpp)|[:shipit:](cs/sample/Sample/ComplementBase10Int/ComplementBase10Int.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/ComplementBase10Int/testComplementBase10Int.cs)|[:shipit:](py/solns/complementBase10Int/complementBase10Int.py) [:heavy_check_mark:](py/tests/testComplementBase10Int/test_ComplementBase10Int.py)|Bitwise Operation|

|1023|Camelcase Matching|||[:shipit:](py/solns/camelcaseMatch/camelcaseMatch.py)|String|

|1056|Confusing Number|[:shipit:](cpp/example/src/ConfusingNum/confusingNum.cpp) [:heavy_check_mark:](cpp/example/tst/ConfusingNum/ConfusingNum-test.cpp)|[:shipit:](cs/sample/Sample/ConfusingNum/ConfusingNum.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/ConfusingNum/testConfusingNum.cs)|[:shipit:](py/solns/confusingNum/confusingNum.py) [:heavy_check_mark:](py/tests/testConfusingNum/test_ConfusingNum.py)|Hashmap, Set|

|1089|Duplicate Zeros|[:shipit:](cpp/example/src/DuplicateZeros/duplicateZeros.cpp) [:heavy_check_mark:](cpp/example/tst/DuplicateZeros/DuplicateZeros-test.cpp)|[:shipit:](cs/sample/Sample/DuplicateZeros/DuplicateZeros.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/DuplicateZeros/testDuplicateZeros.cs)|[:shipit:](py/solns/duplicateZeros/duplicateZeros.py) [:heavy_check_mark:](py/tests/testDuplicateZeros/test_DuplicateZeros.py)|Inplace Operation|

|1091|Shortest Path in Binary Matrix|||[:shipit:](py/solns/shortestPathInBinaryMat/shortestPathInBinaryMat.py)|Graph, Backtracking, BFS|

|1119|Remove Vowels from a String|[:shipit:](cpp/example/src/RemoveVowelsFromStr/removeVowelsFromStr.cpp) [:heavy_check_mark:](cpp/example/tst/RemoveVowelsFromStr/RemoveVowelsFromStr-test.cpp)|[:shipit:](cs/sample/Sample/RemoveVowelsFromStr/RemoveVowelsFromStr.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/RemoveVowelsFromStr/testRemoveVowelsFromStr.cs)|[:shipit:](py/solns/removeVowelsFromStr/removeVowelsFromStr.py) [:heavy_check_mark:](py/tests/testRemoveVowelsFromStr/test_RemoveVowelsFromStr.py)|Regular Expression|

|1143*|Longest Common Subsequence|||[:shipit:](py/solns/longestCommonSubseq/longestCommonSubseq.py) [:heavy_check_mark:](py/tests/testLongestCommonSubseq/test_LongestCommonSubseq.py)|Backtracking, Recursive, Dynamic Programming|

|1146|Snapshot Array|||[:shipit:](py/solns/snapshotArr/snapshotArr.py)|Hashmap|

|1277|Count Square Submatrices with All Ones|||[:shipit:](py/solns/countSqSubmatricesWithAll1s/countSqSubmatricesWithAll1s.py)|Matrix, Dynamic Programming|

|1288|Remove Covered Intervals|||[:shipit:](py/solns/rmCoveredIntervals/rmCoveredIntervals.py)|Interval|

|1290|Convert Binary Number in a Linked List to Integer|[:shipit:](cpp/example/src/ConvertBinaryLinkedList2Int/convertBinaryLinkedList2Int.cpp) [:heavy_check_mark:](cpp/example/tst/ConvertBinaryLinkedList2Int/ConvertBinaryLinkedList2Int-test.cpp)|[:shipit:](cs/sample/Sample/ConvertBinaryLinkedList2Int/ConvertBinaryLinkedList2Int.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/ConvertBinaryLinkedList2Int/testConvertBinaryLinkedList2Int.cs)|[:shipit:](py/solns/convertBinaryLinkedList2Int/convertBinaryLinkedList2Int.py) [:heavy_check_mark:](py/tests/testConvertBinaryLinkedList2Int/test_ConvertBinaryLinkedList2Int.py)|Linked List|

|1293|Shortest Path in a Grid with Obstacles Elimination|||[:shipit:](py/solns/shortestPathInGridWithObstaclesElimination/shortestPathInGridWithObstaclesElimination.py)|Dynamic Programming, DFS, Graph|

|1304|Find N Unique Integers Sum up to Zero|[:shipit:](cpp/example/src/FindNuniqueIntSum2Zero/findNuniqueIntSum2Zero.cpp) [:heavy_check_mark:](cpp/example/tst/FindNuniqueIntSum2Zero/FindNuniqueIntSum2Zero-test.cpp)|[:shipit:](cs/sample/Sample/FindNuniqueIntSum2Zero/FindNuniqueIntSum2Zero.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/FindNuniqueIntSum2Zero/testFindNuniqueIntSum2Zero.cs)|[:shipit:](py/solns/findNuniqueIntSum2Zero/findNuniqueIntSum2Zero.py) [:heavy_check_mark:](py/tests/testFindNuniqueIntSum2Zero/test_FindNuniqueIntSum2Zero.py)||

|1356|Sort Integers by The Number of 1 Bits|[:shipit:](cpp/example/src/SortIntByNum1Bits/sortIntByNum1Bits.cpp) [:heavy_check_mark:](cpp/example/tst/SortIntByNum1Bits/SortIntByNum1Bits-test.cpp)||[:shipit:](py/solns/sortIntByNum1Bits/sortIntByNum1Bits.py) [:heavy_check_mark:](py/tests/testSortIntByNum1Bits/test_SortIntByNum1Bits.py)|Bitwise Operation|

|1394|Find Lucky Integer in an Array|[:shipit:](cpp/example/src/FindLuckyIntInArr/findLuckyIntInArr.cpp) [:heavy_check_mark:](cpp/example/tst/FindLuckyIntInArr/FindLuckyIntInArr-test.cpp)|[:shipit:](cs/sample/Sample/FindLuckyIntInArr/FindLuckyIntInArr.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/FindLuckyIntInArr/testFindLuckyIntInArr.cs)|[:shipit:](py/solns/findLuckyIntInArr/findLuckyIntInArr.py) [:heavy_check_mark:](py/tests/testFindLuckyIntInArr/test_FindLuckyIntInArr.py)|Hashmap|

|1446|Consecutive Characters|||[:shipit:](py/solns/consecutiveChars/consecutiveChars.py) [:heavy_check_mark:](py/tests/testConsecutiveChars/test_ConsecutiveChars.py)||

|1464|Maximum Product of Two Elements in Array|[:shipit:](cpp/example/src/MaxProdOf2ElementsInArr/maxProdOf2ElementsInArr.cpp) [:heavy_check_mark:](cpp/example/tst/MaxProdOf2ElementsInArr/MaxProdOf2ElementsInArr-test.cpp)|[:shipit:](cs/sample/Sample/MaxProdOf2ElementsInArr/MaxProdOf2ElementsInArr.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/MaxProdOf2ElementsInArr/testMaxProdOf2ElementsInArr.cs)|[:shipit:](py/solns/maxProdOf2ElementsInArr/maxProdOf2ElementsInArr.py) [:heavy_check_mark:](py/tests/testMaxProdOf2ElementsInArr/test_MaxProdOf2ElementsInArr.py)|Pointers|

|1518|Water Bottles|||[:shipit:](py/solns/waterBottles/waterBottles.py)||

|1592|Rearrange Spaces Between Words|||[:shipit:](py/solns/rearrangeSpacesBetweenWords/rearrangeSpacesBetweenWords.py)|String|

|1609|Even Odd Tree|||[:shipit:](py/solns/evenOddTree/evenOddTree.py)|Binary Tree|

|1805|Number of Different Integers in a String|[:shipit:](cpp/example/src/NumDifferentIntsInStr/numDifferentIntsInStr.cpp) [:heavy_check_mark:](cpp/example/tst/NumDifferentIntsInStr/NumDifferentIntsInStr-test.cpp)|[:shipit:](cs/sample/Sample/NumDifferentIntsInStr/NumDifferentIntsInStr.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/NumDifferentIntsInStr/testNumDifferentIntsInStr.cs)|[:shipit:](py/solns/numDifferentIntsInStr/numDifferentIntsInStr.py) [:heavy_check_mark:](py/tests/testNumDifferentIntsInStr/test_NumDifferentIntsInStr.py)|Set|

|1812|Determine Color of a Chessboard Square|||[:shipit:](py/solns/colorOfChessboardSquare/colorOfChessboardSquare.py)|Hashmap|

|1836|Remove Duplicates From an Unsorted Linked List|||[:shipit:](py/solns/rmDuplicatesFromUnsortedLinkedList/rmDuplicatesFromUnsortedLinkedList.py) [:heavy_check_mark:](py/tests/testRmDuplicatesFromUnsortedLinkedList/test_RmDuplicatesFromUnsortedLinkedList.py)|Linked List|

|1929|Concatenation of Array|||[:shipit:](py/solns/concatArray/concatArray.py)|List|

|2007|Find Original Array From Doubled Array|||[:shipit:](py/solns/findOriginalArrFromDoubledArr/findOriginalArrFromDoubledArr.py)|Hashmap|

|2096|Step-By-Step Directions From a Binary Tree Node to Another|||[:shipit:](py/solns/stepByStepDirectionsFromBTNodeToAnother/stepByStepDirectionsFromBTNodeToAnother.py)|Hashmap, Graph, Binary Tree|

### Testing Samples

  Click to expand!

|Tasks|C++|C#|Python|Js|Topics|

|---|---|---|---|---|---|

|Unit Testing|[:shipit:](cpp/example/src/Pointer/pointer.cpp) [:heavy_check_mark:](cpp/example/tst/Pointer/Pointer-test.cpp)|[:shipit:](cs/sample/Sample/ListNode/ListNode.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/ListNode/testListNode.cs)|[:shipit:](py/solns/solnSample.py) [:heavy_check_mark:](py/tests/test_Sample.py)|[:shipit:](js/src/sample/sample1.js) [:heavy_check_mark:](js/test/sample/sample1.test.js)|Unit Testing|

|Parameterized Unit Testing|[:shipit:](cpp/example/src/RmElement/rmElement.cpp) [:heavy_check_mark:](cpp/example/tst/RmElement/RmElement-test.cpp)|[:shipit:](cs/sample/Sample/BinarySearch/BinarySearch.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/BinarySearch/testBinarySearch.cs)|[:shipit:](py/solns/binarySearch/binarySearch.py) [:heavy_check_mark:](py/tests/testBinarySearch/test_BinarySearch.py)||Unit Testing|

|Testing with Fixture|[:shipit:](cpp/example/src/Bfs/bfs.cpp) [:heavy_check_mark:](cpp/example/tst/Bfs/Bfs-test.cpp)||[:shipit:](py/solns/bfs/bfs.py) [:heavy_check_mark:](py/tests/testBfs/test_Bfs.py)||Unit Testing|

### HackerRank 

  Click to expand!

|Tasks||Language|Topics|

|---|---|---|---|

|Height of a Binary Tree|[:shipit:](py/solns/heightBT/heightBT.py) [:heavy_check_mark:](py/tests/testHeightBT/test_HeightBT.py)|Python|Binary Tree|

|Lowest Common Ancestor|[:shipit:](py/solns/lca/lca.py) [:heavy_check_mark:](py/tests/testLca/test_Lca.py)|Python|Binary Search Tree|

|Is This a Binary Search Tree?|[:shipit:](py/solns/isBST/isBST.py) [:heavy_check_mark:](py/tests/testIsBST/test_IsBST.py)|Python|Binary Search Tree|

|Huffman Decoding|[:shipit:](py/solns/huffmanDecoding/huffmanDecoding.py) [:heavy_check_mark:](py/tests/testHuffmanDecoding/test_HuffmanDecoding.py)|Python|Binary Tree|

### TestDome

  Click to expand!

  

|Tasks||Topics|

|---|---|---|

|League Table|[:shipit:](py/solns/leagueTable/leagueTable.py) [:heavy_check_mark:](py/tests/testLeagueTable/test_LeagueTable.py)|Python, Counter, OrderedDict, Sorting|

|Ice Cream Machine|[:shipit:](py/solns/iceCreamMachine/iceCreamMachine.py) [:heavy_check_mark:](py/tests/testIceCreamMachine/test_IceCreamMachine.py)|Python|

|Binary Search Tree|[:shipit:](py/solns/bstNamedTuple/bstNamedTuple.py) [:heavy_check_mark:](py/tests/testBstNamedTuple/test_BstNamedTuple.py)|Python, NamedTuple, BST|

|Merge Names|[:shipit:](py/solns/mergeNames/mergeNames.py) [:heavy_check_mark:](py/tests/testMergeNames/test_MergeNames.py)|Python, Set|

|Sorted Search|[:shipit:](py/solns/sortedSearch/sortedSearch.py) [:heavy_check_mark:](py/tests/testSortedSearch/test_SortedSearch.py)|Python, Binary Search|

|File Owners|[:shipit:](py/solns/fileOwners/fileOwners.py) [:heavy_check_mark:](py/tests/testFileOwners/test_FileOwners.py)|Python|

|Song|[:shipit:](py/solns/song/song.py) [:heavy_check_mark:](py/tests/testSong/test_Song.py)|Python, Linked List|

|Train Composition|[:shipit:](py/solns/trainComposition/trainComposition.py) [:heavy_check_mark:](py/tests/testTrainComposition/test_TrainComposition.py)|Python, Deque|

|Route Planner|[:shipit:](py/solns/routePlanner/routePlanner.py) [:heavy_check_mark:](py/tests/testRoutePlanner/test_RoutePlanner.py)|Python, Stack, DFS, Graph|

|Two Sum|[:shipit:](py/solns/twoSumTestDome/twoSumTestDome.py) [:heavy_check_mark:](py/tests/testTwoSumTestDome/test_TwoSumTestDome.py)|Python|

|Pipeline|[:shipit:](py/solns/pipeline/pipeline.py) [:heavy_check_mark:](py/tests/testPipeline/test_Pipeline.py)|Python, Nested Function|

|Log Patch|[:shipit:](py/solns/logPatch/logPatch.py) [:heavy_check_mark:](py/tests/testLogPatch/test_LogPatch.py)|Python, Monkey Patching|

|Iris Classifier|[:shipit:](py/solns/irisClassifier/irisClassifier.py) [:heavy_check_mark:](py/tests/testIrisClassifier/test_IrisClassifier.py)|Python, Data Science, Sklearn|

|Login Table|[:shipit:](py/solns/loginTable/loginTable.py) [:heavy_check_mark:](py/tests/testLoginTable/test_LoginTable.py)|Python, Data Science, Pandas|

|Dog Classification|[:shipit:](py/solns/dogClassify/dogClassify.py) [:heavy_check_mark:](py/tests/testDogClassify/test_DogClassify.py)|Python, Data Science, Decision Boundary|

|Stock Prices|[:shipit:](py/solns/stockPrices/stockPrices.py) [:heavy_check_mark:](py/tests/testStockPrices/test_StockPrices.py)|Python, Data Science, Correlation|

|Pet Detection|[:shipit:](py/solns/petDetection/petDetection.py) [:heavy_check_mark:](py/tests/testPetDetection/test_PetDetection.py)|Python, Data Science, Confusion Matrix|

|Marketing Costs|[:shipit:](py/solns/marketingCosts/marketingCosts.py) [:heavy_check_mark:](py/tests/testMarketingCosts/test_MarketingCosts.py)|Python, Data Science, Linear Regression|

|AB Test|[:shipit:](py/solns/abTest/README.md) |Python, Data Science, Probability, Bayes Law|

|Petri Dish|[:shipit:](py/solns/petriDish/README.md)|Python, Data Science, Pearson Correlation|

|Election Poll|[:shipit:](py/solns/electionPoll/electionPoll.py) [:heavy_check_mark:](py/tests/testElectionPoll/test_ElectionPoll.py)|Python, Data Science, Descriptive Statistic|

|Digits to Employees|[:shipit:](py/solns/digits2Employee/digits2Employee.py) [:heavy_check_mark:](py/tests/testDigits2Employee/test_Digits2Employee.py)|Numerical Reasoning|

### Others

  Click to expand!

  

|Tasks|C++|C#|Python|Js|

|---|---|---|---|---|

|Sample|[:shipit:](cpp/example/src/Sample/sample.cpp) [:heavy_check_mark:](cpp/example/tst/Sample-test.cpp)|[:shipit:](cs/sample/Sample/Sample.cs) [:heavy_check_mark:](cs/sample/Sample.Tests/UnitTest1.cs)|[:shipit:](py/solns/solnSample.py) [:heavy_check_mark:](py/tests/test_Sample.py)|[:shipit:](js/src/sample/sample1.js) [:heavy_check_mark:](js/test/sample/sample1.test.js)|

|Learn CMake|[:shipit:](cpp/learnCMake/)||||

|Pointers|[:shipit:](cpp/example/src/Pointer/pointer.cpp) [:heavy_check_mark:](cpp/example/tst/Pointer/Pointer-test.cpp)||||
ecosyste.ms

Data

Tools

Indexes

Applications

Experiments

Awesome

https://github.com/zcemycl/algotest

Awesome Lists containing this project

README
