AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Winman Software
Compare
Filter interviews by
Winman Software Software Programmer Interview Questions and Answers
Winman Software Software Programmer Interview Experiences
1 interview found
They had their own variety of aptitude on scenario based (3 question)
Bit difficult kind of coding with easy ,medium and hard level. Question will be base don array list. learn the way to get the content from array list.
(2 Questions)
- Q1. They will say a scenario, just say your approach how you will deal with it.
- Q2. Tell me about yourself
- Ans.
I am a software programmer with 5 years of experience in developing web applications using Java, JavaScript, and SQL.
5 years of experience in software development
Proficient in Java, JavaScript, and SQL
Developed web applications for various clients
Strong problem-solving skills
Excellent team player
Interview Preparation Tips
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
15 Questions
- Q1. Find Minimum and Maximum of an array in only one traversal
- Ans.
Find the minimum and maximum values in an array in a single traversal.
Initialize min and max variables with the first element of the array
Iterate through the array and update min and max if a smaller or larger value is found
Return the min and max values
- Q2. Given a chessboard find the maximum number of squares present?
- Ans.
The maximum number of squares on a chessboard is 64.
The chessboard has 64 squares in total.
The number of squares on a chessboard can be calculated using the formula n^2, where n is the number of rows or columns.
In this case, n = 8 (8 rows and 8 columns), so the maximum number of squares is 8^2 = 64.
- Q3. What is C++? Difference between deep and shallow copy?
- Ans.
C++ is a programming language. Deep copy creates a new object and copies all values, while shallow copy creates a reference to the original object.
C++ is a general-purpose programming language
Deep copy creates a new object with its own copy of the data
Shallow copy creates a reference to the original object
Deep copy is safer but can be slower and consume more memory
Shallow copy is faster but can lead to unexpected behav
- Q4. What is pre initialization ?
- Ans.
Pre initialization refers to the process of initializing variables or objects before they are used in a program.
Pre initialization helps avoid errors or unexpected behavior caused by using uninitialized variables.
It is a good practice to pre initialize variables with default values.
Pre initialization can be done using constructors, default values, or initialization blocks.
Example: int count = 0; initializes the variabl
- Q5. Reverse a linked list with and without using Recursion
- Ans.
Reverse a linked list with and without using Recursion
Iterative approach: Use three pointers to reverse the links between nodes
Recursive approach: Recursively reverse the rest of the list and then fix the links
- Q6. Copy constructor?
- Q7. Different types of polymorphism, the diamond problem, and how can it be avoided?
- Ans.
Polymorphism refers to the ability of an object to take on many forms. The diamond problem occurs in multiple inheritance.
Polymorphism can be achieved through method overloading and method overriding.
Method overloading allows multiple methods with the same name but different parameters.
Method overriding occurs when a subclass provides a specific implementation of a method already defined in its superclass.
The diamond p...
- Q8. Questions about Virtual
- Q9. Template classes
- Q10. Write a program for an operator(=) such that it behaves differently for integer and character
- Ans.
The program should differentiate between integers and characters when using the assignment operator (=).
Check the data type of the variable before assigning a value.
Use conditional statements to perform different actions based on the data type.
For integers, assign the value directly. For characters, convert the character to its ASCII value and assign it.
- Q11. Given an array, sort the zeroes from non zeros for example Input: 1 2 0 0 7 4 42 0 0 0 6 Output: 1 2 7 4 42 6 0 0 0 0 0
- Ans.
Sort an array by moving all zeroes to the end.
Iterate through the array and move all non-zero elements to the front.
Count the number of zeroes encountered and append them at the end of the array.
Use two pointers to swap elements and maintain the order.
- Q12. Class hierarchy, List the number of VTables created
- Ans.
The number of VTables created in a class hierarchy depends on the number of virtual functions and the number of derived classes.
VTables are used in object-oriented programming languages to implement dynamic dispatch.
Each class with at least one virtual function has its own VTable.
Derived classes inherit the VTable of their base class and add their own entries for any additional virtual functions.
The total number of VTa...
- Q13. When to use List and Vector of Standard Template Library ?
- Ans.
List is preferred when frequent insertion and deletion is required. Vector is preferred when random access is required.
List is implemented as a doubly-linked list, allowing for efficient insertion and deletion at any position.
Vector is implemented as a dynamic array, allowing for efficient random access.
Use List when the number of elements is expected to change frequently and the order of elements matters less.
Use Vect...
- Q14. Given a string “I LOVE CODING”, print “CODING LOVE I”
- Ans.
The given string needs to be reversed and the words need to be rearranged.
Split the string into an array of words
Reverse the array
Join the array elements with a space in between
- Q15. Questions about weakness and strengths
Interview Preparation Tips
Experience: He asked me how should I weigh Howrah bridge and asked to give any answer I like, normal or wacky. My answer was very normal so I not gonna write that.
And then questions about my weakness and strength, my previous company, reason to change etc.
Skills: c++, Algorithm
College Name: NIT DELHI
Skills evaluated in this interview
Interview Questionnaire
18 Questions
- Q1. Design a parking lot? Design should include -Logic Flow Diagram -E-R diagram (very important) -DB tables with relations between them, preferably normalized -Commands for transaction with tables
- Ans.
Design a parking lot with Logic Flow Diagram, E-R diagram, DB tables with relations, and commands for transactions.
Identify the types of vehicles that will use the parking lot
Determine the number of parking spaces needed for each vehicle type
Create a flow diagram to show the process of entering and exiting the parking lot
Design an E-R diagram to show the relationships between entities such as vehicles, parking spaces, ...
- Q2. Find Min and Max of an array in only one traversal
- Ans.
To find min and max of an array in one traversal, initialize min and max to first element and compare with rest.
Initialize min and max to first element of array
Traverse the array and compare each element with min and max
Update min and max accordingly
Return min and max
- Q3. Given a chessboard find maximum number of squares present
- Ans.
Given a chessboard, find the maximum number of squares present.
Start with the smallest square and count all possible squares
Use the formula n*(n+1)*(2n+1)/6 to find the total number of squares in an n x n chessboard
Add up the squares of all sizes from 1 to n to get the maximum number of squares
For example, an 8 x 8 chessboard has 204 squares
- Q4. What is C++?
- Ans.
C++ is a high-level programming language used for developing system software, application software, device drivers, and video games.
C++ was developed by Bjarne Stroustrup in 1983.
It is an extension of the C programming language.
C++ supports object-oriented programming, generic programming, and low-level memory manipulation.
It is used in developing operating systems, browsers, databases, and more.
Examples of popular sof...
- Q5. Difference between deep and shallow copy?
- Ans.
Deep copy creates a new object with a new memory address, while shallow copy creates a new reference to the same memory address.
Deep copy duplicates the object and all its nested objects, while shallow copy only duplicates the top-level object.
Deep copy is slower and more memory-intensive than shallow copy.
Shallow copy can lead to unexpected behavior if the original object is modified.
In Python, deep copy can be achiev...
- Q6. Inheritance concepts, private/public/protected concepts?
- Q7. Whats “preinitialization” View Answer
- Ans.
Preinitialization is the process of initializing data or objects before they are actually needed.
Preinitialization can improve performance by reducing the time needed to initialize data or objects when they are actually needed.
It can also help to avoid delays or interruptions during runtime.
Examples of preinitialization include preloading data into memory, initializing objects in advance, and caching frequently used da
- Q8. Different versions of polymorphism, how to solve the problem of multiple inheritance
- Ans.
Polymorphism can be achieved through method overloading, method overriding, and interfaces. Multiple inheritance can be solved using interfaces.
Method overloading allows multiple methods with the same name but different parameters
Method overriding allows a subclass to provide its own implementation of a method already defined in its superclass
Interfaces provide a way to achieve multiple inheritance by allowing a class ...
- Q9. Template classes, WAP operator= for template class such that it behaves differently for int and char *
- Q10. Given a tree, WAP such that a matrix is generated so that: Tree: 1 / 2 3 | / 4 5 6 Matrix: 0 1 2 3 4 5 6 1 0 1 1 1 1 1 2 0 0 0 1 0 0 3 0 0 0 0 1 1 4 0 0 0 0 0 0 5 0 0 0 0 0 0 6 0 0 0 0 0 0
- Ans.
WAP to generate a matrix from a given tree.
Create a 2D array to store the matrix
Traverse the tree and fill the matrix accordingly
Use BFS or DFS to traverse the tree
The matrix will be symmetric along the diagonal
- Q11. What is primary key? unique key?
- Ans.
Primary key is a column or set of columns that uniquely identifies each row in a table. Unique key is a constraint that ensures uniqueness of values in a column or set of columns.
Primary key is used to enforce data integrity and ensure that each row in a table can be uniquely identified.
Unique key is used to ensure that no two rows in a table have the same values in a column or set of columns.
Primary key can be a singl...
- Q12. Can unique key be a primary key?
- Ans.
Yes, a unique key can be a primary key.
A primary key is a unique identifier for a record in a table.
A unique key is a constraint that ensures the values in a column are unique.
A unique key can be used as a primary key if it meets the requirements.
A primary key cannot have NULL values, while a unique key can have one NULL value.
- Q13. What is foreign key? can foreign key be Null?
- Ans.
Foreign key is a column in a table that refers to the primary key of another table.
It establishes a relationship between two tables.
It ensures referential integrity.
It can be null, but only if it is defined as nullable.
It helps in joining tables.
Example: Customer table has a foreign key to the Order table's primary key.
Example: Order table's foreign key can be null if the order has not been placed by any customer yet.
- Q14. What is normalization? why should we do normalization?
- Ans.
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalization involves breaking down a database into smaller, more manageable tables.
It helps to eliminate data redundancy and inconsistencies.
Normalization ensures that each table has a primary key and that data is stored in a logical and consistent manner.
It improves data integrity and reduces the likelihood ...
- Q15. Normalized form is better or storing in a single table/ 2 tables is better?
- Ans.
Normalized form is better for data consistency and scalability.
Normalized form reduces data redundancy and ensures data consistency.
Normalized form allows for easier scalability and maintenance.
Single table/2 tables may be appropriate for small, simple datasets.
Normalized form may require more complex queries to retrieve data.
Normalized form may require more storage space due to additional tables.
Example: Normalized fo...
- Q16. Create database of IPL
- Ans.
Create a database for Indian Premier League (IPL)
Identify entities like teams, players, matches, venues, etc.
Create tables for each entity with relevant attributes
Establish relationships between tables using foreign keys
Add constraints like unique, not null, default values, etc.
Populate tables with data from reliable sources
- Q17. Write a query to find name of a player with maximum number of runs in a match on given date and given venue
- Ans.
Query to find player with maximum runs in a match on given date and venue
Use MAX() function to find maximum runs
Join tables for player name, match details and runs scored
Filter by given date and venue
Order by runs scored and limit to 1 result
- Q18. Ques about my weakness and strength, my previous company, reason to change etc
Interview Preparation Tips
Skills: Algorithm, C++
College Name: NA
Skills evaluated in this interview
Interview Questionnaire
6 Questions
- Q1. Questions mainly on C, OOPS concepts of C++, basic Java concepts, Data structures and puzzles (standard ones)
- Q2. Questions about your Project.
- Q3. Questions from the same topics as the previous round
- Q4. Simple puzzle
- Q5. Apart from technical questions a few HR questions were asked. For example: Why do you want to join this company?
- Q6. Have you ever be in a situation where your task is not completed in time and you have to make quick decisions?
Interview Preparation Tips
Experience: Though Questions were all simple, time management was important
Total Questions: 1
Round: Technical Interview
Tips: If you perform well in this round then your chances of selection gets high
Skills: OOP, JAVA, Algorithm
College Name: NA
I applied via Referral
Interview Questionnaire
3 Questions
- Q1. Given two sorted arrays, say A and B, find A B. Here, A B means all those elements present in A but not in B. The expected time complexity was O(m + n), if A is of size m and B is of size n
- Ans.
Find A-B of two sorted arrays A and B in O(m+n) time complexity.
Create two pointers, one for each array, and compare the elements at those pointers.
If the element in A is smaller, add it to the result array and move the A pointer forward.
If the element in B is smaller, move the B pointer forward.
Repeat until one of the pointers reaches the end of its array.
Add any remaining elements in A to the result array.
Time comple...
- Q2. 1. Write a routine to output the elements of the inorder traversal of a binary tree one by one in its each call. eg: Assuming the inorder traversal is 1, 2, 3, 4, 5, the routine should return 1 in its fi...
- Ans.
The routine should output the elements of the inorder traversal of a binary tree one by one in each call.
Implement an inorder traversal algorithm recursively
Use a global variable or pass a reference to keep track of the current element
Call the routine repeatedly to get the next element in each call
- Q3. Given a set of courses along with the prerequisite courses for these courses, write a program to find the minimum number of semesters required to wrap up all the courses
- Ans.
Program to find minimum semesters required to complete courses with prerequisites
Create a graph with courses as nodes and prerequisites as edges
Use topological sorting to find the order of courses to be taken
Calculate the minimum number of semesters based on the order obtained
Handle cases where there are cycles in the graph
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Microsoft Corporation
Anonymous
posted on 2 Dec 2016
I applied via Campus Placement and was interviewed in Dec 2016. There were 6 interview rounds.
Interview Questionnaire
2 Questions
- Q1. Circular queues, binary trees, recursion
- Q2. Asked about project
Interview Preparation Tips
Experience: 3 very simple questions on hackerrank.
Duration: 1 hour 30 minutes
Total Questions: 3
Round: Group Discussion
Duration: 1 hour
Round: Technical Interview
Experience: Asked me to code up a simple question
College Name: IIT Madras
Software Developer Interview Questions & Answers
Microsoft Corporation
Revanth
posted on 22 Aug 2016
I applied via Campus Placement
Interview Preparation Tips
Experience: exam was easy.
Tips: Be good in C programming
Duration: 75 minutes
Total Questions: 3
General Tips: Should be good in atleast c or c++
Skills: Algorithms And Data Structures
Duration: 2
College Name: IIT Madras
Motivation: The accomodation and facilities
Funny Moments: Interviews are not funny.
Interview Preparation Tips
Experience: This was a written round. Proper code with correct syntax to be written on paper.
There were 4 questions to be solved in 1 hour. Some questions needed test cases and time complexity to be answered as well.
1) Binary numbers are given as linked lists. Add and store result in linked list.
2) A number starting from 1 can be got by either multiplying 3 or adding 5 to it. Given a number, find the sequence of operations to get it or say it’s not possible.
Eg: 13 = 1 * 3 + 5 + 5, 15 ; Not possible
3) Given an input array on integers. Output an array of same length such that the value at ith position of output array is the product of all numbers in input array except that at ith position.
Eg: Input: 3, 5, 7 Output: 35, 21, 15
4) Sort a stack in ascending order using another stack.12 people were shortlisted for next round
Round: Design Round:
Experience: This was NOT an elimination round.
It was a problem solving team exercise to understand their way of working.
The interviewers were making notes though during the exercise, don’t know if it affected our selection.
Round: Technical Interview
Experience: General questions based on resume, was asked to explain my internship project.
He asked questions on my written round. Asked me to find the bug in my code for 1st problem. He was extremely happy with me when I gave the correct answer.
He asked me for the code for the last problem since I hadn’t solved it.
Asked to reverse linked list using recursion, since I said I did by iteration earlier.
He had written code of second problem, I had to find bugs in it.
Discussion on quality engineering and developer profiles.
Round: HR Interview
Experience: This was more of a general discussion. She told me about what quality engineers do, how their role is more powerful. Asked me how you would test the Google page.
She was extremely impressed by my resume and asked me questions about my electives. She told me in this round itself that I was selected, only need to wait for the official announcement.I hope this article helps students. One advice, make sure you make a good resume and also try to focus on proper code and explaining your logic well.Thank you!
College Name: NA
I was interviewed before Jan 2021.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a written round. Proper code with correct syntax to be written on paper.
There were 4 questions to be solved in 1 hour. Some questions needed test cases and time complexity to be answered as well.
- Q1.
Add Two Numbers as Linked Lists
You are given two singly linked lists, where each list represents a positive number without any leading zeros.
Your task is to add these two numbers and return the sum as ...
- Ans.
Add two numbers represented as linked lists and return the sum as a linked list.
Traverse both linked lists simultaneously while keeping track of carry from previous sum
Handle cases where one linked list is longer than the other by padding with zeros
Create a new linked list to store the sum of the two numbers
- Q2.
Minimum Number Of Operations To Reach X Problem Statement
Given an array
ARRof 'N' integers and an integer 'X', determine the minimum number of operations required to make the sum of removed elements fro... - Ans.
Given an array of integers and a target sum, find the minimum number of operations to make the sum of removed elements equal to the target.
Iterate from both ends of the array, removing elements until the sum matches the target
Use a two-pointer approach to efficiently find the minimum number of operations
If achieving the target sum is not possible, return -1
- Q3.
Product Of Array Except Self Problem Statement
You are provided with an integer array
ARRof sizeN. You need to return an arrayPRODUCTsuch thatPRODUCT[i]equals the product of all the elements ofARR... - Ans.
The problem requires returning an array where each element is the product of all elements in the input array except itself.
Iterate through the array twice to calculate the product of all elements to the left and right of each element.
Use two arrays to store the products to the left and right of each element.
Multiply the corresponding elements from the left and right arrays to get the final product array.
Handle integer ...
- Q4.
Sort a Stack Problem Statement
You are provided with a stack consisting of 'N' integers. The goal is to sort this stack in descending order by utilizing recursion.
Allowed Stack Operations:
is_empty(S) ... - Ans.
Sort a stack in descending order using recursion without using loop constructs.
Implement a recursive function to sort the stack in descending order.
Use the provided stack operations to manipulate the stack.
Recursively pop elements from the stack, sort them, and push them back in descending order.
Handle base cases such as an empty stack or a single element stack.
Ensure the stack is sorted in descending order after the r...
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
General questions based on resume, was asked to explain my internship project.
He asked questions on my written round. Asked me to find the bug in my code for 1st problem. He was extremely happy with me when I gave the correct answer.
He asked me for the code for the last problem since I hadn’t solved it.
Asked to reverse linked list using recursion, since I said I did by iteration earlier.
He had written code of second problem, I had to find bugs in it.
Discussion on quality engineering and developer profiles.
- Q1.
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link... - Ans.
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.
Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list as the last node encountered during the reversal process.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
I was interviewed before Jan 2021.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical round that lasted for around 60 minutes. The interviewer asked questions on data structures and OOPS concepts.
- Q1.
Problem: Permutations of a String
Given a string
STRconsisting 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.
Generate all permutations of the given string using backtracking.
Sort the permutations in lexicographical order.
Print the sorted permutations separated by space.
- Q2.
Greatest Common Divisor Problem Statement
You are tasked with finding the greatest common divisor (GCD) of two given numbers 'X' and 'Y'. The GCD is defined as the largest integer that divides both of the...
- Ans.
Find the greatest common divisor (GCD) of two given numbers 'X' and 'Y'.
Implement a function to calculate GCD using Euclidean algorithm
Iteratively find the remainder of X divided by Y until Y becomes 0
The last non-zero remainder is the GCD of X and Y
- Q3. What are the differences between C, C++, and Java?
- Ans.
C is a procedural language, C++ is an object-oriented language, and Java is a platform-independent language.
C is a procedural programming language, while C++ supports both procedural and object-oriented programming.
C++ is an extension of C with additional features like classes and inheritance.
Java is a platform-independent language that runs on a virtual machine and uses automatic memory management.
C is closer to the h...
- Q4. What is the purpose of the virtual keyword in C++?
- Ans.
The virtual keyword in C++ is used to declare a member function in a base class that can be overridden in derived classes.
Virtual functions allow for dynamic polymorphism in C++ by enabling late binding.
Virtual functions are declared in the base class with the 'virtual' keyword and can be overridden in derived classes.
When a derived class overrides a virtual function, the function in the derived class is called instead...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical round that lasted for around 60 minutes. The interviewer asked questions on data structures and question related to cloud computing(cloud computing was listed on my resume) .
- Q1.
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1.
get(key)- Return the value of the key if it exists in the cache; otherw... - Ans.
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to keep track of the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access and update.
When capacity is reached, evict the least recently used item before inserting a new item.
Update the order of keys in the linked list whenever a...
- Q2.
Problem Statement: Delete Node In A Linked List
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...
- Ans.
Delete a specific node from a singly linked list given the reference to the node.
Traverse the linked list to find the node to be deleted.
Update the pointers to skip over the node to be deleted.
Print the modified linked list after deletion.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round that lasted for around 60 minutes. The interviewer asked questions on data structures and question related to networking.
- Q1.
Insertion Sort in a Linked List
Given a singly linked list with 'N' nodes containing integer values, your task is to sort the list using insertion sort and output the sorted list.
Insertion Sort is an al...
- Ans.
Implement insertion sort algorithm on a singly linked list.
Traverse the linked list and for each node, find its correct position in the sorted list.
Keep track of the current node and the previous node to perform the insertion.
Repeat this process until all nodes are sorted in the linked list.
Ensure to handle edge cases like empty list or list with only one node.
- Q2.
Find Duplicates in an Array
Given an array
ARRof size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.Return the duplicate elements in any orde...
- Ans.
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Time complexity can be optimized to O(N) using a set to store duplicates.
(1 Question)
Round duration - 40 minutes
Round difficulty - Easy
The Interviewer asked me questions to know more about me. He also asked a puzzle.
- Q1. You have a racetrack with 25 horses. What is the fastest way to determine the top 3 fastest horses, given that you can only race 5 horses at a time?
- Ans.
To determine the top 3 fastest horses out of 25, race horses in groups of 5 and keep track of the fastest horses in each race.
Divide the 25 horses into 5 groups of 5 horses each.
Race all 5 horses in each group, keeping track of the top 3 fastest horses in each race.
After 5 races, you will have the top 3 fastest horses from each group.
Race the top 3 horses from each group in a final race to determine the overall top 3 f
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
Winman Software Interview FAQs
Tell us how to improve this page.
Winman Software Interviews By Designations
- Winman Software Software Developer Interview Questions
- Winman Software Executive Accountant Interview Questions
- Winman Software Test Engineer Interview Questions
- Winman Software Assistant Trainee Interview Questions
- Winman Software Finance Executive Interview Questions
- Winman Software Software Developer Trainee Interview Questions
- Winman Software Officer Interview Questions
- Winman Software QA Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Specialist Programmer Interview Questions
- Programmer Analyst Interview Questions
- Programmer Analyst Trainee Interview Questions
- Java Programmer Interview Questions
- Programmer Interview Questions
- Senior Programmer Interview Questions
- Associate Software Programmer Interview Questions
- Trainee Programmer Interview Questions
- Show more
Winman Software Software Programmer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Winman Software Software Programmer Reviews and Ratings
based on 2 reviews
Rating in categories
|
Software Developer
28
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Program Engineer
22
salaries
| ₹0 L/yr - ₹0 L/yr |
|
QA Executive
12
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Business Development Executive
11
salaries
| ₹0 L/yr - ₹0 L/yr |
|
System Administrator
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Tally Solutions
MARG ERP
Busy Infotech
LOGIC ERP
- Home >
- Interviews >
- Winman Software Interview Questions >
- Winman Software Software Programmer Interview Questions
