2020个人战拖刷题打卡

fortunecraig 发表于 2020-2-14 00:39
楼主加油，我也准备专业刷题

谢谢，一起加油

02/14 补上昨天的
4. Sum ||， Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[letter_i][i] + B[j] + C[k] + D[l] is zero， remember to keep time complexity under o(N^2),

02/15
454. Longest Substring with At Least K Repeating Characters，find the length of the longest substring T of a given string, the chars in T have to be the same, repeat no less than K,
In JS, access letter in a string can be done in str.charAt[index] [i]i[i]nstead of str[index][/i][/i][/i]

02/18 最近略忙，改为每天一题
29. Divide Two Integers (Bit-wise Operation),
- the core thought is to see how many divisors can be taken from the dividend,
- the shift left or right operation is the same as multiply by 2 or divided by 2

饺子没虾仁 发表于 2020-2-16 12:55
02/14 补上昨天的
4. Sum ||， Given four lists A, B, C, D of integer values, compute how many tuples ...

补一下大佬提供的395的解法：

您好！
本帖隐藏的内容需要积分高于 50 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 50 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

33. Search in Rotated Sorted Array,
Suppose an array sorted in ascending order is rotated at some pivot unknown, given a target value to search. If found in the array return its index, otherwise return -1
Easy Peasy, 自己搞定

34. Find First and Last Position of Element in Sorted Array
Easy Peasy 一遍通过

最近有些懈怠，加油不放弃
补上 02/23,
36. Valid Sudoku，Determine if a 9x9 Sudoku board is valid
learn the use of set in JavaScript

03/01
46. Permutations Given a collection of distinct integers, return all possible permutations.
using recursion method to solve the problem

03/09 补上
48. Rotate Image
given an n x n 2D matrix representing an image, rotate the image 90 degree(clockwise),
Geometry(?), for an n x n matrix, this could be accomplished by doing transpose and then reverse

03/11
49. Group Anagrams
Given an array of strings, group anagrams together.
Simple solution using the hash map, check anagrams by split().sort().join() and then traverse the hash map

03/14
50. Pow(x. n)
Solved by recursion, the key is to figure out how to implement the recursion by deciding whether the pow is odd or even

03/20
54. Spiral Matrix
traverse a 2D matrix(m x n) in a spiral way(clockwise) and push the elements in an array
solved by recursion, traverse through the out layer, the key is to figure out a way to traverse a layer with parameters of row and column