GMM for EM-algorithm
unsupervised problem for EM algorithm, especially gaussian mixture model.
Algorithm page.
unsupervised problem for EM algorithm, especially gaussian mixture model.
How to use and implement heap and priority queue using python
Implementaiton and Description of Dijkstra Algorithm
All pair shortest paths algorithm
Single source shortest path Algorithm
주어진 조건에 따라 시뮬레이션 하는 문제, 적절한 자료구조 사용
Union Find을 사용하여 시뮬레이션 해보는 알고리즘
상어 클래스를 만들고, 이를 배열에 넣어 다루는 연습, 시뮬레이션
규칙성을 찾고 이를 바탕으로 DFS 연습
조합에 대한 경우의 수 탐색하는 연습
우선순위에 따른 BFS 연습을 하기 좋은 문제
행 연산과, 열 연산 연습
DFS, backtracking, or pruning practice
DFS, backtracking, or pruning practice
팀 나누기, DFS, combination 연습
simulation practice
DFS, rotate practice
A practice to implmentation of permutation.
DFS practice
바이러스의 전파를 막기 위해 DFS를 사용하여 최소화하는 벽을 세워보자
주어진 조건에 맞추어 테트리스를 활용한 문제를 풀어보자
주어진 조건에 맞게 구현
DFS, DP를 이용하여 문제 풀이 연습
최대공약수, 최소공배수를 구해라
코딩 테스트 연습
주사위와 회전을 구현해보자.
시뮬레이션을 구현할 수 있나 테스트, queue의 사용연습
queue의 사용과 DFS 연습, 삼성 역량 테스트
Given a 2D board and a word, find if the word exist in the grid: backtracking, pruning practice.
sorting and heap usage practice
삼성sw 역량 테스트 문제. 가능한 프로세서를 모두 연결시키되필요한 최소전선수를 찾아라
samsung sw test practice, DFS and BFS practice
practice of DFS
Practice of divide and conquer, heap.
how to find prim factors
practice of disjoint set
practice of DFS and union find
2 step of DFS, union find practice
practice of disjoint set
use DFS or BFS, check if a graph is bipartite or not.
Practice to use DFS
practice of DFS
practice of a mathmatical algorithms
practice of DFS
practice of DFS, this is an application of detecting cycle.
make use of graph, and disjoint set to find division rate
practice to DFS
using disjoint set, easily check if a graph has any cycle.
practice to DFS
practice of binary tree traversal
tips for making use of binary tree
disjoint set, or union find algorithm is utilized.
union find, disjoint set, dfs are used to solve this problem
Let’s learn about disjiont set using python.
segment Tree, merge sort are utilized.
Trie datastructure practice
Practice to utilize divide and conquer technique.
Trie data structure practice
Trie datastructure practice.
we use dfs and dijkstra and a star algorithm to find ways
Trie datastructure practice
Let’s learn about what is Trie and how to implement.
Let’s learn about what is segment tree and how to implement.
algorithm pratice to find maximum subarray problem.
Good Pratice of DFS on 2D grid space.
Depth First Search and Bread First Search
Find top K cloest points with origin.
using divide and conquer, find any beautiful array.
Find the number of operations to make target string given 2 keys.
Check if there are ways to go both Pacific, Atlantic ocean
Find Majority Elment in a given array
permutate an array to become beautiful array using python
detect cycle in a given graph
KEY: using BFS or DFS, detect cycles in a graph
merge emails by finding same account from given input.
find a person who have the least quiet among people who have same, or more money
implement binary search recursive and iterative.
find longest common prefix among given words
find distinct ways to press dial pads
given two binary values, multiply efficiently.
How to check multiplication of given two square matrices.
make source string to target string using Append and Delete operations
Rod Cutting Problem
find ordered statstics from a user’s scores
enumerate all cases, Target Sum
algorithm practice, count inversions in a given array.
using Divide and Conquer, solve 2D cloest pair problem
Let’s learning about an algorithm that finds k-th elemen using median of medians to ensure linear time. And use it to quick sort algorithm.
stack practice - how to use stack and how to think the use.
solve this problem using python and c++
Find the total sum of all root-to-leaf numbers.
Find shortest bridge between two islands
Given many islands, we want to find maximum size of island.
sell stock with transaction fee
Determine if you are able to reach the last index.
Maximum Subarray Problem step by step
Advanced Programming Methologies part2
Advanced Programming Methologies part1
algoritm practice