Add office photos
Employer?
Claim Account for FREE

GeeksForGeeks

3.4
based on 164 Reviews
Filter interviews by

Jaquar Interview Questions and Answers

Updated 5 Feb 2024

Q1. Detect a loop in a linked list and return the node where the loop starts.

Ans.

Detect loop in linked list and return node where loop starts.

  • Use two pointers, one moving one node at a time and the other moving two nodes at a time

  • If there is a loop, the two pointers will eventually meet at a node inside the loop

  • Reset one of the pointers to the head of the linked list and move both pointers one node at a time

  • The node where the two pointers meet is the start of the loop

Add your answer

Q2. Find the sum of pairs in the binary search tree which is equal to k

Ans.

Find the sum of pairs in a binary search tree equal to k.

  • Traverse the tree in-order and store the values in an array.

  • Use two pointers approach to find the pairs that sum up to k.

  • Time complexity: O(n), Space complexity: O(n).

Add your answer

Q3. What is complexity and their types

Ans.

Complexity refers to the level of difficulty in solving a problem. There are two types: time complexity and space complexity.

  • Time complexity refers to the amount of time required to solve a problem, and is usually measured in terms of the number of operations performed by an algorithm.

  • Space complexity refers to the amount of memory required to solve a problem, and is usually measured in terms of the amount of memory used by an algorithm.

  • Complexity can be classified into diffe...read more

Add your answer

Q4. Schema Design of Restaurant Management System(RMS)

Ans.

Schema design for a Restaurant Management System

  • Identify entities such as customers, orders, menu items, tables, etc.

  • Create tables for each entity with appropriate attributes and relationships

  • Use foreign keys to establish relationships between tables

  • Consider normalization to avoid data redundancy and improve performance

  • Include constraints to ensure data integrity

  • Use appropriate data types for each attribute

  • Consider scalability and future requirements

Add your answer
Discover Jaquar interview dos and don'ts from real experiences

Q5. Different types of Indexing in SQL

Ans.

Different types of indexing in SQL

  • Clustered Index

  • Non-Clustered Index

  • Unique Index

  • Full-Text Index

  • Filtered Index

Add your answer

Q6. Difference between SQL and NoSQL

Ans.

SQL is a relational database management system while NoSQL is a non-relational database management system.

  • SQL databases use structured query language while NoSQL databases use unstructured query language.

  • SQL databases are vertically scalable while NoSQL databases are horizontally scalable.

  • SQL databases are good for complex queries while NoSQL databases are good for large amounts of unstructured data.

  • Examples of SQL databases include MySQL, Oracle, and PostgreSQL while example...read more

Add your answer

Q7. Design a payment gateway.

Ans.

A payment gateway is a software application that facilitates online transactions between a merchant and a customer.

  • The payment gateway should support multiple payment methods such as credit/debit cards, net banking, and digital wallets.

  • It should have a secure and reliable infrastructure to ensure the safety of customer data.

  • The gateway should have a user-friendly interface for easy navigation and payment processing.

  • It should have a robust fraud detection system to prevent fra...read more

Add your answer

Q8. Different types of traversal

Ans.

Traversal refers to visiting all the nodes of a data structure in a specific order.

  • Inorder traversal: Left subtree, root, right subtree

  • Preorder traversal: Root, left subtree, right subtree

  • Postorder traversal: Left subtree, right subtree, root

  • Level order traversal: Visit nodes level by level

Add your answer

Q9. Populate next right pointer

Ans.

Populate the next right pointer of a binary tree node

  • Traverse the tree using level order traversal

  • For each node, set its next right pointer to the next node in the same level

  • If there is no next node in the same level, set the next right pointer to NULL

Add your answer
Contribute & help others!
Write a review
Share interview
Contribute salary
Add office photos
Interview Tips & Stories
Ace your next interview with expert advice and inspiring stories

Top Software Development Engineer Interview Questions from Similar Companies

4.1
 • 45 Interview Questions
5.0
 • 16 Interview Questions
4.1
 • 14 Interview Questions
3.5
 • 12 Interview Questions
View all
Share an Interview
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
70 Lakh+

Reviews

5 Lakh+

Interviews

4 Crore+

Salaries

1 Cr+

Users/Month

Contribute to help millions
Get AmbitionBox app

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter