To the Top

Big Big World

Subscribe blog items in this category or Feedburner

Category: All | Others(55) | Computing(175) | Life(35) | Success(21) | Funny Stuffs(25) | Memory(4) | To Share(63) | Love and Romantics(17) | News(96) | Fortune Quotes(92) | Q & A(26) | Health(7) | Pictures(5) | Stories(6) | Videos(13) | Cryptocurrency-Blockchain(6) | AI(3) |
Total: 649 - Statistics | Archive
« Previous ( Page :  .. 8 9 10 11 12 13 14 15 16 17 18 .. ) Next »

205 - Daily Interview Question: Edit Distance - edit-distance.txt

Hi, here's your problem today. This problem was recently asked by AirBNB:

Given two strings, determine the edit distance between them. The edit distance is defined as the minimum number of edits (insertion, deletion, or substitution) needed to change one string to the other.

For example, "biting" and "sitting" have an edit distance of 2 (substitute b for s, and insert a t).
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 62883 Views, 26855 Search Bots | 80 Words

206 - Find Pythagorean Triplets - find-pythagorean-triplets.txt

Hi, here's your problem today. This problem was recently asked by Uber:

Given a list of numbers, find if there exists a pythagorean triplet in that list. A pythagorean triplet is 3 variables a, b, c where a^2 + b^2 = c^2

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 74810 Views, 26664 Search Bots | 57 Words

207 - Number of Ways to Climb Stairs - number-of-ways-to-climb-stairs.txt

Hi, here's your problem today. This problem was recently asked by LinkedIn:

You are given a positive integer N which represents the number of steps in a staircase. You can either climb 1 or 2 steps at a time. Write a function that returns the number of unique ways to climb the stairs.


...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 73967 Views, 34838 Search Bots | 74 Words

208 - Maximum In A Stack - maximum-in-a-stack.txt

Hi, here's your problem today. This problem was recently asked by Twitter:

Implement a class for a stack that supports all the regular functions (push, pop) and an additional function of max() which returns the maximum element in the stack (return None if the stack is empty). Each method should run in constant time.


...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 74684 Views, 27135 Search Bots | 105 Words

209 - Invert a Binary Tree - invert-a-binary-tree.txt

Hi, here's your problem today. This problem was recently asked by Twitter:

You are given the root of a binary tree. Invert the binary tree in place. That is, all left children should become right children, and all right children should become left children.

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 75600 Views, 33658 Search Bots | 164 Words

210 - Floor and Ceiling of a Binary Search Tree - floor-and-ceiling-of-a-binary-search-tree.txt

Hi, here's your problem today. This problem was recently asked by Apple:

Given an integer k and a binary search tree, find the floor (less than or equal to) of k, and the ceiling (larger than or equal to) of k. If either does not exist, then print them as None.

Here is the definition of a node for the tree.
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 64201 Views, 54474 Search Bots | 119 Words

211 - Non-decreasing Array with Single Modification - non-decreasing-array-with-single-modification.txt

Hi, here's your problem today. This problem was recently asked by Microsoft:

You are given an array of integers in an arbitrary order. Return whether or not it is possible to make the array non-decreasing by modifying at most 1 element to any value.

We define an array is non-decreasing if array[i] <= array[i + 1] holds for every i (1 <= i < n).
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 78408 Views, 44986 Search Bots | 126 Words

212 - Find the non-duplicate number - find-the-non-duplicate-number.txt

Hi, here's your problem today. This problem was recently asked by Facebook:

Given a list of numbers, where every number shows up twice except for one number, find that one number.

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 74397 Views, 29632 Search Bots | 60 Words

213 - Two-Sum - two-sum.txt

Hi, here's your problem today. This problem was recently asked by Facebook:

You are given a list of numbers, and a target number k. Return whether or not there are two numbers in the list that add up to k.

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 77968 Views, 25357 Search Bots | 76 Words

214 - Sorting a list with 3 unique numbers - sorting-a-list-with-3-unique-numbers.txt

Hi, here's your problem today. This problem was recently asked by Google:

Given a list of numbers with only 3 unique numbers (1, 2, 3), sort the list in O(n) time.

Example 1:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 75160 Views, 40086 Search Bots | 51 Words

215 - Reverse a Linked List - reverse-a-linked-list.txt

Hi, here's your problem today. This problem was recently asked by Google:

Given a singly-linked list, reverse the list. This can be done iteratively or recursively. Can you get both solutions?

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 76155 Views, 29117 Search Bots | 149 Words

216 - First and Last Indices of an Element in a Sorted Array - daily-problem-first-and-last-indices-of-an-element-in-a-sorted-array.txt

Hi, here's your problem today. This problem was recently asked by AirBNB:

Given a sorted array, A, with possibly duplicated elements, find the indices of the first and last occurrences of a target element, x. Return -1 if the target is not found.

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 75000 Views, 92351 Search Bots | 87 Words

217 - [Daily Problem] Validate Balanced Parentheses - daily-problem-validate-balanced-parentheses.txt

Hi, here's your problem today. This problem was recently asked by Uber:

Imagine you are building a compiler. Before running any code, the compiler must check that the parentheses in the program are balanced. Every opening bracket must have a corresponding closing bracket. We can approximate this using strings.

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法, 括号匹配, 面试, Python, daily problem, Validate Balanced Parentheses, algorithms, twitter interview question, python, | English | 77390 Views, 40258 Search Bots | 161 Words

218 - [Daily Problem] Longest Palindromic Substring - daily-problem-twitter-palindrome.txt

Hi, here's your problem today. This problem was recently asked by Twitter:

A palindrome is a sequence of characters that reads the same backwards and forwards. Given a string, s, find the longest palindromic substring in s.

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法, 回文数, 面试, Python, daily problem, palindrome, algorithms, twitter interview question, python, | English | 73927 Views, 26341 Search Bots | 69 Words

219 - Longest Substring Without Repeating Characters - daily-problem-longest-substring-without-repating-characters.txt

This problem was recently asked by Microsoft:

Given a string, find the length of the longest substring without repeating characters.

Here is an example solution in Python language. (Any language is OK to use in an interview, though we'd recommend Python as a generalist language utilized by companies like Google, Facebook, Netflix, Dropbox, Pinterest, Uber, etc.,)
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 微软, 面试题, 最长子字符串, Microsoft, interview questions, daily problems, longest substring, | English | 71769 Views, 41005 Search Bots | 81 Words

220 - [Daily Problem] Add two numbers as a linked list - daily-problem-add-two-numbers-as-a-linked-list.txt

This problem was recently asked by Microsoft: You are given two linked-lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每天算法, 算法, 数据结构, 链表, daily problem, linked list, programming, algorithm, | English | 75269 Views, 54092 Search Bots | 214 Words

221 - Girls do not always like flowers - girls-do-not-like-flowers.txt

又送花?六一送花,情人节还送花?!你不会买两瓶九(酒)啊,我不喝醉,你有机会,你有机会吗?!

女孩子要包的,包治百病,包能让女人达到GC的(G点)。
Top | Category: Videos | Comments (0) | Tags: 情人节还送花, 送女人礼物, valentine, | 中文 | 54983 Views, 26158 Search Bots | 54 Characters


Category: All | Others(55) | Computing(175) | Life(35) | Success(21) | Funny Stuffs(25) | Memory(4) | To Share(63) | Love and Romantics(17) | News(96) | Fortune Quotes(92) | Q & A(26) | Health(7) | Pictures(5) | Stories(6) | Videos(13) | Cryptocurrency-Blockchain(6) | AI(3) |
Total: 649 - Statistics | Archive
« Previous ( Page :  .. 8 9 10 11 12 13 14 15 16 17 18 .. ) Next »

Page Edited: May 11 2024 14:46:11 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />