Open In App

Onebanc Interview Experience for C# backend developer

There were a total of three rounds The first was an aptitude test in which they asked 50 questions in 15 minutes and the second round was a Logical interview and 3rd and final round was “Pre Hiring Evaluation”

Round 1:
50 aptitude questions in 15 minutes Second 2(Logical interview)



Round 2:
First question:

Puzzle: There are 4 persons (A, B, C, and D) who want to cross a bridge in night.



A takes 1 minute to cross the bridge.
B takes 2 minutes to cross the bridge.
C takes 5 minutes to cross the bridge.
D takes 10 minutes to cross the bridge.
There is only one torch with them and the bridge cannot be crossed without the torch. There cannot be more than two persons on the bridge at any time, and when two people cross the bridge together, they must move at the slower person. What is the minimum time required to cross the bridge

Second question:
How many people smoke in India

Round 3:

Task1:
Problem Statement: To create a common request and response function for the below-mentioned APIs. 
Requirements: 

  1. Send a request from Postman which will internally call “/categories” and “/entries” API.
  2. Parse and save the JSON body.
  3. Request Parameters will consist of API Name (Mandatory) and Filter Parameter (Optional).
  4. Serialize the request body (JSON Element) as per requirement.
  5.  For the Response body, Filter the response based on the input category.
  6. Send a Response on Postman in JSON Format.
  7. If time permits: 4thand 5th
    parameter “replace key” & “replace value”, example, Replace all values of 
    “HTTP” from “True” to “False” for a given Category (filter)
    Note: Only use System.text.Json / NewtonSoft library. Don’t use any third-party library

Task2:
Problem Statement
Levenshtein distance or Edit distance is an algorithm used to determine the difference between two 
strings.
Your task is to study the algorithm and prepare the edit distance matrix for the following pairs of strings:

  1. Levenshtein & Lavenstaein
  2. TryHackMe & TriHackingMe
  3. Optimization & Progressive
  4.  This is easy & This is easy
  5. After completing the task, you should be able to:
    1. Explain the algorithm.
    2. Create an edit distance matrix for any pair of strings
Article Tags :