Upload Button Icon Add office photos

Filter interviews by

Freight Tiger Associate Software Engineer Interview Questions and Answers

Updated 27 Jul 2024

Freight Tiger Associate Software Engineer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Coding Test 

3 Coding questions,were asked based on DSA and strings

Round 2 - Technical 

(2 Questions)

  • Q1. Give your introduction
  • Ans. 

    I am a recent graduate with a degree in Computer Science and a passion for software development.

    • Recent graduate with a degree in Computer Science

    • Passionate about software development

    • Experience with programming languages like Java and Python

  • Answered by AI
  • Q2. DSA find k distinct characters substring which is the longest a gfg question
  • Ans. 

    Find k distinct characters substring which is the longest.

    • Use sliding window technique to iterate through the string.

    • Keep track of the characters and their frequencies in the window.

    • Update the window size and characters as needed to find the longest substring with k distinct characters.

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 120 minutes
Round difficulty - Medium

Due to pandemic placement process went virtual. Test was conducted at 10 A.M.

  • Q1. 

    Decode String Problem Statement

    Your task is to decode a given encoded string back to its original form.

    Explanation:

    An encoded string format is <count>[encoded_string], where the 'encoded_string...

  • Ans. 

    The task is to decode an encoded string back to its original form by repeating the encoded string 'count' times.

    • Parse the input string to extract the count and the encoded string within the brackets

    • Use recursion to decode the encoded string by repeating it 'count' times

    • Handle nested encoded strings by recursively decoding them

    • Output the decoded string for each test case

  • Answered by AI
  • Q2. 

    Detect and Remove Loop in Linked List

    For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.

    Expected Complexity:

    A...

  • Ans. 

    Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.

    • Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

    • Once the loop is detected, use two pointers approach to find the start of the loop.

    • Adjust the pointers to remove the loop and return the modified linked list.

    • Example: For input 5 2 and 1 2 3 4 5, output should be 1 2 3 4 5.

  • Answered by AI
  • Q3. 

    Infix to Postfix Conversion

    You are provided with a string EXP which represents a valid infix expression. Your task is to convert this given infix expression into a postfix expression.

    Explanation:

    An i...

  • Ans. 

    Convert a given infix expression to postfix expression.

    • Use a stack to keep track of operators and operands.

    • Follow the rules of precedence for operators (*, / have higher precedence than +, -).

    • Handle parentheses by pushing them onto the stack and popping when closing parenthesis is encountered.

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 30 minutes
Round difficulty - Medium

Due to pandemic placement process went virtual. Test was conducted at 2 P.M.

  • Q1. 

    Find First Repeated Character in a String

    Given a string 'STR' composed of lowercase English letters, identify the character that repeats first in terms of its initial occurrence.

    Example:

    Input:
    STR =...
  • Ans. 

    The task is to find the first repeated character in a given string of lowercase English letters.

    • Iterate through the string and keep track of characters seen so far in a set.

    • If a character is already in the set, return it as the first repeated character.

    • If no repeated character is found, return '%'.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

Video Call interview where the interview happened for around 45 minutes.

  • Q1. 

    Maximum Sum Path in a Binary Tree Problem Statement

    You are provided with a binary tree consisting of N nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...

  • Ans. 

    Find the maximum sum achievable by a simple path between any two nodes in a binary tree.

    • Traverse the binary tree to find all possible paths and calculate their sums.

    • Keep track of the maximum sum encountered during traversal.

    • Consider paths that may include the same node twice.

    • Implement a recursive function to explore all paths in the tree.

    • Optimize the solution to avoid redundant calculations.

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Video Call interview where the interview happened for around 30 minutes.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from B V Raju Institute of Technology. I applied for the job as Associate Software Engineer in HyderabadEligibility criteriaAbove 8 CGPADelhivery interview preparation:Topics to prepare for the interview - Java, Operating Systems, Git, LInux, Networking, C++, Python, DataStructures and Algorithms, OOPS, Dynamic ProgrammingTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Practise 5 problems daily from websites like hackerrank, codechef, codeforces
Tip 2 : Participate in codechef, codeforces contest.
Tip 3 : Attend mock interviews and should have good communication skills.

Application resume tips for other job seekers

Tip 1 : Maintain atleast 2 different projects, write powerful summary statement.
Tip 2 : Maintain skills relevant to job description, include relevant experience.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Assignment 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

  • Q1. Design a class booking application for students.
  • Ans. 

    A class booking application for students to schedule and manage their classes.

    • Create a class booking system where students can view available classes, book classes, and manage their schedule.

    • Include features like class search, class details, booking confirmation, and calendar view.

    • Implement user authentication to ensure only registered students can book classes.

    • Allow students to cancel or reschedule classes with proper...

  • Answered by AI
Round 2 - Telephonic Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

The interviewer understand the current problem statement I was working on. 
Asked the clarifying questions and alternative approaches to solve the same and their tradeoffs.
Also, asked about the technologies I was using in depth and reason for choosing the same.

  • Q1. 

    Gas Tank Problem Statement

    You have a car with a gas tank of infinite capacity. There are 'N' gas stations located along a circular route, numbered from 0 to N-1. You begin your journey with an empty tank...

  • Ans. 

    Find the starting gas station index to complete a circular route with gas and cost arrays.

    • Iterate through gas stations, keeping track of gas remaining after each station

    • If gas remaining is negative, reset starting station to current station + 1

    • If total gas remaining at the end is greater than or equal to total cost, return starting station index

  • Answered by AI
Round 3 - Telephonic Call 

Round duration - 45 Minutes
Round difficulty - Medium

This round was their with the CTO and was mostly the culture fitment round.

 

Round 4 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

This round was with the cofounder and was mostly culture fitment.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaNo criteriaRIVIGO interview preparation:Topics to prepare for the interview - Data Structures, Competitive Programming, Databases, Java, Spring , Hibernate, Jenkins, AWSTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice questions on leetcode
Tip 2 : Understand the best solutions in depth and algorithm used
Tip 3 : Ask clarifying questions to the interviewer and break the problem to smaller sub parts

Application resume tips for other job seekers

Tip 1 : Highlight your most impactful work on the resume
Tip 2 : Keep it easy to understand

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Referral and was interviewed in Jul 2020. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. No technical questions
  • Q2. BASIC INTERVIEW LIKE L1

Interview Preparation Tips

Interview preparation tips for other job seekers - No job guaranty, Non technical HOD, Unmanaged Infra

Interview Questionnaire 

2 Questions

  • Q1. There was so many questions asked to me in interview, i had gone through four different rounds of interview.
  • Q2. I was well prepared for the interview. I didn't know that there will be four rounds. I have faced them confidently with accurate answers within a time. They had impressed on my confidence and my verbal com...

I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Design a stack that support getmin in O(1) time and O(1) space complexities
  • Ans. 

    Design a stack that supports getmin in O(1) time and O(1) space complexities.

    • Use two stacks, one for storing the actual values and the other for storing the minimum values.

    • When pushing a new value, check if it is smaller than the current minimum value and push it to the minimum stack if it is.

    • When popping a value, check if it is the current minimum value and pop it from the minimum stack if it is.

    • To get the minimum val...

  • Answered by AI
  • Q2. Questions related OS and DBMS
  • Q3. Binary tree traversal
  • Ans. 

    Binary tree traversal is the process of visiting each node in a binary tree exactly once in a specific order.

    • There are three main types of binary tree traversal: inorder, preorder, and postorder.

    • Inorder traversal visits the left subtree, then the root, then the right subtree.

    • Preorder traversal visits the root, then the left subtree, then the right subtree.

    • Postorder traversal visits the left subtree, then the right subt...

  • Answered by AI
  • Q4. LRU cache explanation
  • Ans. 

    LRU cache is a data structure that stores the most recently used items and discards the least recently used items.

    • LRU stands for Least Recently Used

    • It has a fixed size and when the cache is full, the least recently used item is removed to make space for a new item

    • It uses a combination of a doubly linked list and a hash map to achieve O(1) time complexity for both insertion and deletion

    • Example: A web browser cache that ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Good with your programming skills and fundamentals.

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. What is diameter of Binary Tree? Write full working code.
  • Ans. 

    Diameter of a binary tree is the longest path between any two leaf nodes.

    • Calculate the height of left and right subtrees recursively.

    • Calculate the diameter recursively using the formula max(left_height + right_height + 1, max(left_diameter, right_diameter)).

    • Return the maximum diameter.

  • Answered by AI
  • Q2. Find interchanged terms from an AP, where terms are arranged in series
  • Ans. 

    To find interchanged terms from an AP series

    • Identify the common difference between terms

    • Swap the positions of adjacent terms

    • Check if the new series is also an AP

    • Repeat until no more interchanged terms can be found

  • Answered by AI
  • Q3. Explain database indexing
  • Ans. 

    Database indexing is a technique to improve the performance of database queries.

    • Indexing creates a data structure that allows for faster retrieval of data.

    • Indexes are created on one or more columns of a table.

    • Queries that use indexed columns can be executed faster.

    • Indexes can be clustered or non-clustered.

    • Clustered indexes determine the physical order of data in a table.

    • Non-clustered indexes create a separate structure...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well on basic data structures, operating systems and database.

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. What is DHCP,DNS,etc
  • Ans. 

    DHCP is a protocol that assigns IP addresses to devices on a network. DNS is a system that translates domain names to IP addresses.

    • DHCP assigns IP addresses to devices on a network

    • DNS translates domain names to IP addresses

    • DHCP reduces the need for manual IP address configuration

    • DNS allows users to access websites using domain names instead of IP addresses

  • Answered by AI
  • Q2. Dynamics host configuration Protocol Domain Name System

Skills evaluated in this interview

I applied via Walk-in and was interviewed before Jan 2021. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Prime number star pattern Js basics form validations

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn all basics of JS and node
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I was interviewed before Mar 2023.

Round 1 - Technical 

(1 Question)

  • Q1. Questions on Django middleware, models and queries
Round 2 - Technical 

(1 Question)

  • Q1. Design an algorithm to efficiently to send office bus to all location in the city
  • Ans. 

    Use a greedy algorithm to send the office bus to all locations in the city efficiently.

    • Start from the office location and pick the nearest location to visit next.

    • Continue picking the nearest unvisited location until all locations are covered.

    • Repeat the process until all locations are visited.

    • Consider using Dijkstra's algorithm or a similar approach for finding the nearest location.

    • Optimize the route by considering traf

  • Answered by AI
Round 3 - One-on-one 

(1 Question)

  • Q1. Round with CTO, mostly behavioural and expected pay

Skills evaluated in this interview

Freight Tiger Interview FAQs

How many rounds are there in Freight Tiger Associate Software Engineer interview?
Freight Tiger interview process usually has 2 rounds. The most common rounds in the Freight Tiger interview process are Coding Test and Technical.

Tell us how to improve this page.

Freight Tiger Associate Software Engineer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Delhivery Interview Questions
3.9
 • 458 Interviews
Ecom Express Interview Questions
3.8
 • 197 Interviews
BlackBuck Interview Questions
3.8
 • 174 Interviews
XpressBees Interview Questions
3.6
 • 159 Interviews
DTDC Express Interview Questions
3.7
 • 151 Interviews
Blue Dart Express Interview Questions
4.0
 • 102 Interviews
GATI-KWE Interview Questions
3.9
 • 86 Interviews
Honda Logistics Interview Questions
3.8
 • 25 Interviews
View all
Operations Executive
108 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Success Manager
22 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Executive Operations
14 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
13 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Operations Manager
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Freight Tiger with

BlackBuck

3.8
Compare

Delhivery

3.9
Compare

Ecom Express

3.8
Compare

Shadowfax Technologies

3.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview