Premium Employer

i

This company page is being actively managed by Pando Team. If you also belong to the team, you can get access from here

Pando Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Pando Software Engineer Intern Interview Questions and Answers

Updated 8 Aug 2024

Pando Software Engineer Intern Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 simple coding question

Round 2 - One-on-one 

(2 Questions)

  • Q1. Introduction and procjects and internships any previous
  • Q2. DSA PREPARE WELL BASIS LEVEL

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare the DSA

Interview questions from similar companies

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

I applied via campus placement at Indian Institute of Information Technology (IIIT), Kota and was interviewed in Dec 2024. There were 2 interview rounds.

Round 1 - Coding Test 

A 90-minute coding test on HackerRank, which includes one medium, one easy, and one hard question.

Round 2 - Technical 

(2 Questions)

  • Q1. What is the index of the first occurrence where a pattern string matches with a text string?
  • Q2. Given a string, how can we find the minimum length substring whose sum is greater than or equal to a specified target?
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Question around priority queue
  • Q2. Decode strings leetcode
Round 2 - Technical 

(1 Question)

  • Q1. System design questions scenario based
Round 3 - Technical 

(1 Question)

  • Q1. Questions on multidimensional tree
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Aptitude Test 

It was good 20 mcqs 3 coding questions

Round 2 - Technical 

(2 Questions)

  • Q1. Dsa and core subjects like cn os
  • Q2. Dsa questions and core subjects
Round 3 - HR 

(1 Question)

  • Q1. Basic family discussion and salary details

Interview Preparation Tips

Interview preparation tips for other job seekers - it was overall a good experience
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 Leetcode Medium questions on hackerrank

Round 2 - One-on-one 

(3 Questions)

  • Q1. Kadane algorithm based question
  • Q2. Leetcode medium
  • Q3. Resume based questions
Round 3 - One-on-one 

(4 Questions)

  • Q1. Probability question math problem
  • Q2. Puzzle to solve
  • Q3. AI based question
  • Q4. 1 question to solve Leetcode medium

Interview Preparation Tips

Interview preparation tips for other job seekers - Be strong with DSA and communication skill
Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Medium to hard questions based on arrays, dp

Round 2 - Technical 

(2 Questions)

  • Q1. Quick sort algorithm
  • Ans. 

    Quick sort is a popular sorting algorithm that uses divide and conquer strategy.

    • Divides array into smaller sub-arrays based on a pivot element

    • Recursively sorts sub-arrays

    • Combines sorted sub-arrays to get final sorted array

    • Time complexity: O(n log n) on average, O(n^2) worst case

    • Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]

  • Answered by AI
  • Q2. Modified rotate a matrix
  • Ans. 

    Rotate a matrix by 90 degrees in place

    • Transpose the matrix

    • Reverse each row of the transposed matrix

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - study well and at the end, they would not hire anyone

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement

Round 1 - Aptitude Test 

Aptitude was including both MCQs and Input

Round 2 - Technical 

(4 Questions)

  • Q1. Technical interview 1 It revolved around core subjects Like OS, Oops, CNS, dbms etc,. And few basic questions on arrays
  • Q2. Difference between python and C
  • Ans. 

    Python is a high-level, interpreted language known for its simplicity and readability, while C is a low-level, compiled language known for its speed and efficiency.

    • Python is dynamically typed, while C is statically typed.

    • Python has automatic memory management, while C requires manual memory management.

    • Python is platform-independent, while C is platform-dependent.

    • Python is commonly used for web development and data anal...

  • Answered by AI
  • Q3. Why C is faster than python
  • Ans. 

    C is faster than Python due to its lower-level nature and direct hardware access.

    • C is a compiled language, while Python is an interpreted language.

    • C code is directly translated into machine code, while Python code is executed line by line.

    • C has direct access to hardware, while Python relies on external libraries for such access.

  • Answered by AI
  • Q4. Write a program to count vowels in your name
  • Ans. 

    A program to count vowels in a given name

    • Create a function that takes a string as input

    • Loop through each character in the string and check if it is a vowel (a, e, i, o, u)

    • Increment a counter for each vowel found

    • Return the total count of vowels

  • Answered by AI
Round 3 - Technical 

(5 Questions)

  • Q1. Technical interview 2 Focuses on DSA
  • Q2. Write quick sort
  • Ans. 

    Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into smaller sub-arrays.

    • Choose a pivot element from the array

    • Partition the array into two sub-arrays based on the pivot element

    • Recursively apply quick sort to the sub-arrays

    • Combine the sorted sub-arrays to get the final sorted array

  • Answered by AI
  • Q3. Implement Linked list
  • Ans. 

    Implement a linked list data structure in a programming language.

    • Create a Node class with data and a reference to the next node

    • Implement methods to add, remove, and search for elements in the linked list

    • Handle edge cases like adding to an empty list or removing the last element

  • Answered by AI
  • Q4. All operations on Linked list
  • Ans. 

    Operations on Linked list include insertion, deletion, traversal, and searching.

    • Insertion: Add a new node at the beginning, end, or middle of the linked list.

    • Deletion: Remove a node from the linked list based on a given key or position.

    • Traversal: Visit each node in the linked list to perform operations or display data.

    • Searching: Find a specific node in the linked list based on a given key or value.

  • Answered by AI
  • Q5. Basic machine learning algorithms
Round 4 - HR 

(2 Questions)

  • Q1. Basic fitment questions
  • Q2. Introduction and flexibility

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and brush up all CS core subjects

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 DSA questions Both are from DP

Round 2 - Technical 

(2 Questions)

  • Q1. 2 Questions , 1 is DSA
  • Q2. Second question is Puzzle

Interview Preparation Tips

Interview preparation tips for other job seekers - Practise DSA more and give more and more interviews.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Approached by Company and was interviewed in Jan 2024. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Mimic Dataframe Merge
  • Ans. 

    Implement a function to mimic the functionality of merging two DataFrames in Python.

    • Create a function that takes two DataFrames as input.

    • Merge the two DataFrames based on a common column or index.

    • Handle different types of joins like inner, outer, left, and right joins.

    • Return the merged DataFrame as output.

  • Answered by AI
  • Q2. Improve above case by case
Round 2 - Coding Test 

1 hour - Find longest palindromic substring

Interview experience
1
Bad
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed in Sep 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

60 Minutes coding test was there

Round 3 - Technical 

(5 Questions)

  • Q1. Worst experience ever, never apply for company in this, highly unstable company
  • Q2. Add two numbers in a linked list, don't apply
  • Ans. 

    Traverse the linked list and add the values of each node without using additional data structures.

    • Traverse the linked list while keeping track of the sum in a variable

    • Update the sum by adding the value of each node as you traverse the list

    • Handle carry over if the sum of two nodes is greater than 9

  • Answered by AI
  • Q3. Sort the array by using all sorting algorithms, don't join
  • Q4. Subset problem find all the subsets
  • Ans. 

    To find all subsets of a given set, use recursion to generate all possible combinations.

    • Use recursion to generate all possible combinations of including or excluding each element in the set.

    • Start with an empty subset and recursively add each element to create new subsets.

    • Each subset can be represented as an array of strings.

  • Answered by AI
  • Q5. LRU Cache problem, explain it and implement it
  • Ans. 

    LRU Cache is a data structure that stores a fixed number of items and removes the least recently used item when the cache is full.

    • LRU Cache uses a combination of a doubly linked list and a hashmap to efficiently store and retrieve items.

    • When an item is accessed, it is moved to the front of the linked list to indicate it is the most recently used item.

    • If the cache is full, the least recently used item at the end of the ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Don't join, Worst Experience every

Skills evaluated in this interview

Pando Interview FAQs

How many rounds are there in Pando Software Engineer Intern interview?
Pando interview process usually has 2 rounds. The most common rounds in the Pando interview process are Coding Test and One-on-one Round.

Tell us how to improve this page.

Pando Software Engineer Intern Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Join Pando #1 Software for Autonomous Supply Chains

Interview Questions from Similar Companies

ITC Interview Questions
3.9
 • 545 Interviews
Tata Group Interview Questions
4.2
 • 358 Interviews
Adani Group Interview Questions
3.9
 • 187 Interviews
Vyapar Interview Questions
3.4
 • 53 Interviews
BrowserStack Interview Questions
3.6
 • 48 Interviews
View all
Software Engineer
12 salaries
unlock blur

₹8 L/yr - ₹19 L/yr

Software Developer
9 salaries
unlock blur

₹8.9 L/yr - ₹34.4 L/yr

Market Analyst
7 salaries
unlock blur

₹4.2 L/yr - ₹5.7 L/yr

Product Manager
7 salaries
unlock blur

₹20 L/yr - ₹28.8 L/yr

Analyst
6 salaries
unlock blur

₹4.2 L/yr - ₹11 L/yr

Explore more salaries
Compare Pando with

Reliance Industries

4.0
Compare

Tata Group

4.2
Compare

Aditya Birla Group

4.1
Compare

Hindustan Unilever

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