• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Reliance Jio Software Developer Interview Experience

April 24, 2016 by Dhaval Dave

Reliance Jio follows similar interview pattern as other companies, like Telephonic/Written Test and Face to Face Interview. In Interview Questions most of questions were related to Coding, Data Structure, Logical Puzzles, Discussion on previous work etcetera.

Telephonic round

Round 1

Discussion about Current Work, I said regarding web-console, BackEnd coding, web crawlers. Major Discussion over web crawler and storing pattern of result.

Question 1 : Linked List is there, say  10->4->1->2->5->20. Re arrange Odd Even node such as All Odd nodes then Even nodes in reverse Order. so O/p Will be : 10->1->5->20->2->4
Explain logic and then write working Code
Hint : segregate Odd and Even list, Odd-list= 10->1->5,  Even-list = 4->2->20, Reverse Even-list, and join Odd-list and Even-list

Question 2 : Find Mutual Friends in Facebook. Discussion on how to store Two person in DS and how to store friends etc, I came up with list, then on Graph node. He asked me to write full code for Graph representation of FB person, and how his friend’s will be stored.
Discussed Logic to find mutual friend in O(n^2) then O(nlogn) and then in O(n) with space complexity O(n).
Write code for discussed solution of O(n).

Face to Face

Round 1 :
Introduce your self, what my role in organization etc

Question 1: Find Loop in Linked List, Write perfect code and mathematical explanation
Question 2: Find Bridge in Graph
Question 3: Discussion on storage for Structured and Best Algorithm with minimum time and space complexity for Finding 1st, 2nd …. nth degree between two connection in LinkedIn

Round 2 :
If Binary Tree in BST or not

Round 3 :  As in Round 2, interviewer was not satisfied by all method and coding mistake with pointer, PM again discussed Binary tree is BST or not, in that my previous code, mistake etc, and luckily I have solved my coding mistake in between Round2 and Round3 which I showed him.

Question 1: Right view of Binary Tree,
Question 2: Design a Game in which Two players play by deice and whom so ever gets 6 wins the game, but keep in mind that Game can be extend to play different game, in which win can be with 5 or 1, game entirely can change with Head or Tail, or Team’s maximum sum for deice.
Question 3: Two LinkedList sorted ascending order, merge them in such that resultant LinkedList is in descending order with code.
Question 4: Trie based Question for Dictionary, complexity to find and insert word, and working code to insert and search.

Similar Articles

Filed Under: Interview Experience

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

simple sql injection

Find the smallest window in a string containing all characters of another string

Stock Buy Sell to Maximize Profit

Test Cases for Round Function

Python List

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Sequence Finder Dynamic Programming

Longest Increasing Subsequence

Leetcode: Edit Distance

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

SAP Off Campus Hiring_ March 2015 Computer Skills

TicTacToe Game As Asked in Flipkart

Best Java Book | Top Java Programming Book for Beginners

Given a float number convert it into the string WITHOUT using any inbuilt Function

Memory Efficient LinkedList

Maximum path sum between two leaves

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

System Design: Designing a LLD for Hotel Booking

Max Sum in circularly situated Values

Stickler thief

Cisco Hiring Event 21st – 22nd Feb 2015

Flipkart SDET Interview Experience

Right view of Binary tree

SAP Off Campus Hiring_ March 2015 Sample Questions

Trapping Rain Water

Skiing on Mountains Matrix

25 horses 5 tracks Find 3 fastest puzzle

Sort an array according to the order defined by another array

Serialise Deserialise N-ary Tree

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Copyright © 2026 · Genesis Framework · WordPress · Log in