SlaveCode LogoSlaveCode.
AcademyRoadmapProblemsSystem Design
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
SlaveCode LogoSlaveCode.

Standardize your coding journey. From basic academy courses and guided roadmaps to advanced system design, company interview prep, and real-time coding arenas. The all-in-one platform to master algorithms and prove your engineering excellence.

Learn & Practice

  • Academy
  • Problems
  • Roadmap
  • System Design

Compete & Tools

  • Arena
  • Contests
  • Compilers

Legal & Support

  • Report an Issue
  • Privacy Policy
  • Terms of Service
  • Contact Us

© 2026 SlaveCode. All rights reserved.

Meta

Meta Problems

Master the most frequently asked interview questions for this company.

IDTitleDifficultyTopics
88
Easy
ArrayTwo Pointers
50
Medium
MathRecursion
71
Medium
StringStack
56
Medium
ArraySorting
1
Easy
ArrayHash Table
31
Medium
ArrayTwo Pointers
23
Hard
Linked ListDivide and Conquer
15
Medium
ArrayTwo Pointers
34
Medium
ArrayBinary Search
20
Easy
StringStack
65
Hard
String
76
Hard
Hash TableString
14
Easy
ArrayString
2
Medium
Linked ListMath
17
Medium
Hash TableString
78
Medium
ArrayBacktracking
19
Medium
Linked ListTwo Pointers
3
Medium
Hash TableString
42
Hard
ArrayTwo Pointers
8
Medium
String
5
Medium
Two PointersString
26
Easy
ArrayTwo Pointers
4
Hard
ArrayBinary Search
9
Easy
Math
33
Medium
ArrayBinary Search
13
Easy
Hash TableMath
21
Easy
Linked ListRecursion
49
Medium
ArrayHash Table
38
Medium
String
70
Easy
MathDynamic Programming
53
Medium
ArrayDivide and Conquer
11
Medium
ArrayTwo Pointers
73
Medium
ArrayHash Table
75
Medium
ArrayTwo Pointers
67
Easy
MathString
43
Medium
MathString
7
Medium
Math
79
Medium
ArrayString
66
Easy
ArrayMath
22
Medium
StringDynamic Programming
48
Medium
ArrayMath
54
Medium
ArrayMatrix
10
Hard
StringDynamic Programming
57
Medium
Array
28
Easy
Two PointersString
69
Easy
MathBinary Search
74
Medium
ArrayBinary Search
103
Medium
TreeBreadth-First Search
29
Medium
MathBit Manipulation
84
Hard
ArrayStack
102
Medium
TreeBreadth-First Search
80
Medium
ArrayTwo Pointers
62
Medium
MathDynamic Programming
27
Easy
ArrayTwo Pointers
55
Medium
ArrayDynamic Programming
68
Hard
ArrayString
98
Medium
TreeDepth-First Search
16
Medium
ArrayTwo Pointers
91
Medium
StringDynamic Programming
39
Medium
ArrayBacktracking
90
Medium
ArrayBacktracking
18
Medium
ArrayTwo Pointers
85
Hard
ArrayDynamic Programming
36
Medium
ArrayHash Table
46
Medium
ArrayBacktracking
25
Hard
Linked ListRecursion
6
Medium
String
41
Hard
ArrayHash Table
44
Hard
StringDynamic Programming
94
Easy
StackTree
111
Easy
TreeDepth-First Search
40
Medium
ArrayBacktracking
63
Medium
ArrayDynamic Programming
51
Hard
ArrayBacktracking
105
Medium
ArrayHash Table
35
Easy
ArrayBinary Search
45
Medium
ArrayDynamic Programming
61
Medium
Linked ListTwo Pointers
81
Medium
ArrayBinary Search
104
Easy
TreeDepth-First Search
92
Medium
Linked List
72
Medium
StringDynamic Programming
58
Easy
String
37
Hard
ArrayHash Table
101
Easy
TreeDepth-First Search
109
Medium
Linked ListDivide and Conquer
93
Medium
StringBacktracking
32
Hard
StringDynamic Programming
100
Easy
TreeDepth-First Search
12
Medium
Hash TableMath
24
Medium
Linked ListRecursion
77
Medium
Backtracking
108
Easy
ArrayDivide and Conquer
64
Medium
ArrayDynamic Programming
110
Easy
TreeDepth-First Search
47
Medium
ArrayBacktracking
95
Medium
Dynamic ProgrammingBacktracking
30
Hard
Hash TableString
59
Medium
ArrayMatrix
107
Medium
TreeBreadth-First Search