DFS

Welcome to the May 2023 dForce ecosystem update! Another month has passed by, and we at dForce haven’t stopped delivering and expanding our DeFi Suite and decentralized stablecoin USX! Keep reading to learn exactly what has been done and to have a hint of what’s coming up. As usual, there’s…

In this post, we will walk through a solution for Leetcode problem “Number of Islands” in Java — Problem Statement 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. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. …

As summer is just around the corner, many of us can’t wait to make the most of the warm weather both IRL as well as in DeFi! …

Deep dive into Depth First Search graph traversal algorithm. — Depth-First Search (DFS) is a popular graph traversal algorithm that explores as far as possible along each branch before backtracking. It traverses a graph in a depthward motion until it reaches a leaf node or a node with no unvisited neighbors, and then it backtracks to explore other branches. DFS…

1. Problem You are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i] represent the equation Ai / Bi = values[i]. Each Ai or Bi is a string that represents a single variable. You are also given some queries, where…

1. Problem Given a reference of a node in a connected undirected graph. Return a deep copy (clone) of the graph. Each node in the graph contains a value (int) and a list (List[Node]) of its neighbors. class Node { public int val; public List<Node> neighbors; } Test case format: For simplicity…

1. Problem Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. …

Problem Statement: Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X. Return the number of good nodes in the binary tree.

It’s finally time! In line with our commitment to reach the greatest number of DeFi users, whichever their favorite blockchain may be, dForce is thrilled to announce the deployment of its DeFi suite and USX stablecoin to the zkSync Era mainnet! Through dForce, zkSync users are now able to use…