Shulou(Shulou.com)06/03 Report--

This article introduces the relevant knowledge of "what are the questions of the back-end interview algorithm for fast-hand e-commerce in 2021". In the operation of actual cases, many people will encounter such a dilemma. Next, let the editor lead you to learn how to deal with these situations! I hope you can read it carefully and be able to achieve something!

Overall rhythm

The tempo of each round of Kuaishou interview is relatively fast, and you can move on to the next round soon.

Each round has corresponding algorithm problems, but they all belong to basic problems.

Don't be timid in the face of algorithm problems. After doing 150 exercises in advance, there will generally be no problem.

Side-longest ascending subsequence length

Given an unordered array of integers, find the length of the longest ascending subsequence. Output: 4 explanation: the longest ascending subsequence is [2Jing 3Jing 7101], whose length is 4.

/ / the elements are continuous; if the elements are not continuous, you can use the dp solution public static void main (String [] args) {int [] temp = new int [] {10 for (int x = 0bot x).

Temp [y-1]) {result++;} else {result=0;}} if (result > max) {max = result;}} System.out.println (max);} two sides-reverse linked list

It is required to reverse the linked list, give the head node of the node, and return the inverted linked list. Leetcode topic address ListNode structure is as follows:

Class ListNode {int val; ListNode next; ListNode () {} ListNode (int val) {this.val = val;} ListNode (int val, ListNode next) {this.val = val; this.next = next;}} inversion code is as follows: / / mainly uses intermediate variables to reverse public ListNode reverseList (ListNode head) {ListNode prev = null; ListNode curr = head While (curr! = null) {ListNode next = curr.next; / / changes to the two lines curr.next = prev; / /, which can be regarded as moving forward prev = curr; curr = next;} return prev;} three sides-elements that appear once

Given a non-empty array of integers, each element appears twice except for an element that appears only once. Find out the element that only appeared once. Leetcode topic address

The original method public int singleNumber (int [] nums) {int res = 0; Set set = new HashSet (); for (int x: nums) {if (set.contains (x)) {set.remove (x);} else {set.add (x);}} res = set.stream (). FindFirst (). Get (); return res } bit operation public int singleNumber (int [] nums) {int single = 0; for (int num: nums) {single ^ = num;} return single;} "what are the back-end interview algorithm questions for fast-hand e-commerce in 2021", thank you for your reading. If you want to know more about the industry, you can follow the website, the editor will output more high-quality practical articles for you!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.