i
Addverb Technologies
Filter interviews by
Logical thinking based coding based on arrays for loops and passing of pointers, arrays in function and returning array pointer took place on leetcode, 2nd question was based on linked list, structure implementation, reducing complexity of code, finding if linked list is circular or not with O(1) complexity.
Top trending discussions
I appeared for an interview in Sep 2017.
A sorting algorithm is a method of arranging elements in a specific order.
Sorting algorithms can be categorized as comparison-based or non-comparison-based.
Common sorting algorithms include bubble sort, insertion sort, selection sort, merge sort, quicksort, and heapsort.
Efficiency of sorting algorithms is measured by their time complexity, space complexity, and stability.
Example: Sorting an array of strings in alphabet
Accessing id parameter in URL involves parsing the URL and extracting the id value.
Use the window.location object to access the URL of the current page.
Parse the URL using methods like split() or URLSearchParams to extract the id parameter.
Example: If the URL is 'http://example.com/page?id=123', you can access the id value by parsing the URL.
posted on 18 Mar 2025
I appeared for an interview in Feb 2025, where I was asked the following questions.
I admire your company's innovative approach and commitment to quality, which aligns with my career goals and values as a developer.
Your company's focus on cutting-edge technology, like AI and machine learning, excites me as I want to work on impactful projects.
I appreciate your commitment to professional development, such as mentorship programs, which will help me grow my skills.
The collaborative culture here fosters c...
SQL constraints are rules applied to table columns to enforce data integrity and validity.
PRIMARY KEY: Uniquely identifies each record in a table. Example: `CREATE TABLE Users (UserID INT PRIMARY KEY);`
FOREIGN KEY: Ensures referential integrity between two tables. Example: `FOREIGN KEY (UserID) REFERENCES Users(UserID)`.
UNIQUE: Ensures all values in a column are different. Example: `CREATE TABLE Users (Email VARCHAR(25...
I applied via LinkedIn and was interviewed in Sep 2024. There were 2 interview rounds.
It was a combination of Maths and Electronics basics.
I am a recent graduate with a degree in Computer Science and a passion for coding and problem-solving.
Recent graduate with a degree in Computer Science
Passionate about coding and problem-solving
Strong communication and teamwork skills
I have worked on various projects including a web development project, a data analysis project, and a machine learning project.
Developed a website for a local business using HTML, CSS, and JavaScript.
Conducted data analysis on customer feedback data to identify trends and make recommendations for improvement.
Implemented a machine learning algorithm to predict customer churn for a telecom company.
posted on 19 Apr 2024
Association, aggregation, and composition are types of relationships between classes in object-oriented programming.
Association is a relationship where two classes are connected, but not dependent on each other.
Aggregation is a type of association where one class contains another class, but the contained class can exist independently.
Composition is a stronger form of aggregation where the contained class is part of the
posted on 22 Jun 2023
I applied via Referral and was interviewed before Jun 2022. There were 3 interview rounds.
Object-oriented programming paradigm focusing on objects and classes for code organization and reusability.
Encapsulation: Bundling data and methods that operate on the data into a single unit (object)
Inheritance: Ability of a class to inherit properties and behavior from another class
Polymorphism: Ability to present the same interface for different data types
Object-oriented programming paradigm that focuses on objects and classes
Encapsulation: bundling data and methods that operate on the data into a single unit (class)
Inheritance: ability of a class to inherit properties and behavior from another class
Polymorphism: ability to present the same interface for different data types
Abstraction: hiding the complex implementation details and showing only the necessary features
Oop s concept all give simple program noted task
posted on 6 Mar 2024
I applied via Recruitment Consulltant and was interviewed before Mar 2023. There was 1 interview round.
Asked to create a login form using MVVM architecture with frontend WPF and backend C#
posted on 6 Feb 2023
I applied via Naukri.com and was interviewed in Jan 2023. There was 1 interview round.
O(n) refers to linear time and space complexity.
O(n) means that the time or space required by an algorithm grows linearly with the size of the input.
It implies that the algorithm's performance is directly proportional to the input size.
For example, if an algorithm takes 10 seconds to process 100 elements, it would take 20 seconds to process 200 elements.
O(n) complexity is considered efficient and desirable in most case
based on 2 interviews
Interview experience
based on 4 reviews
Rating in categories
Junior Engineer
177
salaries
| ₹2.6 L/yr - ₹5.5 L/yr |
Engineer
104
salaries
| ₹2.5 L/yr - ₹11.5 L/yr |
Manager
65
salaries
| ₹7.8 L/yr - ₹18 L/yr |
Automation Engineer
54
salaries
| ₹3.2 L/yr - ₹7.5 L/yr |
Software Engineer
47
salaries
| ₹5.9 L/yr - ₹17.4 L/yr |
Honeywell Automation
Rockwell Automation
Wipro PARI
GKN