Upload Button Icon Add office photos

Filter interviews by

Vishleshan Software Solutions Senior Python Developer Interview Questions and Answers

Updated 30 Mar 2023

Vishleshan Software Solutions Senior Python Developer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Walk-in and was interviewed in Sep 2022. There were 2 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 - One-on-one 

(2 Questions)

  • Q1. How to connect to database?
  • Ans. 

    To connect to a database, use a database driver and provide connection details.

    • Choose a database driver that is compatible with your database management system.

    • Provide the necessary connection details such as host, port, username, and password.

    • Use the driver's connect() method to establish a connection to the database.

    • Close the connection when done using the close() method.

  • Answered by AI
  • Q2. What is MVC in django?
  • Ans. 

    MVC stands for Model-View-Controller, a design pattern used in Django to separate the application into three interconnected components.

    • Model represents the data and business logic of the application.

    • View handles the presentation layer and interacts with the user.

    • Controller acts as an intermediary between the Model and View, handling user input and updating the Model and View accordingly.

    • Django's implementation of MVC i...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Friendly HR and interviewer.
Asked face to face questions.

Skills evaluated in this interview

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. Basic questions related to skillset

I appeared for an interview in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Aug 2020. There were 5 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Aws vpc gateway questions, devops drawback
  • Q2. Interfaces in oops
  • Ans. 

    Interfaces define a contract for classes to implement certain methods and properties.

    • Interfaces allow for polymorphism and loose coupling.

    • Classes can implement multiple interfaces.

    • Interfaces cannot be instantiated on their own.

    • Interfaces can have default method implementations.

    • Interfaces can be used to enforce design patterns like the adapter pattern.

  • Answered by AI
  • Q3. Meta programing

Interview Preparation Tips

Interview preparation tips for other job seekers - Not at all good experience. Looks like the structure is baffled now after pandemic hit. First of all HR people, they have so much attitude that you can't even ask them any query regarding your JD or project. Secondly there are many rounds but it all depends upon the interviewer mood only and only. Because you are not hired for a direct project, so if the interviewer is egoistic and high attitude, then it's difficult to get positive feedback even if round well all well. Disappointing experience. Suggestion would be to put right people for talent selection. If people are kept in similar way, every new candidate might have negative experience.

I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. 1)Main challenges faced in gcp implementation.
  • Ans. 

    Main challenges faced in GCP implementation

    • Data migration and integration with existing systems

    • Ensuring security and compliance with regulations

    • Optimizing costs and managing resources effectively

    • Training and upskilling employees to use GCP effectively

    • Choosing the right services and configurations for specific use cases

  • Answered by AI
  • Q2. 2) best practices of big query
  • Ans. 

    Best practices for BigQuery include optimizing queries, managing costs, and securing data.

    • Optimize queries by using partitioning, clustering, and caching

    • Manage costs by using cost controls, monitoring usage, and optimizing storage

    • Secure data by using IAM roles, encryption, and audit logs

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Go through some case studies available on gcp you tube channel, those case studies help your draft your studies

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. In 1st round they asked aptitude questions And 2nd round was an technical hr interview in this they asked oops concepts and basic C programming

I applied via Recruitment Consultant and was interviewed before Jan 2021. There were 4 interview rounds.

Interview Questionnaire 

6 Questions

  • Q1. Design Patterns
  • Q2. Solid Principles
  • Q3. MVC Routing
  • Q4. Asp.Net WebAPI Http protocols
  • Q5. SQL Server Read/Insert/Update/Delete/ queries and Sub queries
  • Q6. HackerRank Test

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice string manipulation, arrays and list manipulation for hackerrank test

I applied via Company Website and was interviewed in Feb 2021. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. Basic oops questions
  • Q2. Software Engineering: software development lifecycle, water flow model etc

Interview Preparation Tips

Interview preparation tips for other job seekers - Interviewers are mostly gentle and friendly.Just be bold and answer what you know.hope this helps.all the best :)

I applied via Recruitment Consulltant and was interviewed before Aug 2021. There were 2 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Java. Spring boot, micro service, hibernate
Round 2 - HR 

(1 Question)

  • Q1. Salary, technical, company details

Interview Preparation Tips

Topics to prepare for Accenture Software Developer interview:
  • Java
  • Spring Boot
  • Micro service
  • Hibernate
  • JSP
Interview preparation tips for other job seekers - Java, spring boot, micro service, hibernate

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

There was 2 coding questions
Based on ds and algorithms

  • Q1. 

    Ninja's Pattern with Powers of 2

    Ninja, who loves playing with numbers, sets out to arrange numbers within 'N' rows. The unique arrangement follows these rules: the first row contains 1 number, the second...

  • Ans. 

    Generate a pattern of numbers in rows following a specific sequence based on powers of 2.

    • Start with 1 number in the first row, 2 numbers in the second row, 4 numbers in the third row, and so on based on powers of 2.

    • Fill the pattern with numbers in increasing sequence from 1 to 9, recycling back to 1 after reaching 9.

    • Output the pattern for a given number 'N' of rows.

    • Example: For N = 4, the pattern would be 1, 23, 4567,

  • Answered by AI
  • Q2. 

    Validate Binary Search Tree (BST)

    You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).

    BST Definition:

    A Binary Search Tr...

  • Ans. 

    Validate if a given binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with data less than the node's data.

    • Check if the right subtree of a node contains only nodes with data greater than the node's data.

    • Recursively check if both the left and right subtrees are also binary search trees.

    • Example: For a node with data 4, left subtree nodes (2, 1, 3) are smaller and righ

  • Answered by AI
Round 2 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

There was 2 coding questions based on ds and algorithms

  • Q1. 

    Zig-Zag Array Rearrangement

    You are provided with an array of distinct elements, and your task is to rearrange the array elements in a zig-zag manner. Specifically, for every odd index i, the element ARR[...

  • Ans. 

    Rearrange array elements in a zig-zag manner where every odd index element is greater than its neighbors.

    • Iterate through the array and swap elements to satisfy the zig-zag condition.

    • Ensure that for every odd index i, ARR[i] > ARR[i-1] and ARR[i] > ARR[i+1].

    • Multiple correct answers may exist for a given array.

  • Answered by AI
  • Q2. 

    Flatten a Linked List

    You are provided with a linked list of 'N' nodes. Each node contains two pointers: NEXT, pointing to the next node in the list, and CHILD, pointing to a linked list. Each child linke...

  • Ans. 

    Flatten a linked list of sorted child linked lists into a single sorted linked list.

    • Traverse the linked list and maintain a priority queue to keep track of the next smallest element.

    • Merge the child linked lists into the priority queue while traversing the main linked list.

    • Pop elements from the priority queue to create the final flattened linked list.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

My interview started at 9:30 and it took around 45 minutes to complete my interview.This was held on Amazon Chime and the interview lasted for 1 hour. Firstly the interviewer asked to introduce about myself, later asked regarding the projects I have mentioned in my resume. Then started displaying the coding question. The first question is number of islands in a matrix.

  • 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.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider edge cases like when the matrix is empty or all cells are water (0s).

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 65 percentAmazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating Systems, Computer Networks, JavaTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be enough confident, don't be nervous. Maintain atleast 2 projects in your resume.
Tip 2 : You should be able to answer each and every thing present in your resume. Don't lie in your resume.
Tip 3 : Prepare Data Structures and Algorithms well. They mostly check our Problem Solving ability to find the solutions for the real world problems

Application resume tips for other job seekers

Tip 1 : Mention your skills in which you are perfect
Tip 2 : Mention atleast two projects

Final outcome of the interviewRejected

Skills evaluated in this interview

Vishleshan Software Solutions Interview FAQs

How many rounds are there in Vishleshan Software Solutions Senior Python Developer interview?
Vishleshan Software Solutions interview process usually has 2 rounds. The most common rounds in the Vishleshan Software Solutions interview process are Resume Shortlist and One-on-one Round.
What are the top questions asked in Vishleshan Software Solutions Senior Python Developer interview?

Some of the top questions asked at the Vishleshan Software Solutions Senior Python Developer interview -

  1. What is MVC in djan...read more
  2. How to connect to databa...read more

Tell us how to improve this page.

Vishleshan Software Solutions Senior Python Developer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Accenture Interview Questions
3.8
 • 8.3k Interviews
Amazon Interview Questions
4.0
 • 5.1k Interviews
Capgemini Interview Questions
3.7
 • 4.8k Interviews
HCLTech Interview Questions
3.5
 • 3.9k Interviews
Teleperformance Interview Questions
3.9
 • 1.8k Interviews
Mphasis Interview Questions
3.4
 • 807 Interviews
Nagarro Interview Questions
4.0
 • 763 Interviews
View all
Software Developer
30 salaries
unlock blur

₹1.8 L/yr - ₹7.8 L/yr

Senior Software Developer
8 salaries
unlock blur

₹5 L/yr - ₹8 L/yr

Team Lead
6 salaries
unlock blur

₹7 L/yr - ₹9.2 L/yr

Webmethods Developer
5 salaries
unlock blur

₹3.6 L/yr - ₹4.2 L/yr

Angular Developer
5 salaries
unlock blur

₹2.4 L/yr - ₹5 L/yr

Explore more salaries
Compare Vishleshan Software Solutions with

Accenture

3.8
Compare

Capgemini

3.7
Compare

HCLTech

3.5
Compare

Teleperformance

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