Filter interviews by
Top trending discussions
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
posted on 26 Nov 2020
I applied via Naukri.com and was interviewed in May 2020. There were 7 interview rounds.
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 30 minutes
Round difficulty - Easy
To search for a node in a linked list, iterate through the list and compare each node's value with the target value.
Start at the head of the linked list
Iterate through each node by following the 'next' pointer
Compare the value of each node with the target value
Return the node if found, otherwise return null
To detect a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps.
If there is a loop, the two pointers will eventually meet.
Alternatively, we can use a hash set to store visited nodes and check for duplicates.
Implement a stack using a singly linked list
Create a Node class with data and next pointer
Create a Stack class with top pointer pointing to the top of the stack
Implement push, pop, and peek operations by manipulating the linked list
Example: Node class - Node { int data; Node next; }
Round duration - 40 minutes
Round difficulty - Easy
The top view of a binary tree shows the nodes visible from the top when looking down from the root node.
The top view of a binary tree is the set of nodes visible from the top when looking down from the root node.
Nodes at the same horizontal distance from the root are considered at the same level in the top view.
If multiple nodes are at the same horizontal distance, only the topmost node at that level is included in the...
Deleting a node from a linked list involves updating pointers to maintain the list's integrity.
Identify the node to be deleted by traversing the list
Update the previous node's next pointer to skip the node to be deleted
Free the memory allocated to the node to be deleted
Do practice a lot of questions on linked list and stacks as these are two most important data structures asked in the interview. Also, try to implement it yourself without seeing the solution. Also prepare for Computer Science subjects like Operating System, Database Management System, Computer Networks, etc. I prepared them through Coding Ninjas notes which were simpler and easy to understand.
Application resume tips for other job seekersKeep your resume short and up to mark and check spellings before submitting it for the interview process.
Final outcome of the interviewSelectedposted 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...
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
Generate all combinations of digits from an array, allowing and disallowing repetition.
Use recursion or backtracking to generate combinations.
For repetition allowed: e.g., arr={1,2}, combinations are 11, 12, 21, 22.
For repetition not allowed: e.g., arr={1,2,3}, combinations are 123, 132, 213, 231, 312, 321.
Utilize a set to track used digits when repetition is not allowed.
I appeared for an interview before May 2016.
I appeared for an interview in Sep 2016.
I applied via Campus Placement
A program is a set of instructions that tells a computer what to do. A task is a unit of work performed by a program. A thread is a sequence of instructions within a task.
A program is a collection of instructions that are executed by a computer to perform a specific task.
A task is a unit of work that is performed by a program. It can be a specific action or a set of actions.
A thread is a sequence of instructions within...
Experienced software developer with expertise in Java, Python, and SQL
Proficient in Java, Python, and SQL programming languages
Developed web applications using Java Spring framework
Experience with database management and optimization using SQL
Worked on various software projects in a team environment
Swap even and odd bits in a given number
Create a mask for even bits and odd bits
Shift even bits to right and odd bits to left
Combine even and odd bits using bitwise OR operator
I appeared for an interview before Sep 2019.
Write a custom memcpy function with boundary condition handling.
Use pointers to copy data from source to destination.
Check for NULL pointers and zero length cases.
Use a loop to copy data byte by byte.
Handle overlapping memory regions with caution.
Find intersection point of two linked lists and optimize solution.
Traverse both lists and find their lengths
Move the head of the longer list to the same distance as the shorter list
Traverse both lists in parallel until they meet at the intersection point
Use hash table to store visited nodes for faster lookup
Use two pointers, one starting from the head of each list, and move them at the same pace until they meet at the ...
Missing number in a given series
Check the pattern of the series
Look for any arithmetic or geometric progression
Try to find the difference between consecutive numbers
Use mathematical formulas to solve the problem
Software Engineer
137
salaries
| ₹14.1 L/yr - ₹31.3 L/yr |
Accountant
126
salaries
| ₹1.3 L/yr - ₹3.6 L/yr |
Senior Software Engineer
104
salaries
| ₹16.2 L/yr - ₹30 L/yr |
R&D Engineer
49
salaries
| ₹23.3 L/yr - ₹54.2 L/yr |
Test Engineer
47
salaries
| ₹3.5 L/yr - ₹8.1 L/yr |
Qualcomm
Intel
Molex
TDK India Private Limited