i
Wappnet Systems
Filter interviews by
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
Basic to advanced leval
React Native is a framework developed by Facebook for building native mobile apps using JavaScript and React, while Flutter is a UI toolkit developed by Google for building natively compiled applications for mobile, web, and desktop from a single codebase.
React Native uses JavaScript and React to build mobile apps, while Flutter uses Dart programming language.
React Native uses native components to render UI elements, w...
I applied via Campus Placement and was interviewed in Jun 2024. There was 1 interview round.
Basic maths basic programming questions
I applied via Campus Placement and was interviewed in May 2022. There were 3 interview rounds.
Aptitude was MCQ based plus DSA based on Java.
Coding was based on SQL queries only.
I applied via Campus Placement and was interviewed before Aug 2022. There were 3 interview rounds.
Asking for run time algorithm solution
Search tree algorithm is a method used to search for a specific value in a tree data structure.
Uses depth-first or breadth-first search techniques
Commonly used in artificial intelligence and decision-making algorithms
Examples include binary search tree and AVL tree
Object-oriented programming principles applied within a project to improve code organization and reusability.
Encapsulation: Grouping related data and functions together to restrict access from outside.
Inheritance: Creating new classes based on existing classes to reuse code and extend functionality.
Polymorphism: Using the same interface for different data types or classes.
Abstraction: Hiding complex implementation deta...
Wappnet Systems interview questions for popular designations
posted on 5 Feb 2025
GIL is a mutex that protects access to Python objects, preventing multiple threads from executing Python bytecodes simultaneously.
GIL is a global lock that allows only one thread to execute Python bytecode at a time.
It is necessary because CPython's memory management is not thread-safe.
GIL can limit the performance of multi-threaded Python programs, especially on multi-core systems.
However, it does not prevent multi-th...
Yes, the Global Interpreter Lock (GIL) in Python ensures only one thread can execute Python bytecode at a time, limiting the efficiency of multi-threading.
GIL is a mutex that protects access to Python objects, preventing multiple threads from executing Python bytecodes simultaneously.
This means that even on multi-core systems, Python threads cannot fully utilize all available CPU cores for parallel processing.
However, ...
posted on 13 Jan 2025
Use the print() function in Python to display 'Hello World'.
Use the print() function followed by the string 'Hello World'
Enclose the string in single or double quotes
Example: print('Hello World')
Prints 'Hello World' to the console
Use the print() function in Python to display text
Enclose the text in double quotes to print it as a string
Example: print('Hello World')
posted on 12 Apr 2023
I applied via Recruitment Consulltant and was interviewed before Apr 2022. There were 3 interview rounds.
25 MCQ questions online with time limit
Create webapp . Frontend, Backend , data encryption
I appeared for an interview before Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round with questions on DSA and DBMS mainly.
Given an array ARR
consisting of N
integers, determine the sum of the subarray with the maximum sum, including the possibility of an empty subarray.
A subarray is a...
Find the sum of the subarray with the maximum sum in a given array.
Iterate through the array and keep track of the current sum and maximum sum.
Update the maximum sum if the current sum becomes greater.
Handle cases where the array has all negative numbers or empty subarray.
Example: For input [-2, 1, -3, 4, -1], the maximum sum subarray is [4] with sum 4.
Given a positive integer N
, your task is to identify all prime numbers less than or equal to N
.
A prime number is a natural number greater than 1 that has no po...
Identify all prime numbers less than or equal to a given positive integer N.
Iterate from 2 to N and check if each number is prime
Use the Sieve of Eratosthenes algorithm for efficient prime number identification
Optimize by only checking numbers up to square root of N for divisibility
Joins in databases are used to combine rows from two or more tables based on a related column between them.
Joins are used to retrieve data from multiple tables based on a related column.
Common types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.
INNER JOIN returns rows when there is at least one match in both tables.
LEFT JOIN returns all rows from the left table and the matched rows from the right ta...
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with behavioral problems.
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.
posted on 30 May 2022
I applied via Recruitment Consulltant and was interviewed before May 2021. There were 5 interview rounds.
Hackerrank Test
posted on 14 Sep 2021
I applied via Campus Placement and was interviewed in Mar 2021. There were 4 interview rounds.
Joins in SQL are used to combine data from two or more tables based on a related column.
Inner join returns only the matching rows from both tables
Left join returns all rows from the left table and matching rows from the right table
Right join returns all rows from the right table and matching rows from the left table
Full outer join returns all rows from both tables, with NULL values for non-matching rows
Cross join retur
Given an array of integers, find a contiguous subarray with a given sum.
Use a sliding window approach to iterate through the array and keep track of the current sum.
If the current sum exceeds the given sum, move the window's left endpoint forward.
If the current sum is less than the given sum, move the window's right endpoint forward.
If the current sum equals the given sum, return the subarray.
Time complexity: O(n), Spa
based on 4 interviews
Interview experience
based on 16 reviews
Rating in categories
Software Developer
4
salaries
| ₹3.2 L/yr - ₹4.2 L/yr |
Junior Software Developer
4
salaries
| ₹2.4 L/yr - ₹4 L/yr |
Associate Software Engineer
3
salaries
| ₹5 L/yr - ₹5 L/yr |
Associate Software Developer
3
salaries
| ₹3 L/yr - ₹4.5 L/yr |
Mobile Application Developer
3
salaries
| ₹5 L/yr - ₹5 L/yr |
Accel Frontline
Northcorp Software
Elentec Power India (EPI) Pvt. Ltd.
HyScaler