## Niu Ke interview required real questions SQL chapter 72 full answers - advanced chapter

This article mainly contains the advanced part of the 72 questions in the SQL article, which is a must-tested question in the interview. It mainly includes the more difficult level (18 questions) and the difficult level (4 questions). The questions are more complicated, and my answer may not be the best solution. , Welcome everyone to correct m ...

Posted by glcarlstrom on Mon, 02 May 2022 21:55:06 +0300

## Longest Palindromic Substring

Give you a string s, find the longest palindrome substring in S. Example 1: Input: s = "babad" Output:'bab' Explanation: "aba" is also the answer to the question. Example 2: Input: s = cbbd Output:'bb' Tips: 1 <= s.length <= 1000 s consists of numbers and letters only Author: LeetCode Links: https://leetcode-cn.c ...

Posted by alan007 on Mon, 02 May 2022 00:15:43 +0300

## Leetcode question bank: application of dynamic programming in stone guessing game (Python language)

dynamic programming There are a lot of tutorials and concepts on the Internet. The premise of reading this article is that you have a preliminary understanding of dynamic planning. To sum up, dynamic planning has four steps: Define the status. Find the state transition equation State compression (if possible) Get results Stone guessing ga ...

Posted by xeross on Sun, 01 May 2022 15:41:16 +0300

## Design the smallest stack, that is, there are the basic operations of the stack, push, pop, peek, and the function of returning the minimum value in the stack, getMin

Design the smallest stack, that is, there are the basic operations of the stack, push, pop, peek, and the function of returning the minimum value in the stack, getMin Tip: previously, we said that the system stack can push, pop and peek normally Now we need to design a minimum stack, and the o(1) speed returns the minimum value in the current ...

Posted by dragon_sa on Sun, 01 May 2022 01:52:25 +0300

## Question 4 of 220 weekly matches of Li Kou: check whether the path of edge length limit exists and check the set + offline thinking

It mainly refers to the problem solutions of ， zerotrac and ， liuyubo—— "https://leetcode-cn.com/problems/checking-existence-of-edge-length-limited-paths/solution/jian-cha-bian-chang-du-xian-zhi-de-lu-ji-c756/" "https://leetcode-cn.com/problems/checking-existence-of-edge-length-limited-paths/solution/jie-zhe-ge-wen-ti-ke-pu-yi ...

Posted by asherinho on Sat, 30 Apr 2022 12:23:32 +0300

## leetcode question brushing (c language version)

Linked list Adding two numbers (medium difficulty) Give two non empty linked lists to represent two non negative integers. Among them, their respective digits are stored in reverse order, and each node can only store one digit. If we add the two numbers together, we will return a new linked list to represent their sum. You can assume that ...

Posted by Timsoft on Fri, 29 Apr 2022 13:47:30 +0300

## Find the median of two positively ordered arrays - LeetCode

4. Find the median of two positive arrays Title Link O(m + n) algorithm class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { int n = nums1.length + nums2.length; int mid1 = (n + 1) / 2; int mid2 = (n + 2) / 2; int p1 = 0, p2 = 0, num1 = 0, num2 = 0; for(int i = 1; i < ...

Posted by yjanni on Thu, 28 Apr 2022 04:50:49 +0300

## java data structure and algorithm -- LeetCode4: find the median of two positively ordered arrays

java data structure and algorithm question brushing directory (Sword finger Offer, LeetCode, ACM) --- main directory ------ continuous update (if I can't get in, it means I haven't finished writing): https://blog.csdn.net/grd_java/article/details/123063846 Train of thought analysis Double pointer traversal method, first get the subs ...

Posted by melissal on Wed, 27 Apr 2022 11:41:31 +0300

## LeetCode 1579 ensures that the graph can fully traverse the LeetCode path of HERODING

Alice and Bob share an undirected graph with n nodes and 3 types of edges: Type 1: can only be used by Alice traverse. Type 2: can only be Bob traverse. Type 3: Alice and Bob can be traversed. You are given an array edges , where edges[i] = [typei, ui, vi] means that there is a bidirectional edge of type typei between nodes ui and vi . Pleas ...

Posted by Tokunbo on Wed, 27 Apr 2022 02:30:06 +0300

## [Leetcode]928. Minimize Malware Spread II

Title address: https://leetcode.com/problems/minimize-malware-spread-ii/ Given a n n An undirected graph with n nodes is given by adjacency matrix. Each node represents a node in a network. Give another array A ...

Posted by msarefin on Tue, 26 Apr 2022 09:58:44 +0300