i
Synopsys
Filter interviews by
General aptitude questions
Problem solving, solved 2 out of 3 questions
General topics were given in gd
I applied via Referral and was interviewed before Nov 2023. There were 2 interview rounds.
Frog jump dp problem
Top trending discussions
I appeared for an interview before May 2016.
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Team player with excellent communication skills
malloc is a function in C programming used to dynamically allocate memory during runtime.
malloc stands for 'memory allocation'.
It is used to allocate a specific amount of memory during program execution.
The allocated memory is not automatically initialized and must be explicitly freed using the free() function to avoid memory leaks.
I applied via Campus Placement and was interviewed before Jun 2023. There were 2 interview rounds.
Reasoning, maths english
Tree environment 123
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
Logical questions were asked in round one
I applied via LinkedIn and was interviewed in Dec 2024. There was 1 interview round.
2 questions around leetcode medium and hard
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 27 Feb 2023
I applied via Recruitment Consulltant and was interviewed in Aug 2022. There were 3 interview rounds.
Basic aptitude, c and data structures
I applied via Naukri.com and was interviewed in Aug 2022. There were 2 interview rounds.
based on 2 interviews
Interview experience
based on 3 reviews
Rating in categories
R&D Engineer
161
salaries
| ₹7.1 L/yr - ₹29.4 L/yr |
Staff Engineer
113
salaries
| ₹22 L/yr - ₹56.9 L/yr |
Senior R&D Engineer
105
salaries
| ₹15 L/yr - ₹40.7 L/yr |
Applications Engineer
62
salaries
| ₹10 L/yr - ₹25.6 L/yr |
Security Consultant
62
salaries
| ₹5.8 L/yr - ₹21.1 L/yr |
Intel
Apar Industries
TDK India Private Limited
Molex