-
Notifications
You must be signed in to change notification settings - Fork 13
/
To_Do_Microsoft
174 lines (124 loc) · 3.35 KB
/
To_Do_Microsoft
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
Arrays :
Max Sum Contiguous Subarray // Done : Kadane
Spiral Order Matrix I
Spiral Order Matrix II
Next Permutation
Anti Diagonals
Math :
Grid Unique Paths
Trailing Zeros in Factorial
Binary Search :
Median of Array // To Do
Square Root of Integer
Search for a Range
Rotated Sorted Array Search // Done
Strings :
Implement StrStr
Integer To Roman
Roman To Integers // Done
Multiply Strings
Atoi
Longest Palindromic Substring
Pretty Json
Reverse the String // Done
Bit Manipulation:
Divide Integers
Two Pointers :
Merge Two Sorted Lists II
3 Sum
Remove Duplicates from Sorted Array
Sort by Color
Array 3 Pointers
Remove Duplicates from Sorted Array II
Minimize the absolute difference
Tree Data Structure :
Inorder Traversal // Done
Recover Binary Search Tree
Least Common Ancestor // Done
Construct Binary Tree From Inorder And Preorder
Flatten Binary Tree to Linked List // Done
Preorder Traversal // Done
Max Depth of Binary Tree // Done
Binary Tree From Inorder And Postorder
Sum Root to Leaf Numbers // Done
Postorder Traversal
Populate Next Right Pointers Tree
Path Sum // Done
Next Pointer Binary Tree
Root to Leaf Paths With Sum
Linked Lists :
Swap List Nodes in pairs // Done
Remove Duplicates from Sorted List II // Done
Merge Two Sorted Lists // Done
Remove Duplicates from Sorted list // Done
Add Two Numbers as Lists
Partition List
Insertion Sort List
List Cycle // Done
Intersection of Linked Lists // Done
Reverse Link List II
Palindrome List
K reverse linked list
Clone a Linked list // Done
Stacks And Queues :
Simplify Directory Path
Nearest Smaller Element // Done
Backtracking :
All Unique Permutations
Permutations // Done
Generate all Parentheses II
Combination Sum II
Sudoku // Done
Gray Code
Subsets II
Subset
Hashing :
Anagrams // Done
Fraction
Copy List
Largest Continuous Sequence Zero Sum // Done
Dynamic Programming :
Max Rectangle in Binary Matrix // Done
Max Product Subarray // Done
Regular Expression Match
Edit Distance // Done
Regular Expression II
Coin Sum Infinite
Longest Arithmetic Progression
Length of Longest Subsequence
Greedy Algorithm :
Majority Element // Done
Distribute Candy
Graph Data Structure :
Word Ladder II
Word Ladder I
Smallest sequence with given Primes
Puzzles :
.....
Todo Misc :
Design Patterns -> Tushar Roy Videos
Data Science
OOPS
Prepare : Tell me about your self, Why change the Job, Why Microsoft
Ask questions : Make a List of questions to ask
// Maximum occurence of a num
1) What all is expected from me being a part of Microsoft AI & R
2) What kind of problems do you solve daily.
// Why microsoft, why do you want to apply :
Microsoft is a dream company. It has been involved in several Software and AI innovations
and I would like to contribute in it in any small/big ways.
// Why change the jobs :
I like to surround myself with bright people and learn and work with senior Leaders.
Unfortunately I dont see that kind of an environment at Jio. It has been a great journey,
I have recieved good projects and support from the management, but if given an opportunity,
I would like to work with microsoft.
Revise :
Build Tree, Tree construction
Left View
Check The sum
Fatten
Linked List
Add LL
Flatten Linked List
BinaryTree2DoubleLinkedList
Clone