interview-techdev-guide

interview-techdev-guide copied to clipboard

Longest Palindromic Subsequence in O(n) Complexity.

5

namanbansal013

[Algorithms/Tree] Trie in Python

2

Kshitij-Bajpai

Implemented Sieve ofEratosthenes algorithm in Java

1

Implemented Sieve ofEratosthenes algorithm in Java

NripeshKumar

Implemented Sieve ofEratosthenes algorithm in Java

3

want to implement it

NripeshKumar

A forensic lab wants to know whether a deceased person’s DNA matches a set of known relatives. It is known that the closest relatives will have most of the DNA matching, and as the relationship becomes farther, the matching genes will be lesser. For this, the DNA pattern of the deceased is given and the DNA pattern of 10 likely relatives are given. Write a program to identify the family of the deceased.

2

string matching algorithm problem

shrikantpadhy18

Disjoint sets using c

2

i want to work on this

vyom153069

[Math] Implement factorial in C

2

roeey777

Implemented factorial in C.

2

Signed-off-by: Eyal Royee

roeey777

Matrix graph

7

matrix graph

ZahoLinda

BinarySearch.c

1

Binary Search implementation using Recursive and Iterative Method according to the user's choice.

Raman1309