Question 1

Valid Parentheses — Turing Interview Question

Accepted Answer

"Valid Parentheses" is a easy difficulty problem asked at Turing interviews. It covers the following topics: String, Stack. You can practice it on LeetCode: https://leetcode.com/problems/valid-parentheses

Question 2

Longest Substring Without Repeating Characters — Turing Interview Question

Accepted Answer

"Longest Substring Without Repeating Characters" is a medium difficulty problem asked at Turing interviews. It covers the following topics: Hash Table, String, Sliding Window. You can practice it on LeetCode: https://leetcode.com/problems/longest-substring-without-repeating-characters

Question 3

Baseball Game — Turing Interview Question

Accepted Answer

"Baseball Game" is a easy difficulty problem asked at Turing interviews. It covers the following topics: Array, Stack, Simulation. You can practice it on LeetCode: https://leetcode.com/problems/baseball-game

Question 4

Minimum Cost For Tickets — Turing Interview Question

Accepted Answer

"Minimum Cost For Tickets" is a medium difficulty problem asked at Turing interviews. It covers the following topics: Array, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/minimum-cost-for-tickets

Question 5

Koko Eating Bananas — Turing Interview Question

Accepted Answer

"Koko Eating Bananas" is a medium difficulty problem asked at Turing interviews. It covers the following topics: Array, Binary Search. You can practice it on LeetCode: https://leetcode.com/problems/koko-eating-bananas

Question 6

Number of Islands — Turing Interview Question

Accepted Answer

"Number of Islands" is a medium difficulty problem asked at Turing interviews. It covers the following topics: Array, Depth-First Search, Breadth-First Search, Union Find, Matrix. You can practice it on LeetCode: https://leetcode.com/problems/number-of-islands

#	Question Title	Difficulty	Frequency	Topics
1	Valid Parentheses	EASY	100.0	StringStack
2	Longest Substring Without Repeating Characters	MEDIUM	91.8	Hash TableStringSliding Window
3	Baseball Game	EASY	81.2	ArrayStackSimulation
4	Minimum Cost For Tickets	MEDIUM	73.8	ArrayDynamic Programming
5	Koko Eating Bananas	MEDIUM	71.5	ArrayBinary Search
6	Number of Islands	MEDIUM	65.7	ArrayDepth-First SearchBreadth-First Search+2
7	Validate IP Address	MEDIUM	65.7	String
8	Longest Common Prefix	EASY	65.7	StringTrie
9	Minimum Length of Anagram Concatenation	MEDIUM	62.0	Hash TableStringCounting
10	Find the Town Judge	EASY	62.0	ArrayHash TableGraph

Explore 450+ Companies

Companies

Turing

Want to see more?

Turing Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Turing

Want to see more?

Turing Interview Questions

Ai Assistant Kas