Top 50
Prep plan
Updated weekly · Last refresh Aug 30

22nd Century Technologies Embedded Engineer Interview Questions

The questions to prepare for a 22nd Century Technologies Embedded Engineer interview. Questions from real interview reports rank first. Updated weekly.

50questions
~11htotal time
Track your progressSign up free to work through all 50 questions and resume where you left off.
Start practicing free →
1
StackStart here. 3 questions · ~38 min
Implement Queue Using StacksEasy
Practice

Implement a FIFO queue using two stacks with amortized O(1) queue operations.

StackQueueArrays22nd Century Technologies
Graph Traversal with BFS and DFSEasy
Practice

Traverse a graph from a start node using BFS and DFS, returning the visit order for each traversal.

StackQueueGraphs22nd Century Technologies
More Stack questions with a free account
2
Arrays10 questions · ~127 min
Merge Two Sorted ArraysEasy
Practice

Merge two sorted arrays into one sorted array using a two-pointer linear scan.

ArraysSortingTwo Pointers22nd Century Technologies
More Arrays questions with a free account
3
Hash Tables3 questions · ~38 min
Longest Unique Substring in EnoMedium
Practice

Use a sliding window and hash map to find the longest substring without repeated characters in a string.

Hash TablesStringsTwo Pointers22nd Century Technologies
Two Sum ProblemEasy
Practice

Find two indices in an array whose values add up to a target using a hash map.

Hash TablesArraysTwo Pointers22nd Century Technologies
More Hash Tables questions with a free account
4
Bit Manipulation12 questions · ~152 min
More Bit Manipulation questions with a free account
5
Queue8 questions · ~102 min
More Queue questions with a free account
6
Greedy4 questions · ~51 min
More Greedy questions with a free account
7
More topics10 questions · ~127 min
Rotate Square Matrix In PlaceEasy
Practice

Rotate an n x n matrix 90 degrees clockwise in place using transpose and row reversal.

Array ManipulationMatrix22nd Century Technologies
Maximum Subarray SumEasy
Practice

Compute the largest sum of any contiguous subarray using Kadane's algorithm in O(n) time.

Dynamic ProgrammingArraysGreedy22nd Century Technologies
Rotate Array by KEasy
Practice

Rotate an array right by k positions using the three-reversal technique in O(n) time and O(1) extra space.

Array Manipulation22nd Century Technologies
More questions with a free account

Sign up to see every question

Create a free account to unlock this list and practice real interview questions.

Get my prep plan
The finish line: interview-readyComplete all 50 questions to finish this plan.