i
TEKsystems
Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2022. There were 7 interview rounds.
6 sections with section timings
Aptitude 10 questions
Reasoning 10 questions
Coding 1(30min)
Data structure 10
Pseudo Code 10
About Company 5
Topic 1-drone
Topic - self driving cars
Program to count spaces and print digits in string
For counting spaces, loop through the string and check for ' ' character
For printing digits, loop through the string and check for '0' to '9' characters
Use isdigit() function in Python to check for digits
Use a counter variable to keep track of spaces
Use a separate string variable to store digits and print it at the end
String is immutable because it cannot be changed once created.
Immutable objects are safer to use in multi-threaded environments
String pool in Java is possible because of immutability
StringBuffer and StringBuilder are mutable alternatives to String
Difficult program in Python: A web scraper to extract data from dynamic websites. Difficult program in C: A program to implement a custom data structure.
Python program required knowledge of web scraping libraries like BeautifulSoup and Selenium
C program required understanding of memory management and pointers
Python program had to handle dynamic website elements and login authentication
C program had to implement a custo...
I appeared for an interview before Aug 2023.
Easy questions can be solved simply
Nothing much have to speak about topic
Understanding basic data structures and algorithms is crucial for coding interviews.
Data Structures: Arrays, Linked Lists, Stacks, Queues, Trees, Graphs.
Algorithms: Sorting (e.g., Quick Sort, Merge Sort), Searching (e.g., Binary Search).
Complexity Analysis: Big O notation to evaluate performance.
Example: Use a stack to reverse a string efficiently.
I applied via Campus Placement and was interviewed before Apr 2023. There were 5 interview rounds.
It was a online test on one of the platforms, with basic aptitude and reasoning.
Consisted of 3 coding questions
A topic was given and their views were asked one by one in a group, online through zoom
Binary search is an efficient algorithm for finding an item from a sorted array by repeatedly dividing the search interval in half.
Binary search works on sorted arrays only.
It has a time complexity of O(log n), making it faster than linear search (O(n)).
Example: To find '5' in [1, 2, 3, 4, 5, 6], check middle element (4), then search right half [5, 6].
The algorithm can be implemented recursively or iteratively.
Top trending discussions
I applied via Recruitment Consulltant and was interviewed before Aug 2021. There was 1 interview round.
I appeared for an interview in Jun 2017.
I applied via LinkedIn and was interviewed before Jun 2020. There were 3 interview rounds.
posted on 10 Dec 2021
I applied via Recruitment Consultant and was interviewed before Dec 2020. There were 3 interview rounds.
posted on 17 Jan 2021
I applied via Naukri.com and was interviewed in Dec 2020. There were 3 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Oct 2021. There were 3 interview rounds.
They will ask you simple programs to check your logical abilities.
I applied via Approached by Company and was interviewed before Sep 2021. There was 1 interview round.
based on 2 interview experiences
Difficulty level
Duration
based on 21 reviews
Rating in categories
Senior Software Engineer
1.3k
salaries
| ₹8 L/yr - ₹27 L/yr |
Software Engineer
987
salaries
| ₹4.5 L/yr - ₹20 L/yr |
Technical Lead
345
salaries
| ₹11.2 L/yr - ₹38 L/yr |
Module Lead
285
salaries
| ₹10 L/yr - ₹29.7 L/yr |
Software Developer
218
salaries
| ₹5 L/yr - ₹21.1 L/yr |
Synechron
Movate
Sopra Steria
NCR Corporation