面试算法

By default, the code will be implementated in GO.

Reference

leetcode golang实现open in new window

代码随想录open in new window

Written interview knowledge - zhopen in new window

What happens when - zhopen in new window

AIopen in new window

Interview internal referenceopen in new window

Reverse interview zhopen in new window

go语言之行--golang核武器goroutine调度原理、channel详解open in new window

The-Art-Of-Programmingopen in new window

树形结构数据存储方案(二): 物化路径open in new window

Top 20 Programming questions asked in an interviewopen in new window

Programming questions are integral part of an interview for the developer's position. No matter which programming language you master, it is expected that you are familiar with fundamental concepts of programming.

Coding interviews mainly comprise of data structure and algorithm related questions along with logical questions. Coding interview questions are related to array, linked list, string, binary tree, and questions from algorithms. Here are 20 most commonly asked interview questions. You can easily find answers to these questions on Google to prepare yourself for the interview.

  • How is a bubble sort algorithm implemented? 冒泡排序算法是如何实现的?
  • How to print the first non-repeated character from a string? 如何打印字符串中的第一个非重复字符?
  • How to find the first non repeated character of a given String? 如何找到给定字符串的第一个非重复字符?
  • How do you find duplicate numbers in an array if it contains multiple duplicates? 如果数组包含多个重复项,如何在数组中找到重复的数字?
  • How do you remove duplicates from an array in place? 如何从原地数组中删除重复项?
  • How are duplicates removed from an array without using any library? 如何在不使用任何库的情况下从数组中删除重复项?
  • How do you find the middle element of a singly linked list in one pass? 如何一次找到单链表的中间元素?
  • How do you check if a given linked list contains a cycle? How will you find initial node of the cycle? 如何检查给定的链表是否包含循环?你将如何找到循环的初始节点?
  • How do you reverse a singly linked list without recursion? 如何在不递归的情况下反转单链表?
  • How is a binary search tree implemented? 二叉搜索树是如何实现的?
  • How do you traverse a given binary tree in preorder without recursion? 如何在不递归的情况下按顺序遍历给定的二叉树?
  • How do you print all nodes of a given binary tree using inorder traversal without recursion? 如何使用无递归的中序遍历打印给定二叉树的所有节点?
  • How is a merge sort algorithm implemented? 归并排序算法是如何实现的?
  • How is a radix sort algorithm implemented? 基数排序算法是如何实现的?
  • How do you swap two numbers without using the third variable? 如何在不使用第三个变量的情况下交换两个数字?
  • How do you design a vending machine? 如何设计自动售货机?
  • Write a program to find prime factors of an integer? 写一个程序找出整数的质因数?
  • What is Depth First Search Algorithm for a binary tree? 什么是二叉树的深度优先搜索算法?
  • Difference between a stable and unstable sorting algorithm? 稳定和不稳定排序算法的区别?
  • What is the difference between Comparison and Non-Comparison Sorting Algorithms? 比较和非比较排序算法有什么区别?

https://www.softwaretestinghelp.com/coding-interview-questions/

https://simpleprogrammer.com/programming-interview-questions