Upload Button Icon Add office photos

Filter interviews by

Offshoot Agency Office Boy Interview Questions and Answers

Updated 3 Feb 2021

Offshoot Agency Office Boy Interview Experiences

1 interview found

Office Boy Interview Questions & Answers

user image Anonymous

posted on 27 Jan 2021

I applied via Naukri.com

Interview Questionnaire 

3 Questions

  • Q1. What is salary?
  • Q2. And which post?
  • Q3. It is rotational or not?

Interview Preparation Tips

Interview preparation tips for other job seekers - My interview advice is that take my interview by telephonic according to HR..

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. - Depends on Team that you have applied (Creative, Tech, Strategy, Media, Communication or Servicing) - Be clear on technical aspect required in Digital Media Ecosystem

Interview Preparation Tips

Round: Resume Shortlist
Experience: - clear indication of day to day task in your previous company
- project that you have worked
- highlight you core competencies
- higlight your past achievements

Round: Case Study Interview
Experience: For Strategy, media, communication and Servicing its mandate to have knowledge of modus operandi in Digital media if not Digital agency.
- Should know how to use planning, strategy and media buying tools

Round: Final
Experience: This round is generally taken by HOD to ensure that the person will fit the culture or not. They will check your problem solving capabilities and How innovative or creative one can be.
This round is generally easiest for me ;)

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
Selected Selected

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

Round duration - 30 minutes
Round difficulty - Medium

This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.

Round 2 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

In this test round, 2 coding questions were given. Either write the code or pseudo code

  • Q1. 

    N Queens Problem

    Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.

    • Use backtracking algorithm to explore all possible configurations.

    • Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

    • Generate all valid configurations and print them out.

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time complexity.

    • Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

    • Swap elements based on the values encountered to sort the array in-place.

    • Time complexity should be O(N) and space complexity should be O(1).

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA.

  • Q1. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading, trailing, and multiple spaces.

    • Split the input string by spaces to get individual words

    • Reverse the order of the words

    • Join the reversed words with a single space in between

  • Answered by AI
  • Q2. 

    Circular Linked List Detection

    You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.

    Note:
    • A linked list is considered circula...
  • Ans. 

    Detect if a given linked list is circular by checking if it forms a closed loop.

    • Traverse the linked list using two pointers, one moving at double the speed of the other.

    • If the two pointers meet at any point, the linked list is circular.

    • If the faster pointer reaches the end of the list (NULL), the linked list is not circular.

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMAQ Software interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Preparation Tips

Round: CGPA SHORTlist
Experience: They selected students who have CGPA greater than 8.5.After the selection was done,we had skype interviews where each student was given a slot.In the interview they ask you about 'tell me about yourself',your projects.You should explain the projects exactly and clearly.They ask you better alternatives for implementing the project.After that on the basis of the project they ask you questions related to that subject.Data structures is very important.After the questions on projects were asked they ask you to write programs on data structures(simple programs). They asked me a program to reverse a singly linked list. After that,if they are impressed with it,they go for databases.One should be thorough with functionalities of each key.If time permits they may ask you puzzles(some of my friends were asked). Quite an easy interview.They give you enough time to think so no worries.People with some interview experience can easily crack this.The main objective of the interviewer is he/she checks whether the student is perfect in the concepts learned.
Tips: Don't be panic.If you don't know anything directly say 'I don't know'. They ask you very easy questions.

General Tips: Don't be panic.Since this is skype interview you can be relaxed.Be cool and focussed .Listen to the interviewer questions carefully.
Skills: Database Management, Algorithms And Data Structures
College Name: VIT Vellore
Motivation: Company works on latest trends like azure,etc and they work on projects related to microsoft.

Interview Preparation Tips

Round: Test
Experience: 1st Round : 30 Aptitude Questions (Difficulty Level-HIGH) with nega
tive marking- My Score 15/30, Highest in the test
+ 2 Coding Questions ( Dyanamic Programming + N-Queens Problem)

Round: Technical Interview
Experience: Technical Interview- Questions based on recurssion DSA, HTML.

General Tips: Just know the project you have done in details , don't bluff
First Interview and got it in single shot.
Skill Tips: Karumanchi for DSA, w3 Schools for web related topics DBMS and SQL from Tutorial point.
Skills:
College Name: NIT Surathkal

I appeared for an interview before Oct 2020.

Round 1 - Face to Face 

(1 Question)

Round duration - 40 minutes
Round difficulty - Medium

Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?

  • Q1. 

    Flip Bits Problem Explanation

    Given an array of integers ARR of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...

  • Ans. 

    Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.

    • Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.

    • Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.

    • Return the maximum count of 1s obtained by flipping a sub-array at most once.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 20 minutes
Round difficulty - Medium

Asked 1 standard algorithm

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.

    • Mark visited cells to avoid redundant traversal.

    • Increment island count whenever a new island is encountered.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Engineer in HyderabadEligibility criteriaAbove 65%MAQ Software interview preparation:Topics to prepare for the interview - Data Structure, Design and analysis of algorithms, DBMS, operating system, computer network, competitive programmingTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : prepare for competitive programming
Tip 2 : know about standard algorithm
Tip 3 : must be good with dbms

Application resume tips for other job seekers

Tip 1 : must have projects, which you can explain to them
Tip 2 : have things on resume, that you are totally certain about.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
More than 8 weeks
Result
Selected Selected

I applied via Referral and was interviewed before May 2023. There was 1 interview round.

I appeared for an interview in Apr 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Timing: Morning
Environment: Online
Description: This round was conducted immediately after Aptitude Round if you cleared it. 4 Questions in 60 minutes.

  • Q1. 

    MergeSort Linked List Problem Statement

    You are given a Singly Linked List of integers. Your task is to sort the list using the 'Merge Sort' algorithm.

    Input:

    The input consists of a single line contain...
  • Ans. 

    Sort a Singly Linked List using Merge Sort algorithm.

    • Implement the Merge Sort algorithm for linked lists.

    • Divide the list into two halves, sort each half recursively, and then merge them.

    • Make sure to handle the base case of an empty or single-node list.

    • Example: Input: 4 3 2 1 -1, Output: 1 2 3 4

  • Answered by AI
  • Q2. 

    Rotate Array Problem Statement

    The task is to rotate a given array with N elements to the left by K steps, where K is a non-negative integer.

    Input:

    The first line contains an integer N representing the...
  • Ans. 

    Rotate a given array to the left by K steps.

    • Create a new array to store the rotated elements.

    • Use modular arithmetic to handle cases where K is greater than the array size.

    • Shift elements to the left by K steps and update the new array.

    • Return the rotated array as output.

  • Answered by AI
  • Q3. 

    Problem: Permutations of a String

    Given a string STR consisting of lowercase English letters, your task is to return all permutations of the given string in lexicographically increasing order.

    Explanatio...

  • Ans. 

    Return all permutations of a given string in lexicographically increasing order.

    • Use backtracking to generate all permutations of the string.

    • Sort the permutations in lexicographical order before printing.

    • Ensure the string contains unique characters for correct output.

    • Handle multiple test cases by iterating over each case.

  • Answered by AI
  • Q4. 

    Factorial Calculation Problem

    Given an integer N, determine the factorial value of N. The factorial of a number N is the product of all positive integers from 1 to N.

    Input:

    First line of input: An inte...
  • Ans. 

    Calculate factorial of a given number N.

    • Iterate from 1 to N and multiply each number to get the factorial value.

    • Handle edge cases like N=0 or N=1 separately.

    • Use recursion or iteration to calculate factorial efficiently.

  • Answered by AI
Round 2 - Video Call 

(4 Questions)

Round duration - 40 minutes
Round difficulty - Medium

Timing: Morning
Environment: Online

  • Q1. 

    Print Series Problem Statement

    Given two positive integers N and K, your task is to generate a series of numbers by subtracting K from N until the result is 0 or negative, then adding K back until it reac...

  • Ans. 

    Generate a series of numbers by subtracting K from N until 0 or negative, then adding K back to reach N without using loops.

    • Create a recursive function to generate the series.

    • Subtract K from N until N is 0 or negative, then add K back until N is reached.

    • Return the series as an array of integers.

  • Answered by AI
  • Q2. 

    Unique Element In Sorted Array

    Nobita wants to impress Shizuka by correctly guessing her lucky number. Shizuka provides a sorted list where every number appears twice, except for her lucky number, which a...

  • Ans. 

    Find the unique element in a sorted array where all other elements appear twice.

    • Iterate through the array and XOR all elements to find the unique element.

    • Use a hash set to keep track of elements and find the unique one.

    • Sort the array and check adjacent elements to find the unique one.

  • Answered by AI
  • Q3. 

    Find the Second Largest Element

    Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.

    If a second largest element does not exist, return -1.

    Example:

    Input:
    ARR = [2,...
  • Ans. 

    Find the second largest element in an array of integers.

    • Iterate through the array to find the largest and second largest elements.

    • Handle cases where all elements are identical.

    • Return -1 if a second largest element does not exist.

  • Answered by AI
  • Q4. Write a query to find the Nth highest salary along with the employee name.
  • Ans. 

    Query to find the Nth highest salary with employee name

    • Use a subquery to rank the salaries in descending order

    • Select the distinct salary from the subquery with LIMIT N-1, 1 to get the Nth highest salary

    • Join the main table with the subquery on the salary column to get the employee name

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 25 minutes
Round difficulty - Easy

Timing: It was in the morning then rescheduled to evening
Environment: Online

  • Q1. 

    Remove String from Linked List Problem

    You are provided with a singly linked list where each node contains a single character, along with a string 'STR'. Your task is to remove all occurrences of the stri...

  • Ans. 

    Remove all occurrences of a specified string from a singly linked list by checking from the end of the list.

    • Traverse the linked list from the end to efficiently remove the specified string occurrences.

    • Update the pointers accordingly after removing the string to maintain the integrity of the linked list.

    • Consider edge cases such as when the entire linked list contains the specified string.

    • Use a temporary buffer to keep t

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Bharati Vidyapeeth's College of Engineering. I applied for the job as Software Engineer in HyderabadEligibility criteriaBE/B.Tech / ME/M.Tech, BCA, MCA, B.Sc (2021)MAQ Software interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, OOPS, Operating Systems, DBMS, Computer NetworkTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : For DS and Algo, keep practicing every day on Leetcode, HackerEarth, and make a habit of participating in contests.
Tip 2 : Projects are vital in interviews, have at least 3 projects on Resume, in the field/profile which you're applying for.
Tip 3 : Give Mock Interviews.

Application resume tips for other job seekers

Tip 1 : Resume should be short and keep it under 1 page.
Tip 2 : Include skills that you're 100% confident in.
Tip 3 : Highlight your internships and projects section appropriately

Final outcome of the interviewRejected

Skills evaluated in this interview

Tell us how to improve this page.

Interview Questions from Similar Companies

MAQ Software Interview Questions
1.9
 • 100 Interviews
Webkul Software Interview Questions
3.8
 • 57 Interviews
Softenger Interview Questions
4.1
 • 52 Interviews
DataMetica Interview Questions
3.6
 • 44 Interviews
View all
Offshoot Agency Office Boy Salary
based on 4 salaries
₹0.8 L/yr - ₹4.5 L/yr
17% more than the average Office Boy Salary in India
View more details
Data Entry Operator
67 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

CPA Executive
62 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Care Executive
44 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Lead
39 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Care Associate
33 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Offshoot Agency with

WATConsult

3.3
Compare

BC Web Wise

3.7
Compare

Gozoop

3.0
Compare

Mirum

3.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview