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

This article introduces the relevant knowledge of "what are the interview questions of Java and Python algorithms and data structures?". 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!

1. Array coding interview questions

An array is the most basic data structure, which stores elements in consecutive memory locations. This is also a major topic for interviewers, and you will hear a lot of questions about arrays in any coded interview, such as reversing arrays, sorting arrays, or searching for elements in arrays.

The main advantage of the array data structure is that it provides a fast O (1) search if you know the index, but it is slow to add and remove elements from the array, because once the array is created, the size of the array cannot be changed.

To create a shorter or longer array, you need to create a new array and copy all elements from the old to the new.

The key to solving array-based problems is to be familiar with array data structures and basic programming structures, such as loops, recursion, and basic operators.

Here are some popular array-based coded interview questions for you to practice:

How do I find a missing number in a given array of integers from 1 to 100? (solution)

How do I find duplicate numbers on a given array of integers? (solution)

How do I find * and the smallest number in an unsorted array of integers? (solution)

How do you find an array of integers of all pairs whose sum is equal to a given number? (solution)

If the array contains multiple duplicates, how do I find the duplicate numbers in the array? (solution)

How do I remove duplicates from a given array in Java? (solution)

How to use the quicksort algorithm to sort an array of integers? (solution)

How do I remove duplicates from the array? (solution)

How do you reverse arrays in Java? (solution)

How do I remove duplicates from an array without using any libraries? (solution)

These problems can not only help you improve your problem-solving skills, but also improve your understanding of array data structures.

If you need more advanced questions based on the array, then you can also see the coding interview training camp: algorithms + data structures, algorithm training camp-style courses dedicated to interview preparation to get jobs from tech giants such as Google, Microsoft, Apple, Facebook, etc.

Also, if you feel that 10 questions are not enough and you need more practice, you can view a list of 30 array issues.

two。 Link list programming interview questions

A linked list is another common data structure that complements arrays. Like an array, it is a linear data structure and stores elements in a linear manner.

However, unlike arrays, they are not stored in contiguous locations; instead, they are scattered in memory and connected to each other using nodes.

A linked list is a list of nodes, where each node contains the stored value and the address of the next node.

Because of this structure, adding and removing elements from a linked list is easy because you only need to change links instead of creating arrays, but searching is difficult and it usually takes O (n) time to find elements. Single linked list.

This article provides details on the differences between array and linked list data structures.

It also has a variety of similar linked lists that allow you to move in one direction (forward or backward); two-way linked lists that allow you to move in both directions (forward and backward); and * circular linked lists to form a circle.

In order to solve the problem based on linked list, good recursive knowledge is important, because linked list is a recursive data structure.

If you get a node from the linked list, the remaining data structure is still the linked list, so many linked list problems have simpler recursive solutions than iterative solutions.

Here are some of the most common and linked interview questions and their solutions:

How to find the middle element of a single linked list in one pass? (solution)

How do I check if a given linked list contains loops? How do you find the starting node of the loop? (solution)

How do you reverse the linked list? (solution)

How to reverse a single linked list without recursion? (solution)

How do I delete duplicate nodes in an unsorted linked list? (solution)

How do you find the length of a single linked list? (solution)

How do I find the third node in a single linked list? (solution)

How do I use Stack to find the sum of two linked lists? (solution)

These questions will help you improve your problem-solving skills and improve your understanding of linked list data structures.

If you encounter problems with solving these linked list coding problems, I recommend that you refresh your data structures and algorithm skills through data structures and algorithms: in-depth use of the Java course.

You can also view a list of 30 links for interview questions and learn more exercises.

3. String-coded interview questions

Along with array and linked list data structures, strings are another hot topic in programming job interviews. I have never attended a coding interview, in which there are no string-based questions.

One of the benefits of strings is that if you know arrays, you can easily solve string-based problems because a string is just an array of characters.

Therefore, all the techniques learned by solving array-based coding problems can also be used to solve string programming problems.

The following is a list of common string coding questions in programming job interviews:

How do I print duplicate characters from a string? (solution)

How do you check whether two strings are each other's crossword puzzle? (solution)

How do I print * non-repeating characters from a string? (solution)

How do I use recursion to reverse a given string? (solution)

How do I check if a string contains only numbers? (solution)

How do I find duplicate characters in a string? (solution)

How do you calculate vowels and consonants in a given string? (solution)

How to calculate the number of occurrences of a given character in a string? (solution)

How do you find all the permutations of strings? (solution)

How do I reverse words in a given sentence without using any library methods? (solution)

How do you check whether two strings rotate each other? (solution)

How do you check whether a given string is a palindrome? (solution)

These questions help to improve your understanding of strings as data structures. If you can solve all these string problems without any help, then you are in good shape

For more advanced problems, I suggest you solve the problems given by Steven Skiena in the algorithm design manual, which is the book with the most intractable algorithm problems.

If you need more practice, here is another list of 20 string encoding problems.

4. Binary tree coding interview questions

So far, we have only studied linear data structures, but none of the information in the real world can be expressed in a linear manner, which is where the tree data structure helps.

A tree data structure is a data structure that allows you to store data in a hierarchical manner. Depending on how you store data, there are different types of trees, such as binary trees, where each node has up to two child nodes.

In addition to its next-of-kin binary search tree, it is also one of the tree data structures. As a result, you will find a lot of problems based on them, such as how to traverse them, calculate nodes, find depth, and check that they are balanced.

A key point in solving the binary tree problem is a strong understanding of the theory, such as the size or depth of the binary tree, what the leaves are, what the nodes are, and the understanding of popular traversal algorithms, such as front, back, and ordered traversal.

The following is a list of binary tree-based coding issues that are popular in interviews with software engineers or developers:

How to realize binary search tree? (solution)

How to perform preorder traversal in a given binary tree? (solution)

How to traverse a given binary tree in advance without recursion? (solution)

How to perform ordered traversal in a given binary tree? (solution)

How to use inorder traversal to print all nodes of a given binary tree without recursion? (solution)

How do you implement a post-order traversal algorithm? (solution)

How to traverse a binary tree in a post-ordered traversal without recursion? (solution)

How to print all the leaves of a binary search tree? (solution)

How to calculate multiple leaf nodes in a given binary tree? (solution)

How do I perform a binary search in a given array? (solution)

If you feel that you don't understand binary tree coding enough and you can't solve these problems on your own, I suggest you go back and choose a good data structure and algorithm course, such as data structures and algorithms from 0 to 1:Java.

If you need more advice, please refer to my useful data structure algorithm books and course lists.

5. Miscellaneous coded interview questions

In addition to questions based on data structures, most programming job interviews ask general questions about algorithms, design, bit manipulation, and logic, which I will describe in this section.

It's important to practice these concepts because sometimes it's tricky to solve them in an actual interview.

Practicing them before not only familiarizes you with them, but also gives you more confidence to explain the solution to the interviewer.

How to implement the bubble sorting algorithm? (solution)

How to implement iterative quick sorting algorithm? (solution)

How do you implement the insertion sorting algorithm? (solution)

How to implement the merge sorting algorithm? (solution)

How to implement bucket sorting algorithm? (solution)

How do you implement the counting sorting algorithm? (solution)

How to implement the cardinality sorting algorithm? (solution)

How do I exchange two numbers without using the third variable? (solution)

How do I check whether two rectangles overlap each other? (solution)

How do you design vending machines? (solution)

If you need more of these coding problems, you can get help from books like Cracking The Code Interview, where Gayle Laakmann McDowell provides 189 + programming problems and solutions. A good book, you can write a job interview in a short time.

By the way, the more problems you solve in practice, the better prepared you will be. So, if you think 50 is not enough and you need more, check out these additional 50 programming questions for phone interviews and these books and courses for more comprehensive preparation.

You are now ready for a coded interview

These are some of the most common questions that can help you do well in the interview.

I also share a lot of these questions on my blog, so if you are really interested, you can search for them there at any time.

These common coding, data structure, and algorithm problems are what you need to know when you successfully access any company (large or small) at any level of programming work.

If you are looking for programming or software development work in 2018, you can use this coding issues list to start preparation.

This list provides good topics for preparation and helps you evaluate your preparations to identify areas of your strengths and weaknesses.

Familiarity with data structures and algorithms is important for successful interview writing, and you should focus on most of the time.

This is the end of the content of "what are the interview questions of Java and Python algorithms and data structures". Thank you for 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.