/30-Days-Interview-Questions

Covering every type of questions asked in Interviews

Primary LanguageC++MIT LicenseMIT

30-Days-Interview-Questions

Covering every type of questions asked in Interviews

MOCK INTERVIEW [http://www.pramp.com]

======================================================

Day 1

  • Duplicating Array
  • Kadane Algorithm
  • Repeating / Missing Number
  • Sort 0's,1's,2's
  • Sort 012 (Using Dutch Flag-Algorithm)

======================================================

aho
bfs
bfs-grid
big
binary_search
bits
bitset
blossom
bridges
brute-force
centroid
coloring
combinatorics
constructive
dfs
digits
dijkstra
divide_conquer
dp
dsu
euler_function
euler_tour
events
factorization
fenwick
fft
flow
floyd-warshall
game_theory
geometry
graph
greedy
hash
hull
chess
implementation
inclusion-exclusion
interactive
josephus
KMP
lca
lcs_subsequence
lis
matching
matrix
matrix_exponentiation
mcmf
median
meet_in_middle
MO
number_rectangle
number_theory
oeis
offline
palindromes
PAST_CONTESTS
patter-matching
permutations
persistent_segment_tree
phi
pollard-rho
power
preprocess
prime-testing
priority_queue
probability
recursion
RMQ
rope
scc
segment_tree
sequences
sieve
simulation
sorting
spanning_tree
spfa
sqrt
stl
strings
suffix_array
sweep
ternary_search
TMP
topo
treap
tree
trie_bit
trie_string
TSP
two-pointers
z-function
100000
2SAT\

Index

Competitive Programming

Data science

Information security

Problem Sets