This will have all the solutions to the Introduction to python course's problems by Coding ninjas. Star the repo if you like it.

Repositório com as atividades e matérias desenvolvidas ao longo da disciplina de Análise e Técnica de Algoritmos da UFCG

👨🏻‍💻 Algumas questões resolvidas do URI - Online Judge (Problems & Contests).

🌟ᴛʜɪꜱ ɪꜱ ᴍʏ ᴘʀᴀᴄᴛɪᴄᴇ ᴄᴏᴅɪɴɢ ꜱᴏʟᴜᴛɪᴏɴ ᴏꜰ ᴜꜱɪɴɢ ᴄ++ 💻 🎯 🚀

This project is a algorithm the Query-By-Humming (QBH) based on melody warping (Dinamic Time Warping) and inspired on https://www.hindawi.com/journals/tswj/2014/614193/

My solutions in leetcode

Daily ⭐ CodeWithAkash ⭐ is an initiative to do daily coding. The daily code started on 24 May 2021 🧑‍💻 . Selected Most Important questions 💯 will be uploaded here with optimized solutions in the coming time. If one practices these questions then he/she will be ready to crack any big company. 💥 💯 Give us a ⭐ if you like the initiative.

My personal repository for problems of Coursera course Algorithmic Toolbox By University Of California San Diego

Cursada 1C2024 Técnica de diseño de algoritmos UBA (ex Algoritmos y Estructuras de Datos III)

Mis Códigos del curso que dicté: Python del Curso de Macroeconomía I en la Maestria en Ingenieria Economica de la UNI.

Resolução de execícios de programação competitiva e aprendizado de algorítimos e estrutura de dados

Code for generating interesting integer sequences from the OEIS using python3, C and C++

In this project we shall discuss on the Travelling Salesman Problem (TSP) and will take a few attempts to solve it, using Dynamic programming, or by using approximation algorithms (GVNS) and work on the corresponding python implementations.

Top Interview 150 questions of LeetCode for Interview Preparation complete set of question to Ace Technical Interview

All competitive codes.

Algorithms implementation.

Learning about Algorithmic Complexity with Graphs, DP, Greedy, etc.

This project implements a DNA sequence alignment algorithm using dynamic programming techniques. The primary goal is to align two DNA sequences effectively, allowing for optimal matches while accounting for potential mismatches and gaps.

Решение задачи о назначениях с ограничением планового периода с использованием метода ветвей и границ

Resolución problema '0/1 Knapsack Problem' mediante recurrencia utilizando programación dinámica mediante memoization