i
Techsofya
Filter interviews by
Top trending discussions
posted on 25 Oct 2024
I applied via Referral and was interviewed in Sep 2024. There was 1 interview round.
posted on 16 Feb 2023
I applied via campus placement at Vivekananda Global University, Jaipur and was interviewed in Aug 2022. There were 4 interview rounds.
Raise ypur voice everything will go fine
posted on 4 Jan 2023
I applied via campus placement at G L Bajaj Institute of Technology & Management, Greater Noida and was interviewed before Jan 2022. There were 5 interview rounds.
General aptitude test with quantitative, qualitative, and English writing skill.
Pass test cases for 3-4 coding questions any language.
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
I applied via campus placement at National Institute of Technology,(NIT), Manipur and was interviewed in Oct 2024. There were 2 interview rounds.
Voice assesment,which will be evaluated by ai
I applied via Walk-in and was interviewed in Sep 2024. There were 2 interview rounds.
Questions on quant and math aptitude
I am a dedicated Technical Specialist with 5 years of experience in IT infrastructure management and troubleshooting.
5 years of experience in IT infrastructure management
Skilled in troubleshooting technical issues
Strong knowledge of network systems and protocols
Certified in Cisco networking technologies
I like programming languages such as Python, Java, and C++.
Python
Java
C++
We had 2 coding questions
I applied via campus placement at National Institute of Technology (NIT), Durgapur and was interviewed in Sep 2022. There were 3 interview rounds.
1 DP question, 1 simple integer manipulation
Find the 4th smallest element in a Binary Search Tree.
Traverse the BST in-order and keep track of the count of visited nodes.
When the count reaches 4, return the current node's value.
If the BST has less than 4 nodes, return null or throw an exception.
Find maximum distinct elements in every sliding window of size k.
Create a hash table to store the frequency of each element in the current window.
Use two pointers to maintain the current window and slide it over the array.
Update the hash table for each new element in the window and remove the old element.
Keep track of the maximum number of distinct elements seen so far.
Repeat until all windows of size k have been proce
Merge two sorted linked lists
Create a new linked list to store the merged list
Compare the first nodes of both lists and add the smaller one to the new list
Move the pointer of the added node to the next node
Repeat until one of the lists is empty
Add the remaining nodes of the non-empty list to the new list
Mostly engineering questions only they ask
based on 1 review
Rating in categories
Associate Technical Consultant
5
salaries
| ₹5.5 L/yr - ₹7.5 L/yr |
Technical Consultant
4
salaries
| ₹9.5 L/yr - ₹24 L/yr |
Consultant
3
salaries
| ₹11.2 L/yr - ₹12 L/yr |
TCS
Infosys
Wipro
HCLTech