forked from Pragad/Algos
-
Notifications
You must be signed in to change notification settings - Fork 0
/
ToDo_Algos.txt
122 lines (106 loc) · 4.62 KB
/
ToDo_Algos.txt
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
Complete In depth of SMB Encryption Project
Complete In depth of File System Project
Take design questions and solve them. From front end to back end
Write class structure for all questions
Coding:
Google Question
Cracking Coding Interview
Graph Cycle
All Open Tabs
Revise:
Permutation and Subsets
Strings
Producer Consumer and all threading related
DP
BST Delete node
BST Iterator
MyDriveInterview Qs
Smart Pointers
How is heap balance maintained
Yahoo hospital problem
Riverbed all design problems
Architecture of some of the project that you developed
Design Car, Engine, Truck, Bicycle, Wheel
Virtual vs pure virtual
Deadlock
-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
0. Virtual Address and Physical Address Mapping
1. AVL and Red Black Trees
http://blog.robertelder.org/50-interviews-with-facebook-twitter-amazon-others/
1) Meetup Qs
2) Find a sub matrix that sums to a value
4) Build a simple regex matcher
15) Two Bit Problems from Interview Bit
22) Soundhound Problems
- Auto complete of a search
23) MZ Problem
25) Given a char pointer to large buffer of memory, write your own version of my_malloc and my_free without using any system calls.
Make it as robust as possible.
How would you minimize memory fragmentation?
26) Implement Singleton
- Think of different ways and its pros and cons
- Make it thread safe
27) Riverbed time problem
31) Splunk interview question
-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
MEETUP: Tech Interview Whiteboard Session
2016/09/26:
1. Longest Palindrome in a String
2. Number of nodes in a complete BST
2016/09/04:
1) Implement BigInt class
2) Copy a linked list with random pointers
3) Print Vertical Sum of a tree
2016/08/28:
1)
Activity Selection Problem / Find all NON overlapping intervals
{{10,20}, {15,18}, {15,25}, {20,40}, {25, 30}}
ANS: {{10, 20}, {20, 40}},
{{10, 20}, {25, 30}},
{{15, 18}, {20, 40}},
{{15, 18}, {25, 30}},
{{15, 25}, {25, 30}}
HINT: Sort by end time
2)
Add two numbers represented as a linked list
a) Without using Additional Memory
b) Using Recursion
3)
Non blocking Linked List
4)
Multi-threading problem
Thread 1: COST, GOOG, NTAP, FB
Thread 2: 140, 750, 33, 160
T1 should print SYMBOL and give control to T2
T2 should print VALUE and give constrol to T1
HINTS: If you consider with Callback, how will you break the cycle
wait(), notify(), notifyAll()
FIND WHAT IS TRAMPOLINE
This can be real time and streaming. As you get each SYMBOL / VALUE print it and give control to the other thread
5)
Matix of 1s and 0s. Find area of the largest square matrix with all 1's
a) How to do using multi-threading
2016/08/21:
1) Calculate Moving or Running Average
http://photos2.meetupstatic.com/photos/event/8/9/c/8/highres_453335272.jpeg
2) In a 2D matrix, find longest increasing path
http://photos2.meetupstatic.com/photos/event/9/0/a/7/highres_453337031.jpeg
3) Convert a Binary Tree into a Linked List (in-order form) without additional space
http://photos4.meetupstatic.com/photos/event/9/9/7/0/highres_453339280.jpeg
4) Read 4k block from disk
http://photos3.meetupstatic.com/photos/event/9/b/8/8/highres_453339816.jpeg
5) DeQueue using HashMap
http://photos1.meetupstatic.com/photos/event/a/4/1/6/highres_453342006.jpeg
2016/08/14:
1) Linked List Front Back Split
I/p: 1->2->3->4->5
O/p: 1->5->2->4->3
http://photos2.meetupstatic.com/photos/event/b/e/c/1/highres_453108833.jpeg
2)
http://photos4.meetupstatic.com/photos/event/c/4/c/d/highres_453110381.jpeg
3)
http://photos2.meetupstatic.com/photos/event/d/1/b/7/highres_453113687.jpeg
-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
VIM:
1. FuzzySearch for all files
2. Easier way to fill function names