[brush questions] how can we correctly meet the interview?

This article teaches you to brush questions to prepare for an interview ！

---

Why should I brush the title ？

We often say , Algorithms and data structures are CS（Computer Science） At the heart of , Brushing questions is the only way to quickly master algorithms and data structures .

The biggest advantage of brushing questions is that the hand tearing algorithm requires your naked eye debug The ability of , It requires a lot of boundary judgment , Daily work requires constant consideration of boundaries , Can you still see the naked eye in a high load working state debug Well , The algorithm is used as a threshold , A test of brain power , In some algorithm problems, we need to remember some classical algorithms , Part of it is a bit like memory , Some classic topics or classic algorithms , Remember his routine or thought .

Whether you are Xiaobai who has just come into contact with the code , I have worked in a large factory for many years coder, Brushing questions is a magic weapon to ensure technical proficiency .

Algorithms are extremely important to programmers , Languages and development platforms are constantly changing , But the algorithms and theories that never change , The most straightforward reason for brushing algorithm is to find a good job , It must be necessary to brush questions, which is a good platform . Now the algorithm brushing platform is mixed , A lot . How to choose a correct question brushing platform ？

With what to brush the question ？

Next, I will introduce you to a platform that I think is most closely related to big factories —— Cattle from

If you're new , Then you can first consolidate the relevant basic grammar of the language you are learning , stay Cattle from There are also corresponding plates for this part , as follows ：

If you are confident in the basic grammar of the corresponding language, you can also brush algorithm problems , Here, the difficulty classification of algorithm problems on niuke.com is also great , There are introductory questions , Interview must brush questions , Interview high-frequency questions and so on ！ as follows ：

At the same time, during your interview , Many companies are also Cattle from Test your algorithm ability in the problem-solving environment , So I usually practice on Niuke website , In the future, you will get twice the result with half the effort ！

How to brush questions ？

Some students just like it , It's the ultimate difficulty , I feel that as long as I make the most difficult , The rest is easily solved . This kind of eager thought should not .

Algorithm training is a systematic project , Step by step , Too eager for quick success and instant benefit , Instead, it is easy to feel frustrated because you can't solve problems , Counterproductive .

I remember one of my colleagues did something similar . I just heard that there was niuke.com , Just want to try it , After he went up, he picked a difficult topic , As a result, I thought for a long time and didn't do it , Get yourself particularly depressed .

You will find that this practice is inefficient , Even if the problem is solved , It doesn't mean you can solve other problems .

The reasonable way is to go step by step .

My suggestion is to brush the basic grammar questions first , Lay a good foundation and further brush algorithm problems , In this way, first of all, the basic grammar and common API There is absolutely no problem , It will definitely get twice the result with half the effort when brushing algorithm problems later !

Exercises

subject ：

Answer key ：

import java.util.Scanner;
 
public class Main {
    
    public static void main(String[] args) {
    
        Scanner scanner = new Scanner(System.in);
        double d = scanner.nextDouble();
        System.out.println(Main.typeConversion(d));
    }
    public static int typeConversion(double d){
    
        String s = String.valueOf(d).split("\\.")[0];
        return Integer.parseInt(s);
    }
}

subject ：

Answer key ：

import java.util.Scanner;

public class Main {
    
    public static void main(String[] args) {
    
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        scanner.close();
        //a and b The value of the swap 
        if(a<b) a=a+b-(b=a);
        System.out.printf("%d %d %d %d %d",a+b,a-b,a*b,a/b,a%b);
    }
}

subject ：

Answer key ：

import java.util.Scanner;
public class Main {
    
    public static void main(String[] args) {
    
        Scanner scanner = new Scanner(System.in);
        double d= scanner.nextDouble();
        scanner.close();
        // good heavens , It's too strong , Simple and crude 
        int i = (int)(d+0.5);

        System.out.println(i);
    }
}

---

In order to make it convenient to brush the questions, I put the link of Niuke directly below , You can click the blue font to jump and brush the questions directly ！

Portal ： Brush the entry

Brush the question , Everyone must be serious , Don't slack off ！

Accumulate over a long period , Fang Chengda ！