Upload Button Icon Add office photos

Filter interviews by

PicoStone Technologies Artificial Intelligence Intern Interview Questions and Answers

Updated 3 Apr 2024

PicoStone Technologies Artificial Intelligence Intern Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Apr 2023. There were 2 interview rounds.

Round 1 - Assignment 

Image processing task was assigned to be completed.

Round 2 - One-on-one 

(1 Question)

  • Q1. Questions about assignment was asked .

Interview Preparation Tips

Topics to prepare for PicoStone Technologies Artificial Intelligence Intern interview:
  • Machine Learning
Interview preparation tips for other job seekers - Be prepared with the job description mentioned.

Interview questions from similar companies

I appeared for an interview before Apr 2021.

Round 1 - Telephonic Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space.

    • Create a dummy node to start the merged list

    • Compare the values of the two linked lists and add the smaller value to the merged list

    • Move the pointer of the merged list and the pointer of the smaller value list

    • Continue this process until one of the lists is fully traversed

    • Append the remaining elements of the other list to the me

  • 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 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It was more of a in depth round on the framework I'm working on and problem solving.

  • Q1. What is the event loop and what is its significance?
  • Ans. 

    The event loop is a mechanism in programming that allows for asynchronous execution of code.

    • The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.

    • It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.

    • The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...

  • Answered by AI
  • Q2. Can you provide examples of output-based questions in JavaScript that utilize browser APIs?
  • Ans. 

    Output-based questions in JavaScript using browser APIs

    • Example 1: Write a script that uses the Geolocation API to display the user's current location on a map

    • Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked

    • Example 3: Develop a web page that uses the Canvas API to draw a simple animation

  • Answered by AI
  • Q3. How would you design a system to support localization in a mobile app?
  • Ans. 

    Designing a system to support localization in a mobile app

    • Use resource files to store localized strings for different languages

    • Implement a language selection feature for users to choose their preferred language

    • Utilize localization libraries or frameworks to streamline the process

    • Consider cultural differences when localizing content, such as date formats and currency symbols

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 75 Minutes
Round difficulty - Hard

It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.

  • Q1. You need to find the fastest 3 horses out of a group, given that you can only race 5 horses at a time. How would you approach this problem?
  • Ans. 

    To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.

    • Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.

    • Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.

    • Keep track of the results and compare the timings to d

  • Answered by AI
  • Q2. How do you debug the root cause of lag on a screen?
  • Ans. 

    To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.

    • Analyze code to identify any inefficient algorithms or operations causing lag.

    • Check for memory leaks that could be impacting performance.

    • Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.

    • Use profiling tools like Xcode Instruments or Android Profiler to identify p

  • Answered by AI
  • Q3. Can you explain the architecture of the app you have recently worked on?
  • Ans. 

    The app I recently worked on is a social media platform for sharing photos and connecting with friends.

    • The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.

    • The client side is built using React Native for cross-platform compatibility.

    • The server side is implemented using Node.js with a MongoDB database for storing user data and photos.

    • The a...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaNo criteriaCars24 interview preparation:Topics to prepare for the interview - Data Structures Algorithms, Javascript, System DesignTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Get your JS fundamentals right (if applying for a Frontend role, https://javascript.info/ is a good start)
Tip 2 : Apart from preparing data structures, practise on the communication skills as well (prepare your introduction, be a good listener and on spot improvisation plays key roles)

Application resume tips for other job seekers

Tip 1 : highlight projects related to the job profile in your resume and mention what was your contribution in them precisely in 1/2 lines.
Tip 2 : Include URLs to applications/projects that you have build and your achievements/blog (if any)

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

3 Questions

  • Q1. Why should we hire you?
  • Q2. What are your weaknesses?
  • Q3. What are your goals

Interview Preparation Tips

Interview preparation tips for other job seekers - Make list of questions that you would like to ask during the interview
Be prepared
Display confidence during interview

I applied via Naukri.com and was interviewed in May 2021. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Explain the difference b/w quick sort and merge sort ?
  • Ans. 

    Quick sort is a divide and conquer algorithm that sorts the array by selecting a pivot element and partitioning the other elements around it. Merge sort is also a divide and conquer algorithm that divides the array into two halves, sorts them separately and then merges them.

    • Quick sort has an average time complexity of O(n log n) while merge sort has a time complexity of O(n log n) in all cases.

    • Quick sort is an in-place...

  • Answered by AI
  • Q2. System Design for Naukri.com platform
  • Ans. 

    System design for Naukri.com platform

    • Identify user requirements and design the system architecture accordingly

    • Use scalable and reliable technologies for high traffic handling

    • Implement features like job search, job posting, resume upload, etc.

    • Ensure data security and privacy of users

    • Integrate with third-party services like payment gateways, social media platforms, etc.

  • Answered by AI
  • Q3. ADD two numbers (Linked List ) / leetcode question
  • Q4. Highest subset sum subarray ?
  • Ans. 

    Highest sum of contiguous subarray in an array

    • Use Kadane's algorithm to find the maximum sum subarray

    • Initialize max_so_far and max_ending_here to 0

    • Loop through the array and update max_ending_here and max_so_far

    • Return max_so_far as the highest subset sum subarray

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - There were 3 technical rounds . If you have clear concepts of Ds & Algo , it will do .Questions were mainly asked from DP, arrays and strings .Other than that some system design problems were also asked which includes the Design of Naukri.com.

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. ADD two linkedlist (Leetcode Question)
  • Ans. 

    Add two linked lists and return the sum as a linked list.

    • Traverse both linked lists and add the corresponding nodes.

    • Handle carry over while adding nodes.

    • Create a new linked list to store the sum and return it.

  • Answered by AI
  • Q2. Knowledge about different tech stacks
  • Q3. Diff b/w quick sort and merge sort
  • Ans. 

    Quick sort is faster but unstable, while merge sort is slower but stable.

    • Quick sort uses a pivot element to divide the array into two parts and recursively sorts them.

    • Merge sort divides the array into two halves, sorts them separately, and then merges them.

    • Quick sort has an average time complexity of O(n log n), while merge sort has a time complexity of O(n log n) in all cases.

    • Quick sort is not stable, meaning that the...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview was good . All of the interviewers were friendly .It was a nice discussion.

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Jun 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Tell me about yourself

Interview Preparation Tips

Interview preparation tips for other job seekers - Say thanks

I applied via Campus Placement and was interviewed in Jul 2021. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. What is the polymorphism?
  • Ans. 

    Polymorphism is the ability of an object to take on many forms.

    • Polymorphism allows objects to be treated as if they are of multiple types.

    • It enables code to be written that can work with objects of different classes in a uniform way.

    • Polymorphism can be achieved through method overloading or method overriding.

    • Example: A shape class can have multiple subclasses like circle, square, triangle, etc. and all can be treated a...

  • Answered by AI
  • Q2. What is inheritance?
  • Ans. 

    Inheritance is a mechanism in object-oriented programming where a new class is created by inheriting properties of an existing class.

    • Inheritance allows for code reuse and promotes code organization.

    • The existing class is called the parent or superclass, and the new class is called the child or subclass.

    • The child class inherits all the properties and methods of the parent class, and can also add new properties and method...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - online process in the test of the question
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Sorting of an array and aptitude

Round 2 - Technical 

(1 Question)

  • Q1. BFS graph traversal
Round 3 - Technical 

(1 Question)

  • Q1. Binary tree question

I applied via Naukri.com and was interviewed in Jun 2021. There were 2 interview rounds.

Interview Preparation Tips

Interview preparation tips for other job seekers - There was total 3 technical rounds and 1 HR round. Technical rounds was mostly about DSA and basic subjective questions. Average time for each round was 1 hour 15 mins. In each round I write code in C++ and then check it by dry running some examples and edge cases. This whole process took almost 2 weeks and in the end result was positive. Use pen and paper, think calmly, take your time, ask interviewer if you are stuck. Best of Luck and happy codding :)

I applied via Company Website and was interviewed before Dec 2020. There were 3 interview rounds.

Interview Questionnaire 

7 Questions

  • Q1. Reverse a given Linked List. Both O(1) and O(N) space complexity. Where N is the size of Linked List.
  • Ans. 

    Reverse a given Linked List with O(1) and O(N) space complexity.

    • For O(1) space complexity, use three pointers to reverse the links in place.

    • For O(N) space complexity, use a stack to store the nodes and then pop them to create the reversed list.

    • Be careful with edge cases such as empty list or list with only one node.

  • Answered by AI
  • Q2. Explain your project. and give a brief overview for the technologies involved in the process of making the project. (Expect some cross-questioning for the technologies you are going to mention).
  • Q3. In a party of N people, only one person is known to everyone. Such a person may be present in the party, if yes, (s)he doesn't know anyone in the party. Find this celebrity (is present).
  • Ans. 

    Find the celebrity in a party of N people where only one person is known to everyone.

    • The celebrity doesn't know anyone in the party.

    • We can use a stack to keep track of potential celebrities.

    • If a person knows someone, they cannot be a celebrity.

    • If a person doesn't know someone, we can push them onto the stack.

    • After iterating through all people, we check if the stack has only one person and if that person is known to eve

  • Answered by AI
  • Q4. Explain in detail the working behind the algorithms of Merge Sort and Quick Sort.
  • Ans. 

    Merge Sort and Quick Sort are sorting algorithms that use divide and conquer approach.

    • Merge Sort divides the array into two halves, sorts them recursively, and then merges them.

    • Quick Sort selects a pivot element, partitions the array around the pivot, and recursively sorts the sub-arrays.

    • Merge Sort has a worst-case time complexity of O(nlogn), while Quick Sort has an average case time complexity of O(nlogn).

    • Merge Sort ...

  • Answered by AI
  • Q5. Trapping Rain-Water problem: Given N non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
  • Ans. 

    Compute amount of water trapped in an elevation map after raining

    • Iterate through the array and find the maximum height on the left and right of each bar

    • Calculate the amount of water that can be trapped on each bar using the difference between the minimum of the two maximum heights and the height of the bar

    • Add up the amount of water trapped on each bar to get the total amount of water trapped

  • Answered by AI
  • Q6. Zigzag traversal of a given binary tree.
  • Ans. 

    Zigzag traversal of a binary tree is a way of traversing the tree in a zigzag pattern.

    • Use a stack to keep track of nodes to be visited.

    • For each level, alternate between adding nodes to the stack from left to right and right to left.

    • Pop nodes from the stack and add their children to the stack in the appropriate order.

    • Repeat until all nodes have been visited.

  • Answered by AI
  • Q7. Given a dictionary with {Key, Value} as {String, Integer}. Sort the given dictionary in ascending/descending order according to: 1) Key. 2) Value.
  • Ans. 

    Sort a dictionary by key or value in ascending/descending order.

    • Use sorted() function with lambda function to sort by key or value.

    • For ascending order, use reverse=False and for descending order, use reverse=True.

    • Example: sorted_dict = sorted(dictionary.items(), key=lambda x: x[0], reverse=True)

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - - Have a good understanding of Data Structures and Algorithm.
- Whatever your project may be, you should know aspect of it and expect some cross-questions as well.
- Be confident with what solution you are coming up, and try to make it efficient if asked.

Skills evaluated in this interview

PicoStone Technologies Interview FAQs

How many rounds are there in PicoStone Technologies Artificial Intelligence Intern interview?
PicoStone Technologies interview process usually has 2 rounds. The most common rounds in the PicoStone Technologies interview process are Assignment and One-on-one Round.

Tell us how to improve this page.

PicoStone Technologies Artificial Intelligence Intern Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 436 Interviews
CARS24 Interview Questions
3.5
 • 337 Interviews
Udaan Interview Questions
3.9
 • 337 Interviews
Meesho Interview Questions
3.7
 • 335 Interviews
Zepto Interview Questions
3.5
 • 246 Interviews
BlackBuck Interview Questions
3.8
 • 180 Interviews
AmbitionBox Interview Questions
4.9
 • 153 Interviews
Tata 1mg Interview Questions
3.6
 • 153 Interviews
Digit Insurance Interview Questions
3.9
 • 146 Interviews
Paisabazaar.com Interview Questions
3.4
 • 142 Interviews
View all
Compare PicoStone Technologies with

Udaan

3.9
Compare

Swiggy

3.8
Compare

CARS24

3.5
Compare

BlackBuck

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