ephremdeme / data-structure-and-algorithms Goto Github PK

Python implementation of linked list data structure

Implement common linked list ADT
which supports: insert, delete, search and print elements

Implement Segment Tree for Range Sum Queries in any language.

Implement hashing in any language but javascript. Try to include probing techniques.

Please review my pull request. Link below.

#175
https://github.com/ephremdeme/data-structure-and-algorithms/pull/175
Create ReverseLineWordByWord #175

Implement Dijkstra shortest path algorithm in any language.

Hey @ephremdeme, I have noticed that there is no dynamic programming algorithms in this repo.
Can I work on that?

Implement merge sort with any language

Input : unsorted array

Output: sorted array

Implement pascal triangle in any language inside Algorithms/Pascal folder.

input: rows
output: 1
1 1
1 2 1
1 3 3 1

I would like to take this up

Implement Fibonacci sequence in any language. Recursive is appreciated.

Linear search implementation with any language

Input: array and search key

Output: print index of key or return -1 if not found

implement binary search in C++, Java, python, or in any other language

Id like to implement this is JavaScript. Please assign the issue to me.

Implement Kruskal's algorithm in any language.

Also known as the worst sorting algorithm

@ephremdeme please add the Hacktoberfest label to the repository to make it eligible to participate in Hacktoberfest2020. As, most of our contributors are Hacktoberfest aspirants we don't want their effort to go in vain.

Implement Suffix array for strings in any language.

--Adapted from CodeSignal.com---
Given an array a that contains only numbers in the range from 1 to a.length, find the first duplicate number for which the second occurrence has the minimal index. In other words, if there are more than 1 duplicated numbers, return the number for which the second occurrence has a smaller index than the second occurrence of the other number does. If there are no such elements, return -1.

Example

For a = [2, 1, 3, 5, 3, 2], the output should be firstDuplicate(a) = 3.

There are 2 duplicates: numbers 2 and 3. The second occurrence of 3 has a smaller index than the second occurrence of 2 does, so the answer is 3.

For a = [2, 2], the output should be firstDuplicate(a) = 2;

For a = [2, 4, 3, 5, 1], the output should be firstDuplicate(a) = -1.
Input/Output

[execution time limit] 4 seconds (py3)

[input] array.integer a

Guaranteed constraints:
1 ≤ a.length ≤ 105,
1 ≤ a[i] ≤ a.length.

[output] integer

The element in a that occurs in the array more than once and has the minimal index for its second occurrence. If there are no such elements, return -1.

@Kanhakhatri065 is now a maintainer if you have a question or an issue please ask him.

Thank you.

Check weather the given two strings are anagrams of each other, i.e weather they contain the same letter.

Example :
Input: abc & cab //abc is anagrams with cab, bac, cab..
Output: True

implement stack in python, c#, or in any language

Build a function that checks weather a given number is a palindrome or not without using a strings. Implement it using any language.

For example:
input: 12321
output: true

 input: 12344321
 output: false

If you are working on Fibonacci series implementation please move the fibonacci folder to Mathematics.

Thank you.

Implement Fenwick tree in any language.

Given a 2D matrix, the task is that we find the maximum sum of an hourglass.

implement doubly linked list in JavaScript, python , C++ or in any language.

Implement GCD and LCM of two integers using any langauge

Implement Prim's algorithm in any language.

Implement graph traversal(BFS and DFS) algorithms for implicit graphs in any language.

Build a function that, given a number, reverses it without using strings.

input: 12345

output: 54321

Graph Traversal Algorithms in Java.

Implement Bellman Ford.

Write a program to implement the shell sort algorithm.

Implement disjoint set union in any language

I would like to do this in C++. Also for hacktoberfest. Another question, if I ended up doing this, where should I put the file?

Backtracking Algorithm
Famous N-Queen Problem
Language- C++

When Given a number n as input
It outputs the number of ways of arranging queens in that NxN chessboard such that no two queens can kill each other.

for eg: n=4
there are two possible ways which are outputted like this-
.Q..
...Q
Q...
..Q.

..Q.
Q...
...Q
.Q..

for n=3 there are no possibilities and so on....
Can I work on this problem?

Quick sort implementation with any language

Input : unsorted array

Output: sorted array

Implement in C++.Java,Python.

Create a Factorial of n in any language

Brownie points for Recursive solutions, but all solutions are appreciated.

Please put your solution in ../data-structure-and-algorithms/Mathematics/Factorial folder

cheers

Build a program that checks weather a given number is a prime or not. Don't forget to optimize for performance.
Implement it using any language.

input: 1109
output: True

input: 1110
output: False

Accept input integer and print out a series of Fibonacci numbers less than the input number in any language

Example:
input: 8
output: 1, 1, 2, 3, 5, 8