i
Coforge
Filter interviews by
I applied via Naukri.com and was interviewed before Dec 2022. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Aug 2020. There were 4 interview rounds.
I appeared for an interview in Apr 2017.
I am a software developer with a passion for coding and problem-solving. My family is supportive and has always encouraged my career in tech.
Experienced software developer
Passionate about coding and problem-solving
Supportive family that encourages my career in tech
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This was an easy round which went really smooth.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iteratively calculate F(n) using F(n-1) and F(n-2).
Ensure the input N is within the constraints 1 <= N <= 10000.
Example: For N = 5, the 5th Fibonacci number is 5 (1, 1, 2, 3, 5).
Given a positive integer N
, your task is to determine and return all prime numbers less than or equal to N
.
N = 10
2 3 5 7
N = 20
Implement a function to return all prime numbers less than or equal to a given positive integer N.
Create a function that takes a positive integer N as input
Iterate from 2 to N and check if each number is prime
Use a helper function to determine if a number is prime
Return an array of all prime numbers less than or equal to N
A merge join in SQL is a method of combining two sorted datasets by matching corresponding rows based on a specified condition.
Merge join is used when joining two large datasets that are already sorted.
It is more efficient than other join methods like nested loop join or hash join for sorted datasets.
The join condition must be an equality condition.
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.id = table2.i
Round duration - 30 minutes
Round difficulty - Easy
The round went excellent. I really enjoyed it. Just be confident about whatever you answer
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 Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This round went well. Interview depends on your basic knowledge of C/C++.
Given two sparse matrices MAT1
and MAT2
of integers with dimensions 'N' x 'M' and 'M' x 'P' respectively, the goal is to determine the resulting matrix produced by their multipl...
Implement a function to multiply two sparse matrices and return the resulting matrix.
Create a function that takes two sparse matrices as input and returns the resulting matrix after multiplication
Iterate through the non-zero elements of the matrices to perform the multiplication efficiently
Handle the edge cases such as empty matrices or matrices with all zero elements
Ensure the dimensions of the matrices are compatible
Tanmay and Rohit are best buddies. Tanmay gives Rohit a challenge involving an array of N natural numbers. The task is to perform and answer a series of queries on the ...
Count the number of even or odd numbers in a range of an array based on given queries.
Create an array to store the input numbers.
Iterate through the queries and update or count even/odd numbers based on the query type.
Output the count of even or odd numbers for each query of type 1 or 2.
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 16 Aug 2015
Network layers are a hierarchical way of organizing communication protocols.
Network layers provide a modular approach to networking.
Each layer has a specific function and communicates with adjacent layers.
The OSI model has 7 layers, while the TCP/IP model has 4 layers.
Examples of layers include the physical layer, data link layer, network layer, transport layer, and application layer.
Deadlock is a situation where two or more processes are unable to proceed because they are waiting for each other to release resources.
Occurs in multi-threaded/multi-process environments
Can lead to system freeze or crash
Prevention techniques include resource ordering and timeouts
Example: Process A holds resource X and waits for resource Y, while Process B holds resource Y and waits for resource X
Paging and Segmentation are memory management techniques used by operating systems.
Paging divides memory into fixed-size pages and stores them in physical memory.
Segmentation divides memory into logical segments and stores them in physical memory.
Paging allows for efficient use of physical memory and reduces fragmentation.
Segmentation allows for protection and sharing of memory between processes.
Examples of operating s...
Reverse a linked list using iterative and recursive methods.
Iterative method involves traversing the list and changing the pointers to reverse the order.
Recursive method involves calling the function recursively on the next node and changing the pointers.
Both methods have O(n) time complexity and O(1) space complexity.
Example: 1->2->3->4->5 becomes 5->4->3->2->1.
Clone a linked list with a random pointer.
Create a new node for each node in the original list.
Use a hash table to map the original nodes to their clones.
Iterate through the original list again and update the random pointers of the clone nodes.
The question asks to input an array and print the repeating characters.
Iterate through the array and store each element in a hash table or dictionary.
If an element already exists in the hash table, it is a repeating character.
Print all the repeating characters found.
Program to find the second minimum in an array.
Sort the array and return the second element.
Initialize two variables to store minimum and second minimum values.
Loop through the array and update the variables accordingly.
To find the longest palindrome in a given string.
Iterate through the string and check for palindromes of odd and even lengths.
Keep track of the longest palindrome found so far.
Use two pointers to check if the substring is a palindrome.
If the substring is a palindrome and its length is greater than the current longest palindrome, update the longest palindrome.
Find the next higher number with equal number of ones in binary representation.
Convert input number to binary
Count number of ones in binary representation
Increment input number until binary representation has equal number of ones
Convert incremented number to decimal
Find the duplicate number in an array of 10 numbers with only 2 steps.
Use a hash set to keep track of visited numbers.
Iterate through the array and check if the number is already in the set.
If it is, then it is the duplicate number.
If not, add it to the set.
At the end, the duplicate number will be found.
Program to print elements of a linked list in reverse order using same single linked list
Traverse the linked list and push each element onto a stack
Pop elements from the stack and print them in reverse order
To check the occurrence and correctness of HTML tags, we can use various tools and techniques.
One way is to use a browser's developer tools to inspect the HTML code and see the tags and their frequency.
Another way is to use an online HTML validator tool that checks for correct syntax and tag usage.
We can also use programming languages like Python to parse HTML and count the occurrence of each tag.
Regular expressions ca...
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Senior Software Engineer
4.9k
salaries
| ₹6.3 L/yr - ₹23.1 L/yr |
Technical Analyst
2.6k
salaries
| ₹9.5 L/yr - ₹38.4 L/yr |
Software Engineer
2k
salaries
| ₹2 L/yr - ₹9.5 L/yr |
Senior Test Engineer
1.8k
salaries
| ₹4.6 L/yr - ₹19 L/yr |
Technology Specialist
1.2k
salaries
| ₹12 L/yr - ₹42 L/yr |
Capgemini
Cognizant
Accenture
Infosys