Practice common HR, technical, and aptitude questions asked in Indian campus placements.
Prepare for interviews at TCS, Infosys, Wipro, Amazon, and startups with curated questions and model answers. Filter by company and difficulty on our full question bank.
Structure a 60–90 second pitch: education, relevant projects or internships, key skills, and why you fit this role. Avoid personal biography or repeating your entire resume.
Connect your skills to the company products, culture, and campus programs. Mention specific initiatives you researched — avoid generic praise or salary-only motivation.
Give real strengths with brief examples. For weaknesses, pick something genuine with clear improvement steps. Never claim perfection.
Show ambition aligned with technical growth — deepening expertise, mentoring juniors, contributing to architecture — without implying you will leave immediately.
Answer honestly. If flexible, express openness to major Indian tech hubs. If you have a preference, state it respectfully while confirming willingness if required.
A stack follows LIFO (Last In, First Out) — like undo operations. A queue follows FIFO (First In, First Out) — like a printer job queue.
Binary search halves the search space each step, giving O(log n) time. It requires a sorted array and uses O(1) extra space for iterative implementation.
Use hash maps for O(1) average lookups — frequency counting, two-sum patterns, caching, and deduplication. Trade-off: extra space for speed.
BFS explores level by level using a queue — shortest path in unweighted graphs. DFS goes deep first using recursion/stack — cycle detection, topological sort.
Abstract classes can have state and partial implementation; Java interfaces (modern) support default methods. Use interfaces for capability contracts, abstract classes for shared base behavior.
If two objects are equal, they must have the same hash code. Override both together when using objects as HashMap keys or in HashSet.
Lists are mutable, tuples are immutable. Tuples are faster and hashable when used as dict keys. Lists suit dynamic collections.
INNER JOIN returns only matching rows from both tables. LEFT JOIN returns all rows from the left table plus matches from the right; unmatched right columns are NULL.
Normalization reduces redundancy by organizing data into tables with clear dependencies — typically 1NF through 3NF for campus-level questions.
Atomicity: all or nothing. Consistency: valid states only. Isolation: concurrent transactions do not interfere. Durability: committed data survives failures.
React keeps a lightweight copy of the UI tree. On state change, it diffs virtual DOM vs previous, then updates only changed real DOM nodes — improving performance.
Use a hash or base62 ID mapped to URLs in a database, cache hot links in Redis, handle redirects via HTTP 301/302, and plan for high read-to-write ratio.
Use STAR format: Situation, Task, Action, Result. Prioritize tasks, communicate early, deliver MVP, and mention measurable outcome.
Summarize unique skills, projects, and internship outcomes that match the job description. Support with evidence, not adjectives.
DP solves problems by breaking them into overlapping subproblems, storing results to avoid recomputation. Approaches: top-down memoization or bottom-up tabulation.