Skip to content
#

algorithm-challenges

Here are 1,373 public repositories matching this topic...

josecarlosweb
josecarlosweb commented Oct 15, 2021

What about create a design pattern directory with the most popular design patterns examples?
We can create some rules like: have to be an explanation about the design pattern, the structure and one real world example.
The directory can be:

(folder) Design Patterns
-- (folder) Abstract Factory
-- -- AbstractFactory.js
-- -- AbstractFactoryTest.js
-- -- REAME.md

I can send some :

My Solutions to Leetcode problems. All solutions support C++ language, some support Java and Python. Multiple solutions will be given by most problems. Enjoy:) 我的Leetcode解答。所有的问题都支持C++语言,一部分问题支持Java语言。近乎所有问题都会提供多个算法解决。大家加油!:)

  • Updated Apr 3, 2022
  • C++

hackerrank solutions github | hackerrank all solutions | hackerrank solutions for java | hackerrank video tutorial | hackerrank cracking the coding interview solutions | hackerrank data structures | hackerrank solutions algorithms | hackerrank challenge | hackerrank coding challenge | hackerrank algorithms solutions github| hackerrank problem solving | hackerrank programs solutions | JAVAAID |all hackerrank solutions | Coding Interview Preparation

  • Updated Oct 21, 2021
  • Java
ahmedmo112
ahmedmo112 commented Mar 17, 2022

Related Issue

  • #623
  • I have add a new file named perfectNumber.cpp in M-MathematicalAlgorithms

Info

I have developed program that check if the number is perfect or not by get all the divisors then get the sum of them
if the sum equal the number then the number is perfect number

Algorithm

step1 - take from user a number
step2 -get all numbers that can be divided
step3 -

geeks-for-geeks-solutions
Abhinandan1414
Abhinandan1414 commented May 7, 2020

The mentioned file needs to be re-written. There is no concept of overflow in Circular Queue as it wraps up. What I mean is:
Test Driver Code:
public static void main(String[] agrs) {
CircularQueue q = new CircularQueue(5);
q.insert(10);
q.insert(20);
q.insert(30);
q.insert(40);
q

help wanted good first issue question hacktoberfest
carolfortunato
carolfortunato commented Oct 10, 2020

Dado um número de CPF, o algoritmo deve validar se o número dado é um número válido.
Detalhes de como o cálculo funciona pode ser encontrado aqui

Descrição da Função
A função deve ser capaz de receber o CPF como Integer ou String.

Se for String, deve retirar pontos para manter somente os números.

Em seguida, deve fazer os cálculos da validação

good first issue level-200

Improve this page

Add a description, image, and links to the algorithm-challenges topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the algorithm-challenges topic, visit your repo's landing page and select "manage topics."

Learn more