JobsJob TrackerJob alerts

PropTiger ยท 24 questions

All 24Coding 21Low-Level Design 1
  • Postorder from Inorder and PreorderCoding
  • Objective Assessment on Aptitude and DBMS
  • Determine height of a binary treeCoding
  • Determine diameter of a binary treeCoding
  • Check if all leaves in a binary tree are at the same levelCoding
  • Validate a Binary Search TreeCoding
  • Find square root of a numberCoding
  • Print all permutations of a stringCoding
  • Print all root-to-leaf paths in a binary treeCoding
  • Connect leaves of a binary tree to form a doubly linked listCoding
  • Coin change problemCoding
  • Largest Sum Contiguous SubarrayCoding
  • Repeating element in sorted arrayCoding
  • Max depth of binary treeCoding
  • Children Sum Property treeCoding
  • Divisibility by prime divisorsCoding
  • Return duplicate elements in sorted orderCoding
  • Reverse words and capitalize first letterCoding
  • Maximum sum by flipping a continuous subarrayCoding
  • Search an element in rotated sorted arrayCoding
  • Convert a binary tree to a doubly linked listCoding
  • DBMS Normal Forms, Joins and Nested QueriesLow-Level Design
  • Top k largest elementsCoding
  • OS Deadlocks and Producer Consumer Problem
โ† PropTiger questions
  1. Interview questions
  2. PropTiger
  3. DBMS Normal Forms, Joins and Nested Queries
Low-Level Design

DBMS Normal Forms, Joins and Nested Queries

Filed under PropTiger

The question

Discuss DBMS normal forms, SQL joins, nested queries, and project architecture.

No write-up yet. Related questions below have one.

โ† Convert a binary tree to a doubly linked listTop k largest elements โ†’

Collected from public candidate posts and coding forums. Updated Nov 2026.