i
Ignitarium Technology Solutions
Filter interviews by
I appeared for an interview in Sep 2023.
Create a number that is prime or not by using boolean
Top trending discussions
posted on 10 May 2015
Locate sum of 2 numbers in a linear array (unsorted and sorted) and their complexities
For unsorted array, use nested loops to compare each element with every other element until the sum is found
For sorted array, use two pointers approach starting from the beginning and end of the array and move them towards each other until the sum is found
Complexity for unsorted array is O(n^2) and for sorted array is O(n)
Pointers are used to manipulate memory addresses and values in C++. Increment/decrement, address of and value at operators are commonly used.
Incrementing a pointer moves it to the next memory location of the same data type
Decrementing a pointer moves it to the previous memory location of the same data type
The address of operator (&) returns the memory address of a variable
The value at operator (*) returns the value sto
To determine if a point is inside or outside a rectangle, we check if the point's coordinates fall within the rectangle's boundaries.
Check if the point's x-coordinate is greater than the left edge of the rectangle
Check if the point's x-coordinate is less than the right edge of the rectangle
Check if the point's y-coordinate is greater than the top edge of the rectangle
Check if the point's y-coordinate is less than the b...
To find line that divides rectangle into 2 equal halves through a point inside it.
Find the center of the rectangle
Draw a line from the center to the given point
Extend the line to the opposite side of the rectangle
The extended line will divide the rectangle into 2 equal halves
There are multiple combinations of 8-bit and 16-bit signed numbers. How many such combinations are possible?
There are 2^8 (256) possible combinations of 8-bit signed numbers.
There are 2^16 (65,536) possible combinations of 16-bit signed numbers.
To find the total number of combinations, we can add the number of combinations of 8-bit and 16-bit signed numbers.
Therefore, the total number of possible combinations is 256 +
Find duplicates in an array of elements in 0(n) time and 0(1) space.
Use the property of inputs to your advantage
Iterate through the array and mark elements as negative
If an element is already negative, it is a duplicate
Return all the negative elements as duplicates
I applied via Naukri.com and was interviewed in Jun 2019. There were 3 interview rounds.
Why-Why analysis is a problem-solving technique used to identify the root cause of a problem by repeatedly asking 'why' until the underlying cause is determined.
Why-Why analysis is also known as the 5 Whys technique.
It helps to uncover the underlying causes of a problem rather than just addressing the symptoms.
The technique involves asking 'why' multiple times to dig deeper into the problem.
Each 'why' question leads to...
5s is a workplace organization method that aims to improve efficiency and productivity by organizing and standardizing the workplace.
Sort - separate necessary items from unnecessary ones
Set in order - arrange necessary items in a logical manner
Shine - clean and inspect the workplace regularly
Standardize - establish procedures and guidelines for maintaining the workplace
Sustain - maintain the 5s system through continuou...
posted on 21 Mar 2022
I appeared for an interview in Aug 2021.
Round duration - 75 minutes
Round difficulty - Medium
This was an online coding round where I had 2 questions to solve under 75 minutes. Both the coding questions were related to DP and were of Medium to Hard level of difficulty.
Imagine Ninja is tackling a puzzle during his long summer vacation. He has two arrays of integers, each with lengths 'N' and 'M'. Ninja's task is to dete...
Find the length of the longest subsequence common to two arrays consisting only of prime numbers.
Iterate through both arrays to find prime numbers
Use dynamic programming to find the longest common subsequence
Consider edge cases like empty arrays or no common prime numbers
You are given an array ARR
of N integers. Your task is to perform operations on this array until it becomes empty, and maximize the sum of selected elements. In each operatio...
Given an array, select elements to maximize sum by removing adjacent elements. Return the maximum sum.
Iterate through the array and keep track of the frequency of each element.
Select the element with the highest frequency first, then remove adjacent elements.
Repeat the process until the array becomes empty and calculate the sum of selected elements.
Round duration - 60 minutes
Round difficulty - Medium
This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.
Your task is to determine if a given Singly Linked List of integers forms a cycle.
Explanation: A cycle in a linked list occurs when there is a node in the list that conn...
Detect if a given singly linked list of integers forms a cycle.
Use Floyd's Tortoise and Hare algorithm to detect cycle in linked list
Maintain two pointers, one moving at double the speed of the other
If they meet at some point, there is a cycle in the linked list
Determine whether a given array ARR
of positive integers is a valid Preorder Traversal of a Binary Search Tree (BST).
A binary search tree (BST) is a tree structure w...
Check if a given array of positive integers is a valid Preorder Traversal of a Binary Search Tree (BST).
Create a stack to keep track of nodes.
Iterate through the array and compare each element with the top of the stack.
If the current element is less than the top of the stack, push it onto the stack.
If the current element is greater than the top of the stack, pop elements from the stack until a greater element is found ...
Vtable and VPTR are used in C++ for implementing polymorphism through virtual functions.
Vtable (Virtual Table) is a table of function pointers used to implement dynamic dispatch for virtual functions.
VPTR (Virtual Pointer) is a pointer that points to the Vtable of an object.
Vtable is created by the compiler for each class that has virtual functions.
VPTR is added as a hidden member in each object of a class with virtual...
Friend functions in C++ are functions that are not members of a class but have access to its private and protected members.
Friend functions are declared inside a class with the keyword 'friend'.
They can access private and protected members of the class.
They are not member functions of the class, but have the same access rights as member functions.
Friend functions are useful when you want to allow a function external to
Round duration - 60 minutes
Round difficulty - Medium
This was also a DS/Algo round where I was given 2 questions to solve and I was expected to come up with the optimal approach as far as possible. I solved both the questions with the optimal time and space complexities and then I was asked some more questions related to DBMS towards the end of the interview.
You are given a binary tree. Your task is to print the Top View of the Binary Tree, displaying the nodes from left to right order.
The first line contains an integer 't'...
The task is to print the Top View of a Binary Tree from left to right order.
Use a map to store the horizontal distance of each node from the root.
Perform a level order traversal of the tree and keep track of the horizontal distance of each node.
Print the nodes in the map in ascending order of their horizontal distance.
Handle the case where multiple nodes have the same horizontal distance by printing the one that appear
Given a string STR
, determine the total number of palindromic substrings within STR
.
The first line contains an integer 't' representing the number ...
Count the total number of palindromic substrings in a given string.
Iterate through each character in the string and expand around it to find palindromic substrings.
Use dynamic programming to store previously calculated palindromic substrings.
Consider both odd and even length palindromes while counting.
Example: For input 'abbc', palindromic substrings are ['a', 'b', 'b', 'c', 'bb']. Total count is 5.
DELETE removes specific rows from a table, while TRUNCATE removes all rows and resets auto-increment values.
DELETE is a DML command, while TRUNCATE is a DDL command.
DELETE can be rolled back, while TRUNCATE cannot be rolled back.
DELETE triggers delete triggers, while TRUNCATE does not trigger any triggers.
DELETE is slower as it maintains logs, while TRUNCATE is faster as it does not maintain logs.
Example: DELETE FROM t
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity, while denormalization is the process of intentionally introducing redundancy to improve performance.
Normalization involves breaking down a table into smaller tables and defining relationships between them to reduce redundancy and dependency.
Denormalization involves combining tables and duplicating data to impr...
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.
I appeared for an interview before Sep 2020.
Round duration - 45 minutes
Round difficulty - Medium
Its a zoom call interview which lasted for 45 minutes. initially there are two panel members in which one is very targetting at me. They asked me different type of questions like jumping from DSA to project then to python then again java. Its a mixed combo pack type interview. for each and every question they asked me the real time example. The discussion on my project lasted for 15-20 mins.
Given a positive integer N
, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...
Count the total number of set bits in the binary representation of numbers from 1 to N modulo 1e9+7.
Use bitwise operations to count the set bits in each number from 1 to N.
Keep track of the total set bits and return the result modulo 1e9+7.
Optimize the solution to handle large values of N efficiently.
Consider using dynamic programming or precomputing values for faster computation.
Round duration - 30 mins
Round difficulty - Easy
This round was a zoom interview. The interview started with my brief introduction. This time the interview was more interested in my hobbies and passions. He asked me what do you do to keep yourself updated with the latest technology trends?
Tip 1 : Do participate in all the coding contests, long challenges held by codechef, codeforces
Tip 2 : Practice all kinds of problems on leetcode, gfg, coding ninjas
Tip 3 : When you are writing a written exam for a particular company, make sure you get to know about the company in detail.
Tip 1 : Make your resume short and sweet(mostly 1 page, max 2 pages) is preferred.
Tip 2 : Make sure your resume is crisp rather than descriptive
Tip 3 : Do not lie on your resume
I applied via Company Website and was interviewed before Jan 2023. There were 2 interview rounds.
Simple Python Coding questions.
I applied via Referral and was interviewed before Nov 2023. There were 2 interview rounds.
Frog jump dp problem
I applied via Approached by Company and was interviewed in Feb 2024. There were 3 interview rounds.
I have worked on projects related to developing software for autonomous vehicles and implementing machine learning algorithms for predictive maintenance.
Developed software for autonomous vehicles to improve navigation and obstacle avoidance
Implemented machine learning algorithms for predictive maintenance in manufacturing plants
Collaborated with cross-functional teams to integrate new technologies into existing systems
I have experience with Java, Python, SQL, AWS, Docker, and Kubernetes in my previous projects.
Java
Python
SQL
AWS
Docker
Kubernetes
Docker is a platform for developing, shipping, and running applications in containers.
Docker allows applications to be isolated in containers, making them portable and easy to deploy across different environments.
Containers share the host OS kernel but run as isolated processes, providing lightweight and efficient virtualization.
Docker simplifies the process of packaging applications and their dependencies, ensuring co...
Database normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
Database normalization involves breaking down data into smaller, more manageable tables and defining relationships between them.
It helps in reducing data redundancy, improving data integrity, and making the database more efficient.
For example, in a project I worked on, we normalized the database by spl...
I have extensive experience working on challenging projects in various industries.
Led a team in developing a complex software solution for a major client
Managed a project with tight deadlines and limited resources
Implemented innovative solutions to overcome technical obstacles
Collaborated with cross-functional teams to deliver successful outcomes
I would approach learning about new domain and technologies with a different background by leveraging my existing skills, seeking out resources, and collaborating with experts in the field.
Identify key concepts and terminology in the new domain
Seek out online courses, tutorials, and books to gain foundational knowledge
Collaborate with colleagues or mentors who have experience in the new domain
Experiment with hands-on p...
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalization is used to eliminate data redundancy by breaking up tables into smaller, related tables.
It helps in reducing data anomalies such as insertion, update, and deletion anomalies.
Normalization is achieved through a series of stages called normal forms, with the most common being First Normal Form (1NF)...
Armstrong algorithm is used to find Armstrong numbers in a given range.
Iterate through the numbers in the given range
Calculate the sum of cubes of each digit in the number
Check if the sum is equal to the original number
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Its basically a test comprising 32 mcq
12- logical reasoning
20- core C,DBMS, OS , Computer Networks
2 coding Questions
based on 1 interview
Interview experience
Senior Engineer
60
salaries
| ₹6.5 L/yr - ₹18.8 L/yr |
Engineer
40
salaries
| ₹4 L/yr - ₹10.8 L/yr |
Senior Software Engineer
33
salaries
| ₹8.5 L/yr - ₹22.2 L/yr |
AI Engineer
29
salaries
| ₹5 L/yr - ₹11 L/yr |
Staff Engineer
29
salaries
| ₹14.4 L/yr - ₹32 L/yr |
Infineon Technologies
Cadence Design Systems
GLOBALFOUNDRIES
Lam Research