Question 1

Two Sum — tcs Interview Question

Accepted Answer

"Two Sum" is a easy difficulty problem asked at tcs interviews. It covers the following topics: Array, Hash Table. You can practice it on LeetCode: https://leetcode.com/problems/two-sum

Question 2

Palindrome Number — tcs Interview Question

Accepted Answer

"Palindrome Number" is a easy difficulty problem asked at tcs interviews. It covers the following topics: Math. You can practice it on LeetCode: https://leetcode.com/problems/palindrome-number

Question 3

Majority Element — tcs Interview Question

Accepted Answer

"Majority Element" is a easy difficulty problem asked at tcs interviews. It covers the following topics: Array, Hash Table, Divide and Conquer, Sorting, Counting. You can practice it on LeetCode: https://leetcode.com/problems/majority-element

Question 4

Best Time to Buy and Sell Stock — tcs Interview Question

Accepted Answer

"Best Time to Buy and Sell Stock" is a easy difficulty problem asked at tcs interviews. It covers the following topics: Array, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/best-time-to-buy-and-sell-stock

Question 5

Maximum Subarray — tcs Interview Question

Accepted Answer

"Maximum Subarray" is a medium difficulty problem asked at tcs interviews. It covers the following topics: Array, Divide and Conquer, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/maximum-subarray

Question 6

Longest Common Prefix — tcs Interview Question

Accepted Answer

"Longest Common Prefix" is a easy difficulty problem asked at tcs interviews. It covers the following topics: String, Trie. You can practice it on LeetCode: https://leetcode.com/problems/longest-common-prefix

#	Question Title	Difficulty	Frequency	Topics
1	Two Sum	EASY	84.5	ArrayHash Table
2	Palindrome Number	EASY	76.6	Math
3	Majority Element	EASY	72.2	ArrayHash TableDivide and Conquer+2
4	Best Time to Buy and Sell Stock	EASY	68.6	ArrayDynamic Programming
5	Maximum Subarray	MEDIUM	66.5	ArrayDivide and ConquerDynamic Programming
6	Longest Common Prefix	EASY	64.1	StringTrie
7	Valid Parentheses	EASY	61.4	StringStack
8	Fibonacci Number	EASY	61.4	MathDynamic ProgrammingRecursion+1
9	Subarray Sum Equals K	MEDIUM	61.4	ArrayHash TablePrefix Sum
10	Move Zeroes	EASY	61.4	ArrayTwo Pointers

Explore 450+ Companies

Companies

tcs

Want to see more?

tcs 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

tcs

Want to see more?

tcs Interview Questions

Ai Assistant Kas