i
ClearTrail Technologies
Filter interviews by
I appeared for an interview before Sep 2020.
Round duration - 25 minutes
Round difficulty - Easy
This was face to face interview round. All questions asked by the interviewer were based on data structures.
Detecting a loop in a linked list involves using two pointers to traverse the list, one moving one node at a time and the other moving two nodes at a time.
Start with two pointers at the beginning of the linked list.
Move one pointer one node at a time and the other pointer two nodes at a time.
If there is a loop, the two pointers will eventually meet at the same node.
Check if two strings are anagrams of each other.
Create character frequency maps for both strings
Compare the frequency maps to check if they are equal
Handle edge cases like case sensitivity and whitespace
Always be confident in front of the interviewer but don’t be overconfident. Also for interview preparation, I took course from CodingNinjas which was a game-changer for me as I got to know all the important concepts and questions which are asked in interviews.
Application resume tips for other job seekersBe honest on resume. Keep it subtle. Even if you are a good Competitive programmer, don’t brag during interviews.
Final outcome of the interviewSelectedI applied via Company Website and was interviewed before Jun 2023. There was 1 interview round.
Joins in SQL are used to combine rows from two or more tables based on a related column between them.
Joins are used to retrieve data from multiple tables based on a related column between them
Types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN
INNER JOIN returns rows when there is at least one match in both tables
LEFT JOIN returns all rows from the left table and the matched rows from the right table
...
Objects are instances of classes in OOPs. Classes are blueprints for creating objects with attributes and methods.
Objects are instances of classes
Classes are blueprints for creating objects
Classes define attributes and methods for objects
Example: Class 'Car' with attributes like 'color' and methods like 'drive'
Array duplicates and burn binary tree
posted on 28 Feb 2025
What is javascripts, html and css
I applied via Campus Placement and was interviewed in Feb 2024. There were 4 interview rounds.
Percentage, logical reasoning
10 min and topics were chosen by ourselves
I applied via Campus Placement
Os,c,ds,aptitude(quants and logical)
I applied via Campus Placement and was interviewed in Aug 2022. There were 5 interview rounds.
Apti round took place in online mode but it is not proctored
This one is technical GD and shortlisted people will be divided into batches and will asked technical qns for which ppl has to answer
People who got shortlisted will be having another technical GD and the same process will be continued
Paging is a memory management technique used by the operating system to store and retrieve data from secondary storage.
Paging divides the memory into fixed-size pages and stores them in secondary storage.
When a process needs a page, the operating system retrieves it from secondary storage and loads it into memory.
Paging allows for efficient use of memory and helps prevent fragmentation.
Examples of operating systems tha
Various searching methods include BFS, DFS, binary search, and linear search.
BFS (Breadth-First Search) explores all the vertices at the same level before moving to the next level.
DFS (Depth-First Search) explores as far as possible along each branch before backtracking.
Binary search is a divide and conquer algorithm that searches a sorted array by repeatedly dividing the search interval in half.
Linear search checks ea...
Quick sort works by selecting a pivot element and sorting the array by divide and conquer.
Select a pivot element from the array
Divide the array into two sub-arrays, one with elements smaller than the pivot and the other with elements greater than the pivot
Recursively apply the above steps to the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Max heap has the largest element at the root while Min heap has the smallest element at the root.
Max heap is a complete binary tree where the parent node is greater than or equal to its child nodes.
Min heap is a complete binary tree where the parent node is less than or equal to its child nodes.
Heaps are commonly used in sorting algorithms like Heap Sort and Priority Queues.
Insertion and deletion operations in heaps ta
Duration was for 1 hour simple aptitude questions covering topics like speed and time, word, distance, train, stream
Technical GD on common technical topics like data networks, oops concepts, paging concepts
I applied via Job Fair and was interviewed in Mar 2024. There were 2 interview rounds.
Basic questions were asked from topics like time, cost, profits-losses, patterns etc
Questions on microprocessors , networking and sorting algorithms
I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.
Time and distance,speed,etc
IT IS SIMPLE NETWORKING CONCPT
A flip-flop is a digital circuit that can store a single bit of information.
It has two stable states, 0 and 1.
It is used in sequential logic circuits.
Examples include D flip-flop, JK flip-flop, and T flip-flop.
WLAN stands for Wireless Local Area Network and LAN stands for Local Area Network.
WLAN is a wireless network that allows devices to connect to the internet without the need for physical cables.
LAN is a wired network that connects devices within a limited area such as a building or campus.
WLAN uses radio waves to transmit data while LAN uses Ethernet cables.
Examples of WLAN include Wi-Fi networks while examples of LAN i
based on 1 review
Rating in categories
Software Engineer
72
salaries
| ₹5.5 L/yr - ₹23 L/yr |
Senior Software Engineer
50
salaries
| ₹9 L/yr - ₹30 L/yr |
Associate Software Engineer
15
salaries
| ₹3.8 L/yr - ₹8 L/yr |
Module Lead
15
salaries
| ₹15.7 L/yr - ₹36 L/yr |
Technical Support Engineer
13
salaries
| ₹5.3 L/yr - ₹11 L/yr |
Fractal Analytics
Subex
Innovatiview India Ltd
Watchyourhealth.com