i
UST
Filter interviews by
I applied via Naukri.com and was interviewed in Aug 2022. There was 1 interview round.
To check if a linked list is circular or linear, we need to traverse the list and check if it loops back to a previous node.
Traverse the linked list using two pointers, one moving one node at a time and the other moving two nodes at a time.
If the faster pointer catches up to the slower pointer, then the list is circular.
If the faster pointer reaches the end of the list without catching up to the slower pointer, then th
Count the number of set bits in a given number.
Use bitwise AND operator with 1 to check if the rightmost bit is set.
Shift the number to right by 1 bit and repeat the process until the number becomes 0.
Keep a count of the number of set bits encountered.
Example: For number 5 (101 in binary), the answer is 2 as there are 2 set bits.
Example: For number 15 (1111 in binary), the answer is 4 as there are 4 set bits.
Segmentation fault is a type of error caused by accessing memory that “does not belong to you.”
It occurs when a program tries to access a memory location that it is not allowed to access.
It is often caused by programming errors such as accessing an array beyond its bounds.
It can also be caused by hardware problems such as faulty RAM or overheating.
Segmentation faults can be difficult to debug because they often occur i...
Counting characters using streams in Java
Use the chars() method to convert the string to an IntStream of characters
Use the count() method to count the number of characters in the stream
posted on 7 Jan 2023
Medium level coding question on leetcode and codechef are good to prepare to clear the test.
posted on 11 May 2022
Very easy
To find length, frequency of each character and list of unique characters of a string.
Iterate through the string and count the frequency of each character using a hash table.
Create a list of unique characters by iterating through the hash table.
Calculate the length of the string using the built-in length function.
Return the frequency, length and list of unique characters as an array of strings.
To check if a string is palindrome or not.
Compare the first and last characters of the string and continue towards the middle until all characters have been compared.
If all characters match, the string is a palindrome.
If any characters do not match, the string is not a palindrome.
posted on 28 Mar 2022
I applied via Approached by Company and was interviewed before Mar 2021. There were 2 interview rounds.
Implement a stack using a queue data structure.
Create two queues, q1 and q2.
Push elements into q1.
When popping, dequeue all elements from q1 and enqueue them into q2 until the last element.
Dequeue and return the last element from q1.
Swap q1 and q2 after each push or pop operation.
posted on 9 Oct 2020
posted on 16 Sep 2021
I applied via campus placement at J S S Academy of Technical Education, Bangalore and was interviewed in Dec 2024. There were 3 interview rounds.
Average to easy difficulty level.
posted on 31 Jan 2025
I was interviewed in Dec 2024.
Basics of Sql Queries and Explain the Queries
I applied via campus placement at Lovely Professional University (LPU) and was interviewed in Oct 2024. There were 3 interview rounds.
It contain 40 question which is very easy
It contain 3 coding question
Interview experience
based on 1 review
Rating in categories
Software Developer
2.1k
salaries
| ₹2.5 L/yr - ₹12.4 L/yr |
Senior Software Engineer
1.7k
salaries
| ₹6.5 L/yr - ₹26 L/yr |
Software Engineer
1.3k
salaries
| ₹3.6 L/yr - ₹14.8 L/yr |
System Analyst
1.2k
salaries
| ₹6.5 L/yr - ₹22.6 L/yr |
Senior Software Developer
1.1k
salaries
| ₹5.5 L/yr - ₹20 L/yr |
TCS
Infosys
Wipro
HCLTech