Loading...
Please sign in to view your progress
Collection of coding scenario with easy difficult level. The agent used code editor to conduct these interviews.
| # | Name | ||
|---|---|---|---|
1 | FI | In this coding interview, you'll solve a classic algorithmic problem:
given an array of integers and a target value, find the indices of two distinct numbers that sum up to the target value.
| |
2 | MI | In this coding interview, you'll solve a classic algorithmic problem:
determine whether an integer reads the same forwards and backwards - like a mirror reflection!
Write a function that returns true if the number is a palindrome, and false otherwise.
| |
3 | AN | In this coding interview, you'll solve a fascinating algorithmic problem:
decode the mysteries of ancient Roman numerals by creating a function that
translates Roman numeral strings into their corresponding integer values.
| |
4 | ST | In this coding interview, you'll solve an algorithmic problem about finding patterns in strings:
discover the longest shared prefix among a collection of strings. Think of it as finding the
common beginning that all strings in the group share - like finding the shared root of a family tree!
| |
5 | BR | In this coding interview, you'll solve a classic algorithmic problem:
given a string containing only bracket characters, determine whether the brackets
are properly balanced and nested. This tests your understanding of stack data
structures and string processing.
| |
6 | ![]() | In this coding interview, you'll solve a classic algorithmic problem:
merge two sorted linked lists into a single sorted linked list by weaving
together the nodes from both original lists while maintaining sorted order.
| |
7 | AR | In this coding interview, you'll solve an array manipulation problem:
given a sorted integer array, eliminate duplicate values while maintaining
the original order and return the count of unique elements.
| |
8 | AR | In this coding interview, you'll solve an array manipulation problem:
write a function that cleanses an integer array by removing all instances
of a specific target value in-place, then returns the count of remaining elements.
| |
9 | SU | In this coding interview, you'll solve a classic string searching problem:
given two strings haystack and needle, find the starting index of the first
occurrence of needle within haystack. Think of yourself as a detective
searching for a specific clue within a larger piece of evidence!
| |
10 | BI | In this coding interview, you'll solve a classic binary search problem:
given a sorted array of distinct integers and a target value, find the index
where the target is located or should be inserted to maintain sorted order.
| |
11 | FI | In this coding interview, you'll solve a string manipulation problem:
given a string containing words separated by spaces, determine the character count of the final word in the sequence.
| |
12 | DI | In this coding interview, you'll solve an algorithmic problem involving large integer arithmetic:
given a large integer represented as an array of digits, add one to it and return the resulting array.
| |
13 | BI | In this coding interview, you'll solve a binary arithmetic problem:
implement a function that performs addition on two binary number strings
and returns their sum as a binary string without converting to integers first.
| |
14 | IN | In this coding interview, you'll solve an algorithmic problem:
implement a function that computes the integer square root of a non-negative integer
without using built-in exponent functions or operators.
| |
15 | TH | In this coding interview, you'll solve a classic dynamic programming problem:
calculate the number of unique ways to climb a staircase where you can take
either 1 or 2 steps at a time. This problem tests your understanding of
recursion, memoization, and optimization techniques.
| |
16 | UN | In this coding interview, you'll solve a classic linked list problem:
given the head of a sorted singly linked list, eliminate all duplicate values
so that each unique element appears exactly once while maintaining sorted order.
| |
17 | TR | In this coding interview, you'll solve a classic tree traversal problem:
implement an inorder traversal of a binary tree that returns node values
in the correct sequence (left-root-right order).
| |
18 | ![]() | In this coding interview, you'll solve a binary tree comparison problem:
given the root nodes of two binary trees, determine if they are identical twins
with the same structure and node values.
|