post-thumbnail

[LeetCode] #142: Linked List Cycle II

Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null.

2022년 5월 17일
·
0개의 댓글
·
post-thumbnail

Dijkstra's Shortest Path Algorithm

Dijkstra's shortest path algorithm finds the shortest path from the source node to the target node.

2022년 5월 15일
·
0개의 댓글
·
post-thumbnail

IOS Basic Concepts

This document explains the basic concepts that are essential in IOS Development.

2022년 5월 15일
·
0개의 댓글
·
post-thumbnail

Interview Question #2: Counting Sort

You are given with an unsorted int list and max_int_limit of the list. Sort the int list in time O(n).

2022년 5월 15일
·
0개의 댓글
·
post-thumbnail

Bellman-Ford Algorithm

Bellman-ford algorithm will find the shortest path to all of the vertices from the source node.

2022년 5월 15일
·
0개의 댓글
·
post-thumbnail

[LeetCode] #743: Network Delay Time

Return the time it takes for all the n nodes to receive the signal. If it is impossible for all the n nodes to receive the signal, return -1.

2022년 5월 14일
·
0개의 댓글
·
post-thumbnail

Interview Question #1: In-Place Shuffle

We will write a function that shuffles the list in-place.

2022년 5월 14일
·
0개의 댓글
·
post-thumbnail

Logarithmic Time Complexity

In Computer Science, logarithms play a huge role in analyzing algorithms that only evaluates half of its input.

2022년 5월 11일
·
0개의 댓글
·
post-thumbnail

[LeetCode] #103: Binary Tree Zigzag Level Order Traversal

Given the root of a binary tree, return the zigzag level order traversal of its nodes' values.

2022년 5월 11일
·
0개의 댓글
·
post-thumbnail

[LeetCode] #102: Binary Tree Level Order Traversal

Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).

2022년 5월 5일
·
0개의 댓글
·
post-thumbnail

[LeetCode] #112: Path Sum

Return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum.

2022년 5월 4일
·
0개의 댓글
·
post-thumbnail

[LeetCode] #108: Convert Sorted Array to Binary Search Tree

Problem: Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.

2022년 5월 4일
·
0개의 댓글
·
post-thumbnail

[LeetCode] #111: Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth.

2022년 5월 2일
·
0개의 댓글
·
post-thumbnail

[LeetCode] #49: Group Anagrams

Given an array of strings strs, group the anagrams together. You can return the answer in any order.

2022년 4월 28일
·
0개의 댓글
·
post-thumbnail

[LeetCode] #695: Max Area of Island

You are given an m x n binary matrix grid. An island is a group of 1's connected 4-directionally. Return the maximum area of an island in grid.

2022년 4월 23일
·
0개의 댓글
·
post-thumbnail

[LeetCode] #200: Number of Islands

Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.

2022년 4월 22일
·
0개의 댓글
·
post-thumbnail

[LeetCode] #617: Merge Two Binary Trees

You are given two binary trees root1 and root2. Return the merged tree.

2022년 4월 21일
·
0개의 댓글
·