Upload Button Icon Add office photos
Engaged Employer

i

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

Wissen Infotech Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Wissen Infotech Software Engineer Interview Questions and Answers

Updated 5 Aug 2024

Wissen Infotech Software Engineer Interview Experiences

1 interview found

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

(2 Questions)

  • Q1. Regarding cloud
  • Q2. Oracle core dba

Software Engineer Jobs at Wissen Infotech

View all

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. Questions on core java, data structures, Spring

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases like no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process adjacent oranges

  • Answered by AI
  • Q2. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q3. 

    Maximum Path Sum Between Two Leaves Problem Description

    You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...

  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes.

    • Keep track of the maximum sum found so far.

    • Consider all possible paths between leaf nodes.

    • Handle cases where the tree has only a single leaf node.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with DSA based questions.

  • Q1. 

    N-th Node From The End Problem Statement

    You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.

    Example:

    Input:
    If the given list is (1 -> -2 -&g...
  • Ans. 

    Find the N-th node from the end of a Singly Linked List of integers.

    • Traverse the list to find the length L of the list.

    • Calculate the position of the N-th node from the beginning as L - N + 1.

    • Traverse the list again to reach the calculated position and return the node's value.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other or when one node is the LCA itself.

  • Answered by AI
  • Q3. 

    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 spaces and multiple spaces between words.

    • Split the input string by spaces to get individual words

    • Reverse the list of words

    • Join the reversed words with a single space in between

    • Handle leading/trailing spaces by stripping them before and after reversing

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA

  • Q1. 

    Minimum Time To Solve The Problems

    Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...

  • Ans. 

    Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.

    • Sort subjects in descending order

    • Assign subjects to friends one by one until all subjects are assigned

    • The maximum workload will be the sum of problems assigned to the friend with the most problems

    • Return the maximum workload as the minimum time required

  • Answered by AI
  • Q2. What is grammar in the context of compiler design?
  • Ans. 

    Grammar in compiler design defines the syntax and structure of a programming language.

    • Grammar specifies the rules for forming valid statements in a programming language.

    • It consists of a set of production rules that define how valid programs can be constructed.

    • There are different types of grammars such as context-free grammar, regular grammar, etc.

    • Example: In C programming language, the grammar specifies that a for loop...

  • Answered by AI
  • Q3. What is a token in compiler design?
  • Ans. 

    A token in compiler design is a basic unit of syntax that the compiler can understand and process.

    • Tokens are the smallest units of a program that are meaningful to the compiler.

    • Examples of tokens include keywords, identifiers, operators, and punctuation symbols.

    • Tokens are generated by the lexical analysis phase of the compiler.

    • Tokens are used by the parser to build the abstract syntax tree of the program.

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.

  • Q1. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current path sum to the total sum when reaching a leaf node

    • Use modulo (10^9 + 7) to handle large outputs

  • Answered by AI
  • Q2. What is a regular language?
  • Ans. 

    A regular language is a language that can be recognized by a finite automaton.

    • Regular languages can be described by regular expressions.

    • Regular languages are closed under union, concatenation, and Kleene star operations.

    • Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.

  • Answered by AI
  • Q3. What are NP and NP-Hard problems?
  • Ans. 

    NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.

    • NP problems can be verified in polynomial time but not necessarily solved in polynomial time.

    • NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.

    • Examples of NP problems include the subset sum problem and the traveling salesm...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

That was the round for which I’ve been waiting for hours 
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAccolite Digital Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 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

I appeared for an interview in Oct 2016.

Interview Questionnaire 

2 Questions

  • Q1. Based on projects
  • Q2. Tricky questions

Interview Preparation Tips

Round: Test
Experience: There were three sections
Eg:- math aptitude and verbal
Each containing 20 question each
Tips: If one question is taking more than enough time switch to next
Duration: 1 hour
Total Questions: 60

Round: Technical Interview
Experience: During this round interviewer checked the knowledge of the student
Tips: Prepare well for your interview

Round: HR Interview
Experience: In this round interviewer checks the presence of mind of student
Tips: Be attentive

College Name: Chitkara University, Himachal Pradesh

I applied via Naukri.com and was interviewed in Aug 2019. There were 4 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Technical questions was all based on skills I added in my resume.
  • Q2. Explain the last project, What challenges you faced & how you overcome that & what you learn from it.
  • Ans. 

    Developed a web application for tracking inventory in real-time

    • Challenges faced included integrating with multiple APIs, handling large data sets, and ensuring data accuracy

    • Overcame challenges by breaking down tasks into smaller components, conducting thorough testing, and collaborating with team members

    • Learned the importance of communication, problem-solving, and attention to detail in software development

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Explore and study well the skills you are adding in the resume, communication should be clear and not to be too much lengthy. Be confident, and always improve yourself where you are lacking.

I applied via Referral and was interviewed before Sep 2019. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. State HTTP methods. Comparable vs Comparator. Rest calls design & implementation. Overloading & overriding method differences, rules. Features of JDK 1.8. As java 8 supports default interface, how is diamo...

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident. Even interviewers don’t know everything. Be confident & try to answer every question. Even if you don’t know much about specific question asked, try to address areas related to it, which you know.

I applied via Recruitment Consulltant and was interviewed before Apr 2021. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Different types of No SQL DBs
  • Ans. 

    NoSQL databases are non-relational databases that store and retrieve data in a non-tabular format.

    • Document-oriented databases (MongoDB, Couchbase)

    • Key-value stores (Redis, Riak)

    • Column-family stores (Cassandra, HBase)

    • Graph databases (Neo4j, OrientDB)

  • Answered by AI
  • Q2. Different types of scaling
  • Ans. 

    Scaling refers to the process of increasing or decreasing the capacity of a system to handle more or less load.

    • Vertical Scaling: Adding more resources to a single node

    • Horizontal Scaling: Adding more nodes to a system

    • Load Balancing: Distributing the load across multiple nodes

    • Database Sharding: Splitting a database into smaller parts to distribute the load

    • Caching: Storing frequently accessed data in memory for faster acc

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Focus on Problem solving. Have a good understanding on main concepts of DSA. Java technical side is just as same as other companies. Also if you are applying for senior positions. Prepare for System Design rounds

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed in May 2019. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Technical questions & team leading

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview is not difficult..

I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Fibonacci series.

Interview Preparation Tips

Interview preparation tips for other job seekers - The interview was good

I applied via Approached by Company and was interviewed before Apr 2021. 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 - Technical 

(1 Question)

  • Q1. Basic front-end questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Good company with work life balance

Wissen Infotech Interview FAQs

How many rounds are there in Wissen Infotech Software Engineer interview?
Wissen Infotech interview process usually has 1 rounds. The most common rounds in the Wissen Infotech interview process are Technical.
How to prepare for Wissen Infotech Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Wissen Infotech. The most common topics and skills that interviewers at Wissen Infotech expect are Application Development, Agile, Business Intelligence, Javascript and Machine Learning.
What are the top questions asked in Wissen Infotech Software Engineer interview?

Some of the top questions asked at the Wissen Infotech Software Engineer interview -

  1. Oracle core ...read more
  2. Regarding cl...read more

Tell us how to improve this page.

Wissen Infotech Software Engineer Interview Process

based on 3 interviews

Interview experience

3.7
  
Good
View more
Wissen Infotech Software Engineer Salary
based on 379 salaries
₹3.5 L/yr - ₹14 L/yr
At par with the average Software Engineer Salary in India
View more details

Wissen Infotech Software Engineer Reviews and Ratings

based on 52 reviews

3.9/5

Rating in categories

3.5

Skill development

3.8

Work-life balance

3.5

Salary

3.4

Job security

3.5

Company culture

3.4

Promotions

3.4

Work satisfaction

Explore 52 Reviews and Ratings
Software Engineer

Bangalore / Bengaluru

2-7 Yrs

Not Disclosed

Explore more jobs
Software Engineer
379 salaries
unlock blur

₹3.5 L/yr - ₹14 L/yr

Junior Software Engineer
239 salaries
unlock blur

₹2.4 L/yr - ₹6.3 L/yr

Senior Software Engineer
211 salaries
unlock blur

₹7.5 L/yr - ₹25 L/yr

Associate Software Engineer
194 salaries
unlock blur

₹2.5 L/yr - ₹9 L/yr

Junior Engineer
90 salaries
unlock blur

₹2.4 L/yr - ₹5.9 L/yr

Explore more salaries
Compare Wissen Infotech with

Wissen Technology

3.8
Compare

ITC Infotech

3.6
Compare

3i Infotech

3.5
Compare

Cybage

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