What is R's PlacePrep?

R's PlacePrep is a free, open-source placement preparation platform for engineering students. It provides company-wise previous year questions with detailed solutions, timed mock exams, university PYQs, and aptitude & coding practice for TCS NQT, Infosys IRT, Accenture, and more.

Is R's PlacePrep free to use?

Yes! R's PlacePrep is 100% free and open-source. All placement papers, mock exams, university PYQs, and solutions are accessible without any payment or subscription.

Which companies are covered on PlacePrep?

PlacePrep covers placement papers from TCS (NQT), Infosys (IRT), Accenture, Wipro, Cognizant (GenC), Capgemini, and more. Papers are organized by year and exam type with detailed solutions.

Does PlacePrep have mock exams?

Yes! PlacePrep offers timed mock exams that simulate real placement test conditions with fullscreen mode, anti-cheat measures, auto-submission, and instant evaluation with detailed performance reports.

Genpact

Coding

Display Mode

Jump to Section

Practice Questions4

Export

Back to Genpact

Genpact coding

1 sections, 4 questions

Practice All (4)Sign in required

Practice Questions

Practice4 questions

Question 1

Balanced Bracket Sequence (Valid Parentheses)

Problem

Given a string containing just the characters (, ), {, }, [, and ], determine if the input string is valid — every opening bracket must be closed by the same type of bracket, in the correct order.

Example:

Input: "{[()]}"
Output: true

Input: "{[(])}"
Output: false

Code

Java

import java.util.*;
public class ValidParentheses {
    public static boolean isValid(String s) {
        Stack<Character> stack = new Stack<>();
        Map<Character, Character> pairs = new HashMap<>();
        pairs.put(')', '(');
        pairs.put('}', '{');
        pairs.put(']', '[');

        for (char c : s.toCharArray()) {
            if (c == '(' || c == '{' || c == '[') {
                stack.push(c);
            } else {
                if (stack.isEmpty() || stack.pop() != pairs.get(c)) {
                    return false;
                }
            }
        }
        return stack.isEmpty();
    }

    public static void main(String[] args) {
        System.out.println(isValid("{[()]}"));
        System.out.println(isValid("{[(])}"));
    }
}

Python

def is_valid(s):
    stack = []
    pairs = {')': '(', '}': '{', ']': '['}

    for c in s:
        if c in "({[":
            stack.append(c)
        else:
            if not stack or stack.pop() != pairs[c]:
                return False
    return not stack

print(is_valid("{[()]}"))
print(is_valid("{[(])}"))

Time: O(N)Space: O(N)

Question 2

JavaScript Code Output Prediction (setTimeout in a Loop)

Problem

This was asked in the Genpact online technical test's "Code output" section. Predict the output of the following JavaScript snippet:

for (var i = 1; i <= 3; i++) {
    setTimeout(() => {
        console.log(i);
    }, i * 1000);
}

Answer: Since var is function-scoped (not block-scoped), all three setTimeout callbacks share the same i, which equals 4 by the time the loop finishes and the callbacks run. Output:

4
4
4

Fix using let (block-scoped):

for (let i = 1; i <= 3; i++) {
    setTimeout(() => {
        console.log(i);
    }, i * 1000);
}
// Output: 1  2  3

Question 3

Second Highest Salary (SQL)

Problem

Asked in the Genpact technical interview alongside DBMS questions. Write a SQL query to find the second-highest salary from an Employee table.

Example:

Input table: Employee(id, name, salary)
Output: Second highest salary value

Solution

Alternative using LIMIT/OFFSET:

Code

SQL

SELECT MAX(salary) AS SecondHighestSalary
FROM Employee
WHERE salary < (SELECT MAX(salary) FROM Employee);

Sql

SELECT DISTINCT salary
FROM Employee
ORDER BY salary DESC
LIMIT 1 OFFSET 1;

Question 4

Number Series MCQ Pattern

Problem

Asked in the Genpact Round 1 MCQ section alongside the coding question. Find the next number in the series: 2, 6, 12, 20, 30, ?

Solution

Pattern: n(n+1) for n = 1, 2, 3, 4, 5...
1×2=2, 2×3=6, 3×4=12, 4×5=20, 5×6=30, 6×7=42

import java.util.*; public class ValidParentheses { public static boolean isValid(String s) { Stack<Character> stack = new Stack<>(); Map<Character, Character> pairs = new HashMap<>(); pairs.put(')', '('); pairs.put('}', '{'); pairs.put(']', '['); for (char c : s.toCharArray()) { if (c == '(' || c == '{' || c == '[') { stack.push(c); } else { if (stack.isEmpty() || stack.pop() != pairs.get(c)) { return false; } } } return stack.isEmpty(); } public static void main(String[] args) { System.out.println(isValid("{[()]}")); System.out.println(isValid("{[(])}")); } }

def is_valid(s): stack = [] pairs = {')': '(', '}': '{', ']': '['} for c in s: if c in "({[": stack.append(c) else: if not stack or stack.pop() != pairs[c]: return False return not stack print(is_valid("{[()]}")) print(is_valid("{[(])}"))

Genpact

Display Mode

Jump to Section

Other Content

Export

Genpact coding

Practice Questions

Balanced Bracket Sequence (Valid Parentheses)

Problem

Code

JavaScript Code Output Prediction (setTimeout in a Loop)

Problem

Second Highest Salary (SQL)

Problem

Solution

Code

Number Series MCQ Pattern

Problem

Solution

Genpact

Display Mode

Jump to Section

Other Content

Export

Genpact coding

Practice Questions

Balanced Bracket Sequence (Valid Parentheses)

Problem

Code

JavaScript Code Output Prediction (setTimeout in a Loop)

Problem

Second Highest Salary (SQL)

Problem

Solution

Code

Number Series MCQ Pattern

Problem

Solution