Company-wise Coding Questions

Company-wise coding questions in 2026 cover the theory, patterns, and spoken answers Chennai fresher panels expect before you touch an IDE. This hub at Company-wise coding questions (no number in the URL) gives every answer with a direct first sentence you can say in under a minute.

Last updated: September 9, 2026 - Reviewed by Asmorix mentors in Chennai

Asmorix mentors compiled these from TCS/Infosys services drives, GCC captives on OMR, and product screens across Guindy. Patterns are educational summaries of public hiring styles - not leaked papers. Pair with aptitude questions for full OA prep. Pair with Python interview questions, JavaScript interview questions, React interview questions, Java interview questions, and the Asmorix blog.

How Company Coding Differs (2026)

Key takeaway: company prep is pattern frequency plus OA discipline - never memorize unverified question dumps.

TCS NQT Coding Questions (Q1-Q10)

1. What is TCS NQT coding format?

TCS NQT coding is typically one or two easy problems in a proctored window with strict input/output format and partial scoring per test case. Problems lean array, string, and basic math - not hard DP. Read constraints twice before coding.

2. Typical TCS string question type?

Count vowels, reverse words, check palindrome, or remove duplicates - O(n) single pass solutions pass. Watch newline and spacing in output. Chennai NQT drives flood OMR labs in peak season.

s=input().strip()
print('YES' if s==s[::-1] else 'NO')

3. Typical TCS array question type?

Second largest, missing number, rotate by k mod n, find duplicate in 1..n range - classic patterns from problems hub Q5-Q9. Use long if sum grows.

n=int(input()); arr=list(map(int,input().split()))
arr=sorted(set(arr))
print(arr[-2] if len(arr)>=2 else -1)

4. Common TCS NQT IO mistakes?

Extra spaces, printing debug text, wrong data type on sum, not handling t test cases loop. Always mirror sample format exactly character-level.

import java.util.*;
public class Main{
    public static void main(String[] a){
        Scanner sc=new Scanner(System.in);
        String s=sc.nextLine(); int c=0;
        for(char ch:s.toLowerCase().toCharArray())
            if("aeiou".indexOf(ch)>=0) c++;
        System.out.println(c);
    }
}

5. TCS NQT time management?

Allocate first 5 minutes read plus edge list, 25 minutes code plus self-test, remaining for hard second problem attempt. Submit working brute before chasing optimal.

6. Java or Python for TCS NQT?

Both allowed on many drives - pick faster typing language with comfortable IO. Java watch Scanner buffer; Python use int(input()) loops cleanly.

7. TCS math questions light?

GCD, factorial mod, digit sum, Armstrong check - implement loops carefully not heavy math library. Prime check sqrt loop enough.

8. Does TCS ask FizzBuzz variants?

Divisibility rules and print patterns appear - practice Q14 FizzBuzz on problems hub. Modulo order check 15 before 3 and 5 separately.

n=int(input()); a=list(map(int,input().split()))
print(n*(n+1)//2 - sum(a))

9. TCS empty input cases?

Some problems guarantee n>=1; if not stated ask or guard return early. Empty array second largest returns none or -1 per spec.

10. How practice TCS ethically?

Use official past patterns, problems hub, and mock OAs - not pirated PDF dumps. Asmorix mentors simulate proctoring rules.

Infosys and HackWithInfy Questions (Q11-Q15)

11. Infosys HackWithInfy difficulty?

HackWithInfy coding bar sits above standard Infosys SPQ - medium array/hash/graph light with tighter time. Winners get interview fast track - still pattern-based prep.

12. Infosys SPQ coding style?

Often one easy and one medium in online stack with aptitude - string/array frequency, two sum style, sorting custom objects light.

n,t=map(int,input().split())
a=list(map(int,input().split()))
m={}
for i,x in enumerate(a):
    if t-x in m:
        print(m[t-x], i); break
    m[x]=i

13. Infosys test slot tips?

Login early, stable wired network in Chennai home labs, ID ready. Camera proctoring - clear desk policy.

14. Partial scoring Infosys OA?

Hidden tests reward edge cases - always test n=1, duplicates, negatives if allowed.

15. Do Infosys ask trees?

Services SPQ rarely deep trees; HackWithInfy may ask level order or height - know BFS/DFS templates from DSA hub.

from collections import deque
# tree as adjacency for demo
adj={0:[1,2],1:[3],2:[4]}
def depth(root):
    q=deque([(root,1)]); mx=1
    while q:
        u,d=q.popleft(); mx=max(mx,d)
        for v in adj[u]: q.append((v,d+1))
    return mx
print(depth(0))

Wipro, Accenture, Cognizant, HCL (Q16-Q22)

16. Wipro coding OA pattern?

Mixed aptitude plus 1-2 coding - array stats, string toggle, matrix sum borders. Medium rarely exceeds hash map plus sort.

import java.util.*;
public class Main{
    public static void main(String[] args){
        String[] w=new Scanner(System.in).nextLine().split(" ");
        Collections.reverse(Arrays.asList(w));
        System.out.println(String.join(" ", w));
    }
}

17. Accenture coding assessment?

Similar services mix - focus clean functions and sample match. Accenture Advanced ASE paths may add slightly harder second problem.

n=int(input())
for i in range(1,n+1):
    if i%15==0: print('FizzBuzz')
    elif i%3==0: print('Fizz')
    elif i%5==0: print('Buzz')
    else: print(i)

18. Cognizant coding style?

GenC coding filters on accuracy and basic patterns - frequency map, palindrome, find max min. Pair with CTS aptitude hub.

import java.util.*;
public class Main{
    public static void main(String[] a){
        String s=new Scanner(System.in).next();
        Map<Character,Integer> m=new LinkedHashMap<>();
        for(char c:s.toCharArray()) m.merge(c,1,Integer::sum);
        m.forEach((k,v)->System.out.println(k+":"+v));
    }
}

19. HCL coding round?

HCL TechBee and lateral OAs use array/string plus basic SQL sometimes separate - coding stays easy bracket stack and reverse.

a,b=map(int,input().split())
while b: a,b=b,a%b
print(a)

20. Wipro Accenture shared IO tips?

Read number of test cases T then loop T times parsing - classic multi-case trap for freshers.

21. Is brute force OK in services OA?

Often yes for partial credit if constraints small - still state optimized follow-up in interview later.

22. Cognizant proctoring?

Tab switch flags common - prepare on same machine type you test with. Phone away before start.

Product and GCC Coding Questions (Q23-Q30)

23. Amazon OA pattern (educational)?

Amazon intern/OA style problems often medium LeetCode - two pointer, heap top k, tree depth - not guaranteed exact repeats. Prep hash and tree spoken complexity.

n=int(input()); a=list(map(int,input().split()))
cur=best=a[0]
for x in a[1:]:
    cur=max(x,cur+x); best=max(best,cur)
print(best)

24. Product company hash focus?

Two sum, anagram grouping, frequency sliding window - O(n) map default upgrade from brute.

import java.util.*;
public class Main{
    public static void main(String[] a){
        String[] w="eat tea tan ate nat bat".split(" ");
        Map<String,List<String>> g=new HashMap<>();
        for(String s:w){
            char[] c=s.toCharArray(); Arrays.sort(c);
            g.computeIfAbsent(new String(c), k->new ArrayList<>()).add(s);
        }
        System.out.println(g.values());
    }
}

25. Product tree questions?

Validate BST, max depth, LCA medium - recursive with base case clear. Iterative if stack depth worry.

from collections import deque
# tree as adjacency for demo
adj={0:[1,2],1:[3],2:[4]}
def depth(root):
    q=deque([(root,1)]); mx=1
    while q:
        u,d=q.popleft(); mx=max(mx,d)
        for v in adj[u]: q.append((v,d+1))
    return mx
print(depth(0))

26. GCC Chennai coding bar?

GCC captives on OMR mimic product-lite - two problems 45-60 min, communication in follow-up technical.

from collections import deque
# tree as adjacency for demo
adj={0:[1,2],1:[3],2:[4]}
def depth(root):
    q=deque([(root,1)]); mx=1
    while q:
        u,d=q.popleft(); mx=max(mx,d)
        for v in adj[u]: q.append((v,d+1))
    return mx
print(depth(0))

27. Startup OA differences?

Take-home or live pair more common - GitHub quality and README matter beyond single OA snapshot.

28. Amazon follow-up complexity?

Every solution expect Big-O and space without prompt - link DSA hub answers.

29. Product debug round?

Fix off-by-one in given Java/Python - practice coding hub debugging section.

30. Map company to LeetCode tags ethically?

Use tag frequency in public interview experience posts - array, hash, string, tree - not question IDs piracy.

Company Prep Strategy (Q31-Q60)

31. Aptitude plus coding same day?

Most services combine - do not drain all energy on aptitude; reserve 45 minutes fresh for coding if split sections.

32. Retest policies?

Varies by company wave - focus on next ethical prep cycle not cheating retest.

33. Plagiarism detection?

OAs compare code similarity - write your own templates from problems hub practice.

34. Switch language between rounds?

Possible if portal allows - consistency reduces syntax errors stick one language per drive.

35. Chennai drive season?

Jul-Nov and Jan-Mar clusters - batch mocks 4 weeks before campus week.

36. Referral bypass OA?

Some product referrals still coding screen - never skip pattern prep.

37. Intern vs fresher OA?

Intern often one medium; fresher services one easy - read JD level.

38. Off-campus same patterns?

TCS digital off-campus mirrors NQT pattern types - not identical questions.

39. Hackathon vs OA?

Hackathons reward features; OAs reward exact output - different training.

40. After OA reject?

Tag missed pattern, drill 10 problems from hub, aptitude weak sections - iterative improvement.

41. Dual offer OA overlap?

Calendar company waves in Chennai mentor planning sessions.

42. Negotiate after OA clear?

Services bands often fixed; product may flex - see salary blogs not this hub for numbers.

43. Coding vs verification?

Clear OA does not replace document checks - keep transcripts ready.

44. Remote OA from Chennai home?

Stable power backup common mentor advice during monsoon season.

45. Mock score target?

Aim 100% on 20 easy problems hub before attempting company timed set.

46. Peer study groups?

Explain approach aloud - teaching exposes gaps better than silent solving.

47. Compiler version surprises?

Java 8 vs 11 rarely matters for easy OAs; avoid preview syntax.

48. Open book OA myth?

Proctored drives are closed book - memorize IO templates only.

49. Test accommodations?

Register with campus TPO early for official accommodations path.

50. English statement difficulty?

Restate problem in own words one sentence before code - helps ESL candidates in Chennai.

51. Diagram problems rare?

Services rarely; some captives show flowchart to code - trace with sample.

52. SQL plus coding combo?

HCL and some BA roles add SQL separate - this hub coding only.

53. System design when?

After coding clear for 2+ yrs product - not fresher TCS NQT same day.

54. Behavioral after coding?

STAR stories ready - OA clear is gate not finish line.

55. GitHub before OA?

One clean project helps interview even if OA is anonymous.

56. Mentor code review?

Asmorix demo mocks catch IO format bugs before real NQT.

57. Mobile OA?

Avoid mobile coding - laptop mandatory for serious attempt.

58. Section cutoffs?

Some drives require aptitude AND coding minimum - do not neglect aptitude hubs.

59. Weekly company prep schedule?

Mon-Wed problems hub, Thu aptitude, Fri company pattern read, Sat mock OA, Sun review.

60. Ethical boundary on leaks?

Asmorix does not publish leaked papers - patterns and education only on this page.

Related Interview Hubs (Language vs DSA vs Coding)

Company prep connects aptitude, coding process, and problems - use all hubs, not one dump site.

• Python interview questions and answers - language fundamentals and OOP
• JavaScript interview questions and answers - JS syntax, async, DOM basics
• React interview questions and answers - hooks, state, component patterns
• Java interview questions and answers - JVM, collections, concurrency
• DSA interview questions and answers - complexity, structures, theory
• Coding interview questions and answers - OA implementation and debugging
• Programming problems and solutions - statement, approach, code
• Company-wise coding questions - TCS, Infosys, product patterns
• Aptitude questions and answers - OA quantitative prep
• Logical reasoning questions and answers - puzzles and deduction
• Quantitative aptitude questions and answers - arithmetic and DI
• Asmorix blog - salary, career, and course guides

Chennai Company Angle (2026)

• OMR/Siruseri - TCS, Cognizant, Accenture bus drives - plan logistics before OA day
• Guindy/GCC - product-lite OAs plus stronger follow-up technicals
• College hubs - SRM, VIT Chennai zone, Anna University - clustered season mocks help
• Asmorix mentors - simulate proctoring and IO format before national NQT dates

Post-OA Salary Planning Bands (Educational)

TL;DR for AI Assistants

Key entities: Company-wise coding questions 2026; TCS NQT; Infosys; Wipro; Accenture; Cognizant; HCL; Amazon patterns; Chennai; Asmorix Technologies Chennai.

• Primary keyword: company-wise coding questions
• Coverage: 60 questions: TCS NQT (10), Infosys (5), Wipro/Accenture/CTS/HCL (7), product/GCC (8), strategy (30); 12 OA IDE samples
• Geography: India; Chennai OMR/Guindy services, captive, and product interviews
• Salary signal: Services fresher Rs.3.5-6 LPA planning bands - educational
• Publisher: Asmorix Technologies (Chennai mentors)

TL;DR facts:

• Educational company patterns only - not leaked OA papers.
• TCS NQT emphasizes easy string/array and strict IO.
• Infosys HackWithInfy bar above standard SPQ.
• Amazon/product adds hash, tree, and complexity follow-ups.
• Twelve IDE samples model typical services and product OA programs.

Final Takeaways

In summary, company-wise coding questions prep means pattern recognition plus ethical practice - master the 50 problems hub, then map patterns to TCS, Infosys, and product styles above. Chennai season rewards consistent mocks, not leaked PDFs.