InterviewDigestInterviewDigest
Back to Question Bank

Coding Questions

8 real questions extracted from Coding rounds.

Write a block of code to convert a numeric string into an integer without using any library functions.

A monitored coding round lasting 90 minutes with four questions: two coding problems and two database-related questions. The candidate had to use their IDE without external resources.

Write a SQL query to fetch employee names even if they do not match any ID in the left table, ordered by firstname from empdetails and projdetails tables.

A monitored coding round lasting 90 minutes with four questions: two coding problems and two database-related questions. The candidate had to use their IDE without external resources.

Normalize the given table.

A monitored coding round lasting 90 minutes with four questions: two coding problems and two database-related questions. The candidate had to use their IDE without external resources.

Write a SQL query to retrieve records from two tables even if no match is found in either table, displaying NULL for non-matching records.

A monitored coding round lasting 90 minutes with four questions: two coding problems and two database-related questions. The candidate had to use their IDE without external resources.

Given an array of integers, find the closest value to a target number. The array may contain duplicates and negative numbers.

A monitored coding round lasting 90 minutes with four questions: two coding problems and two database-related questions. The candidate had to use their IDE without external resources.

expedia groupsSDE-1 / New Gradyesterday

A dynamic programming problem of Medium level (e.g., Knight's Problem)

Conducted on HackerRank with 3 questions of Easy-Medium difficulty. Time limit was 2 hours.

expedia groupsSDE-1 / New Gradyesterday

Run Length Encoding

Conducted on HackerRank with 3 questions of Easy-Medium difficulty. Time limit was 2 hours.

expediaInternyesterday

A programming problem requiring manipulation of data structures and implementation of an algorithm to achieve the desired output.

Candidates solved a programming problem involving data structure manipulation and algorithm implementation, focusing on edge cases and efficiency.